Abstract
An important open problem in the area of Traitor Tracing is designing a scheme with constant expansion of the size of keys (users’ keys and the encryption key) and of the size of ciphertexts with respect to the size of the plaintext. This problem is known from the introduction of Traitor Tracing by Chor, Fiat and Naor. We refer to such schemes as traitor tracing with constant transmission rate. Here we present a general methodology and two protocol constructions that result in the first two public-key traitor tracing schemes with constant transmission rate in settings where plaintexts can be calibrated to be sufficiently large. Our starting point is the notion of “copyrighted function” which was presented by Naccache, Shamir and Stern. We first solve the open problem of discrete-log-based and public-key-based “copyrighted function.” Then, we observe the simple yet crucial relation between (public-key) copyrighted encryption and (public-key) traitor tracing, which we exploit by introducing a generic design paradigm for designing constant transmission rate traitor tracing schemes based on copyrighted encryption functions. Our first scheme achieves the same expansion efficiency as regular ElGamal encryption. The second scheme introduces only a slightly larger (constant) overhead, however, it additionally achieves efficient black-box traitor tracing (against any pirate construction).
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Dan Boneh, The Decision Diffie-Hellman Problem, In Proceedings of the Third Algorithmic Number Theory Symposium, Lecture Notes in Computer Science, Vol. 1423, Springer-Verlag, pp. 48–63, 1998.
Dan Boneh and Matthew Franklin, An Efficient Public-Key Traitor Tracing Scheme, CRYPTO 1999.
Dan Boneh and James Shaw, Collusion-Secure Fingerprinting for Digital Data (Extended Abstract), CRYPTO 1995, Springer, pp. 452–465.
Ran Canetti, Yevgeniy Dodis, Shai Halevi, Eyal Kushilevitz, and Amit Sahai, Exposure-Resilient Functions and All-or-Nothing Transforms, EUROCRYPT 2000.
Dario Catalano, and Rosario Gennaro, New Efficient and Secure Protocols for Verifiable Signature Sharing and Other Applications, CRYPTO 1998.
Benny Chor, Amos Fiat, and Moni Naor, Tracing Traitors, CRYPTO 1994.
Benny Chor, Amos Fiat, Moni Naor, and Benny Pinkas, Tracing Traitors, IEEE Transactions on Information Theory, Vol. 46,3, 893–910, 2000.
Taher El Gamal, A Public Key Cryptosystem and a Signature Scheme Based on Discrete Logarithms, CRYPTO 1984.
Amos Fiat and T. Tassa, Dynamic Traitor Tracing, CRYPTO 1999.
Matthew K. Franklin and Stuart Haber, Joint Encryption and Message-Efficient Secure Computation, Journal of Cryptology 9(4), pp. 217–232, 1996.
Eli Gafni, Jessica Staddon and Yiqun Lisa Yin, Efficient Methods for Integrating Traceability and Broadcast Encryption, CRYPTO 1999.
Shafi Goldwasser and Silvio Micali, Probabilistic Encryption, JCSS 28(2): pp. 270–299, 1984.
Aggelos Kiayias and Moti Yung, Self Protecting Pirates and Black-Box Traitor Tracing, CRYPTO 2001.
Aggelos Kiayias and Moti Yung, On Crafty Pirates and Foxy Tracers, Proceedings of the 1st Workshop on Security and Privacy in Digital Rights Management, 2001.
K. Kurosawa and Y. Desmedt, Optimum Traitor Tracing and Asymmetric Schemes, Eurocrypt 1998.
G. Miller, Riemann’s Hypothesis and Tests for Primality, Journal of Computer and System Sciences, vol. 13, 300–317, 1976.
David Naccache, Adi Shamir, and Julien P. Stern, How to Copyright a Function?, In the Proceedings of Public Key Cryptography 1999, Springer, 188–196.
Dalit Naor, Moni Naor, and Jeffrey B. Lotspiech Revocation and Tracing Schemes for Stateless Receivers, CRYPTO 2001.
Moni Naor and Benny Pinkas, Threshold Traitor Tracing, CRYPTO 1998.
Moni Naor and Benny Pinkas, Efficient Trace and Revoke Schemes, In the Proceedings of Financial Crypto’ 2000, Anguilla, February 2000.
Moni Naor and Omer Reingold, Number-Theoretic Constructions of Efficient Pseudo-Random Functions, FOCS 1997.
Birgit Pfitzmann, Trials of Traced Traitors, Information Hiding Workshop, Spring LNCS 1174, pp. 49–63, 1996.
Ron Rivest, All-or-nothing Encryption and the Package Transform, Fast Software Encryption 1997.
Reihaneh Safavi-Naini and Yejing Wang, Sequential Traitor Tracing, CRYPTO 2000.
Reihaneh Safavi-Naini and Yejing Wang, Collusion Secure q-ary Fingerprinting for Perceptual Content, Proceedings of the 1st Workshop on Security and Privacy in Digital Rights Management, 2001.
Reihaneh Safavi-Naini and Yejing Wang, New Results on Frameproof Codes and Traceability Schemes, IEEE Transactions on Information Theory, Vol. 47, No. 7, pp. 3029–3033, 2001.
Jessica N. Staddon, Douglas R. Stinson and Ruizhong Wei, Combinatorial Properties of Frameproof and Traceability Codes, Cryptology ePrint Archive, report 2000/004.
Douglas R. Stinson and Ruizhong Wei, Combinatorial Properties and Constructions of Traceability Schemes and Frameproof Codes, SIAM J. on Discrete Math, Vol. 11, no. 1, 1998.
Yiannis Tsiounis and Moti Yung, On the Security of ElGamal Based Encryption, Public Key Cryptography 1998.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kiayias, A., Yung, M. (2002). Traitor Tracing with Constant Transmission Rate. In: Knudsen, L.R. (eds) Advances in Cryptology — EUROCRYPT 2002. EUROCRYPT 2002. Lecture Notes in Computer Science, vol 2332. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-46035-7_30
Download citation
DOI: https://doi.org/10.1007/3-540-46035-7_30
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-43553-2
Online ISBN: 978-3-540-46035-0
eBook Packages: Springer Book Archive