Abstract
A traceability scheme is a broadcast encryption scheme such that a data supplier T can trace malicious authorized users (traitors) who gave a decryption key to an unauthorized user (pirate). This paper first derives lower bounds on the sizes of keys and ciphertexts. These bounds are all tight because an optimum one-time use scheme is also presented. We then propose a multiple-use scheme which approximately meets our bounds. This scheme is proven to be secure as well as much more efficient than the schemes by Chor, Fiat and Naor. Finally, practical types of asymmetric schemes with arbiter are discussed in which T cannot frame any authorized user as a traitor.
A part of this work has been supported by JAIST.
A part of this research has been supported by NSF Grant NCR-9508528.
Chapter PDF
References
D. Chaum, I.B. Damgard, and J. Graaf. “Multiparty computations ensuring privacy of each party's input and correctness of the result”. In Proc. of Crypto '87, Lecture Notes in Computer Science, LNCS 293, Springer Verlag, pages 87–119, 1988.
B. Chor, A. Fiat, and M. Naor. “Tracing traitors”. In Proc. of Crypto'94, Lecture Notes in Computer Science, LNCS 839, Springer Verlag, pages 257–270, 1994.
A. De Santis, Y. Desmedt, Y. Frankel, and M. Yung. “How to share a funciton securely ”. In Proc. of STOC'94, pages 522–533, 1994.
Y. Desmedt and Y. Frankel. “Threshold cryptosystems”. In Proc. of Crypto'89, Lecture Notes in Computer Science, LNCS 435, Springer Verlag, pages 307–315, 1990.
Y. Desmedt and Y. Frankel. “Homomorphi zero-knowledge threshold schemes over any finite Abelian group ”. In SI AM J. on Discrete Math., vol.7, no.4, pages 667–679, 1994.
Y. Desmedt, Y. Frankel, and M. Yung. Multi-receiver / multi-sender network security: efficient authenticated multicast/ feedback. In IEEE INFOCOM '92, pp. 2045–2054, 1992.
O. Goldreich, S. Micali, and A. Wigderson. “How to Play Any Mental Game”. In Proc. of the 19th ACM Symposium on Theory of Computing, pages 218–229, 1987.
T. Pedersen. “A threshold cryptosystem without a trusted party”. In Proc. of Eurocrypt'91, Lecture Notes in Computer Science, LNCS 547, Springer Verlag, pages 522–526, 1991.
B. Pfitzmann. “Trials of traced traitors”. In Proc. of Information Hiding, Lecture Notes in Computer Science, LNCS 1174, Springer Verlag, pages 49–64, 1996.
B. Pfitzmann and M. Waidner. “Asymmetric fingerprinting for larger collusions”. In 4th ACM Conference on Computer and Communication Security, 1997.
D. Stinson and R. Wei. “Combinatorial properties and constructions of traceability schemes and frameproof codes”. In SIAM J. on Discrete Math., vol.11, no.1, pages 41–53, 1998.
“The CRC handbook of combinatorial designs”. In CRC press inc., 1996.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1998 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kurosawa, K., Desmedt, Y. (1998). Optimum traitor tracing and asymmetric schemes. In: Nyberg, K. (eds) Advances in Cryptology — EUROCRYPT'98. EUROCRYPT 1998. Lecture Notes in Computer Science, vol 1403. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0054123
Download citation
DOI: https://doi.org/10.1007/BFb0054123
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-64518-4
Online ISBN: 978-3-540-69795-4
eBook Packages: Springer Book Archive