Towards making broadcast encryption practical

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1648, Issue , 1999, Pages 140-157

  Abdalla, Michel ^a   Shavitt, Yuval ^b   Wool, Avishai ^b  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b LUCENT TECHNOLOGIES   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CHROMIUM COMPOUNDS; ECONOMIC AND SOCIAL EFFECTS; MULTICASTING;

BROADCAST CHANNELS; BROADCAST ENCRYPTION; BROADCAST ENCRYPTION SCHEMES; EXTENSIVE SIMULATIONS; NUMBER OF TRANSMISSIONS; PRACTICAL SCHEMES; SECURE MEMORY; THEORETICAL BOUNDS;

CRYPTOGRAPHY;

EID: 22644448826     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48390-x_11     Document Type: Conference Paper

References (23)

1. C. Blundo and A. Cresti. Space requirements for broadcast encryption. In A. De Santis, editor, Advances in Cryptology - EUROCRYPT'94, LNCS 950, pages 287-298. Springer-Verlag, 1994.
2. C. Blundo, L. A. Frota Mattos, and D. R. Stinson. Generalized Beimel-Chor schemes for broadcast encryption and interactive key distribution. Theoretical Computer Science, 200(1-2):313-334, 1998.
3. C. J. Colbourn and J. H. Dinitz. The CRC Handbook of Combinatorial Designs. CRC Press, Boca Raton, 1996.
4. J. L. Cohen, M. H. Etzel, D. W. Faucher, and D. N. Heer. Security for broadband digital networks. Communications Technology, pages 58-69, August 1995.
5. B. Chor, A. Fiat, and M. Naor. Tracing traitors. In Yvo G. Desmedt, editor, Advances in Cryptology - CRYPTO'94, LNCS 839, pages 257-270. Springer-Verlag, 1994.
6. U. Feige. A threshold of ln n for approximating set cover. J. ACM, 45(4):634-652, July 1998.
7. A. Fiat and M. Naor. Broadcast encryption. In Advances in Cryptology - CRYPTO'93, LNCS 773, pages 480-491. Springer-Verlag, 1994.
8. Gemplus: Catalog of products and services. http://www.gemplus.com/globaloffer/index.htm, 1998.
9. M. R. Garey and D. S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, San Francisco, 1979.
10. T. Grossman and A. Wool. Computational experience with approximation algorithms for the set covering problem. Euro. J. Operational Research, 101(1):81-92, August 1997.
11. E. Gabber and A. Wool. How to prove where you are: Tracking the location of customer equipment. In Proc. 5th ACM Conf. Computer and Communications Security (CCS), pages 142-149, San Francisco, November 1998.
12. D. S. Hochbaum. (ed.) Approximation Algorithms for NP-Hard Problems. PWS Publishing Company, Boston, MA, 1995.
13. R. Jain. The Art of Computer Systems Performance Analysis. John Wiley & Sons, 1991.
14. D. S. Johnson. Approximation algorithms for combinatorial problems. J. Computer System Sci., 9:256-278, 1974.
15. L. Lovász. On the ratio of optimal integral and fractional covers. Disc. Math., 13:383-390, 1975.
16. M. Luby and J. Staddon. Combinatorial bounds for broadcast encryption. In K. Nyberg, editor, Advances in Cryptology - EUROCRYPT'98, LNCS 1403, pages 512-526, Espoo, Finland, 1998. Springer-Verlag.
17. J. McCormac. European Scrambling Systems 5. Waterford University Press, Waterford, Ireland, 1996.
18. W. H. Mills and R. C. Mullin. Coverings and packings. In J. H. Dinitz and D. R. Stinson, editors, Contemporary Design Theory: A Collection of Surveys, pages 317-399. John Wiley & Sons, 1992.
19. B. M. Macq and J.-J. Quisquater. Cryptology for digital TV broadcasting. Proceedings of the IEEE, 83(6):944-957, 1995.
20. M. Naor and B. Pinkas. Threshold traitor tracing. In Advances in Cryptology - CRYPTO'98, LNCS 1462. Springer-Verlag, 1998.
21. J. Schönheim. On coverings. Pacific J. Math., 14:1405-1411, 1964.
22. D. R. Stinson and T. van Trung. Some new results on key distribution patterns and broadcast encryption. Designs, Codes and Cryptography, 14(3):261-279, 1998.
23. A. Wool. Key management for encrypted broadcast. In Proc. 5th ACM Conf. Computer and Communications Security (CCS), pages 7-16, San Francisco, November 1998.