Abstract
We proposed a new public-key traitor tracing scheme with revocation capability using the dynamic share and entity revocation techniques. The enabling block of our scheme is independent of the number of subscribers, but dependent on the collusion and revocation thresholds. Each receiver holds one decryption key only. Our traitor tracing algorithm works in a black-box way and is conceptually simple. The distinct feature of our scheme is that when the traitors are found, we can revoke their private keys (up to some threshold z) without updating any private key of the remaining subscribers. Furthermore, we can restore the decryption privilege of a revoked private key later. We can actually increase the revocation capability beyond z with dynamic assignment of shares into the enabling block. This property makes our scheme highly practical. Previously proposed public-key traitor tracing schemes have to update all existing private keys even when revoking one private key only. Our scheme is as efficient as Boneh and Franklin's scheme in many aspects. Our traitor tracing scheme is fully k-resilient such that our traitor tracing algorithm can find all traitors if the number of them is k or less. The encryption algorithm of our scheme is semantically secure assuming that the decisional Diffie-Hellman problem is hard. We also proposed a variant traitor tracing scheme whose encryption algorithm is semantically secure against the adaptive chosen ciphertext attack assuming hardness of the decisional Diffie-Hellman problem.
Research supported in part by the National Science Council grant NSC-89-2213-E- 009-180 and by the Ministry of Education grant 89-E-FA04-1-4, Taiwan, ROC.
Chapter PDF
Similar content being viewed by others
References
M. Abdalla, Y. Shavitt, A. Wool, “Key management for restricted multicast using broadcast encryption”, Proceedings of Financial Cryptology 99, Lecture Notes in Computer Science 1648, Springer Verlag, 1999
J. Anzai, N. Matsuzaki, T. Matsumoto, “A quick group key distribution scheme with ~“ntity revocation””, Proceedings of Advances in Cryptology-Asiacrypt 99,Lecture Notes in Computer Science 1716, pp.333–347, Springer Verlag, 1999
D. Boneh, M. Franklin, “An efficient public key traitor tracing scheme”, Proceedings of Advances in Cryptology-Crypto 99, Lecture Notes in Computer Science 1666,pp.338–353, Springer Verlag, 1999
D. Boneh, J. Shaw, “Collusion-secure fingerprinting for digital data”, IEEE Trasaction on Information Theory 44(5), pp.1897–1905, 1998. (See also, Proceedings of Advances in Cryptology-Crypto 95, Lecture Notes in Computer Science 963,pp.452-465, Springer Verlag, 1995)
R. Canetti, T. Malkin, K. Nissim, “Efficient communication-storage tradeoffs for multicast encryption”, Proceedings of Adnaces in Cryptology-Eurocrypt 99, Lecture Notes in Computer Science 1592, pp.459–474, 1999
B. Chor, A. Fiat, M. Naor, “Tracing traitor”, Proceedings of Advances in Cryptology-Crypto 94, Lecture Notes in Computer Science 839, pp.257–270, Springer Verlag,1994
R. Cramer, V. Shoup, “A practical public key cryptosystem provably secure against adaptive chosen ciphertext attack”, Proceedings of Advances in Cryptology-Crypto98, Lecture Notes in Computer Science 1462, pp.13–25, Springer Verlag, 1998
T. ElGamal, “A public-key cryptosystem and a signature scheme based on discrete logarithms”, IEEE Transactions on Information Theory 31(4), pp.469–472, 1985
A. Fiat, T. Tassa, “Dynamic traitor tracing”, Proceedings of Advances in Cryptology-Crypto 99, Lecture Notes in Computer Science 1666, pp.354–371, SpringerVerlag, 1999
A. Fiat, M. Naor, “Broadcast encryption”, Proceedings of Advances in Cryptology-Crypto 93, Lecture Notes in Computer Science773, pp.480–491, Springer Verlag,1993
E. Gafni, J. Staddon, Y.L. Yin, “Effcient methods for integrating traceability and broadcast encryption”, Proceedings of Advances in Cryptology-Crypto 99, Lecture Notes in Computer Science 1666, pp.372–387, Springer Verlag, 1999
R. Kumar, S. Rajagopalan, A. Sahai, “Coding constructions for blacklisting problems without computational assumptions”, Proceedings of Advances in Cryptology-Crypto 99, Lecture Notes in Computer Science 1666, pp.609–623, Springer Verlag,1999
K. Kurosawa, Y. Desmedt, “Optimum traitor tracing and asymmetric schemes”,Proceedings of Advances in Cryptology-Eurocrypt 98, Lecture Notes in Computer Science 1403, pp.145–157, Springer Verlage, 1998
M. Luby, J. Staddon, “Combinatorial bounds for braodcast encryption”, Proceedings of Advances of Cryptology-Eurocrypt 98, Lecture Notes in Compouter Science 1403, pp.512–526, Springer Verlag, 1998
M. Naor, B. Pinkas, “Threshold traitor tracing”, Proceedings of Advances in Cryptology-Crypto 98, Lecture Notes in Computer Science 1462, pp.502–517, Springer Verlag, 1998
M. Naor, B. Pinkas, “Efficient trace and revoke schemes”, Proceedings of Financial Cryptography 00, 2000
B. Pfitzmann, “Trials of traced traitors”, Proceedings of Workshop on Information Hiding, Lecture Notes in Computer Science 1174, pp.49–64, Springer Verlag, 1996
B. Pfitzmann, M. Waidner, “Asymmetric fingerprinting for large collusions”, Proceedings of ACM Conference on Computer and Communication Security, pp.151–160, 1997
A. Shamir, “How to share a secret”, Communications of the ACM, 22(11), pp.612–613, 1979
D.R. Stinson, R. Wei, “Combinatorial properties and constructions of traceability schemes and frameproof codes”, SIAM J. on Discrete Math 11(1), pp.41–53, 1998
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Tzeng, WG., Tzeng, ZJ. (2001). A Public-Key Traitor Tracing Scheme with Revocation Using Dynamic Shares. In: Kim, K. (eds) Public Key Cryptography. PKC 2001. Lecture Notes in Computer Science, vol 1992. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44586-2_16
Download citation
DOI: https://doi.org/10.1007/3-540-44586-2_16
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-41658-6
Online ISBN: 978-3-540-44586-9
eBook Packages: Springer Book Archive