Abstract
In many applications for content distribution, broadcast channels are used to transmit information from a distribution center to a large set of users. Broadcast encryption schemes enable the center to prevent certain users from recovering the information that is broadcast in encrypted form, while traceability schemes enable the center to trace users who collude to produce pirate decoders. In this paper, we study general methods for integrating traceability and broadcasting capability. In particular, we present a method for adding any desired level of broadcasting capability to any traceability scheme and a method for adding any desired level of traceability to any broadcast encryption scheme. To support our general methods, we also present new constructions of broadcast encryption schemes which are close to optimal in terms of the total number keys required. Our new schemes are the first to be both maximally resilient and fully scalable.
Most of this work was done while the authors were working at RSA Laboratories.
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
M. Abdalla, Y. Shavitt and A. Wool. Towards Making Broadcast Encryption Practical. To appear in the Proceedings of Financial Cryptography’ 99, Lecture Notes in Computer Science.
L. Babai and P. Frankl. Linear Algebra Methods in Combinatorics with Applications to Geometry and Computer Science. Preliminary Version 2, September 1992. Available from the authors.
S. Berkovits. How to Broadcast a Secret. In Advances in Cryptology-Eurocrypt’ 91, Lecture Notes in Computer Science 547 (1992), pp. 536–541.
C. Blundo and A. Cresti. Space Requirements for Broadcast Encryption. In Advances in Cryptology-Eurocrypt’ 94, Lectures Notes in Computer Science 950 (1994), pp. 287–298.
C. Blundo, L. A. Frota Mattos and D. Stinson. Trade-offs Between Communication and Storage in Unconditionally Secure Systems for Broadcast Encryption and Interactive Key Distribution. In Advances in Cryptology-Crypto’ 96, Lecture Notes in Computer Science 1109 (1996), pp. 387–400.
R. Canetti, T. Malkin and K. Nissim. Efficient Communication-Storage Tradeoffs for Multicast Encryption. In Advances in Cryptology-Eurocrypt’ 99, Lecture Notes in Computer Science.
B. Chor, A. Fiat, and M. Naor. Tracing Traitors. In Advances in Cryptology-Crypto’ 94, Lecture Notes in Computer Science 839 (1994), pp. 257–270. Final version with B. Pinkas, preprint.
P. Erdos, P. Frankl and Z. Furedi. Families of Finite Sets in which No Set is Covered by the Union of r Others. Israel Journal of Mathematics 51 (1985), pp.75–89.
A. Fiat and M. Naor. Broadcast Encryption. In Advances in Cryptology-Crypto’ 93, Lectures Notes in Computer Science 773 (1994), pp. 480–491.
M. Just, E. Kranakis, D. Krizanc and P. van Oorschot. On Key Distribution via True Broadcasting. In Proceedings of 2nd ACM Conference on Computer and Communications Security, November 1994, pp. 81–88.
M. Luby and J. Staddon. Combinatorial Bounds for Broadcast Encryption. In Advances in Cryptology-Eurocrypt’ 98, Lecture Notes in Computer Science, 1403 (1998), pp. 512–526.
M. Naor and B. Pinkas. Threshold Traitor Tracing. In Advances in Cryptology-Crypto’ 98, Lecture Notes in Computer Science, 1462 (1998), pp. 502–517.
J. Staddon. A Combinatorial Study of Communication, Storage and Traceability in Broadcast Encryption Systems. Ph.D. thesis, University of California at Berkeley, 1997.
D. Stinson. Cryptography: Theory and Practice. CRC Press, 1995.
D. Stinson. On Some Methods for Unconditionally Secure Key Distribution and Broadcast Encryption. Designs, Codes and Cryptography 12 (1997), pp. 215–243.
D. Stinson and T. van Trung. Some New Results on Key Distribution Patterns and Broadcast Encryption. Designs, Codes and Cryptography 14 (1998), pp. 261–279.
D. Stinson and R. Wei. Combinatorial Properties and Constructions of Traceability Schemes and Frameproof Codes. SIAM J. Discrete Math, 11 (1998), pp. 41–53.
D. Stinson and R. Wei. Key Preassigned Traceability Schemes for Broadcast Encryption. In the Proceedings of SAC’ 98, Lecture Notes in Computer Science, 1556 (1999), pp. 144–156.
D. Stinson and R. Wei. An Application of Ramp Schemes to Broadcast Encryption. Information Processing Letters 69 (1999), pp. 131–135.
D. Wallner, E. Harder and R. Agee. Key Management for Multicast: Issues and Architectures. Internet Draft, 1997.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Gafni, E., Staddon, J., Yin, Y.L. (1999). Efficient Methods for Integrating Traceability and Broadcast Encryption. In: Wiener, M. (eds) Advances in Cryptology — CRYPTO’ 99. CRYPTO 1999. Lecture Notes in Computer Science, vol 1666. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48405-1_24
Download citation
DOI: https://doi.org/10.1007/3-540-48405-1_24
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-66347-8
Online ISBN: 978-3-540-48405-9
eBook Packages: Springer Book Archive