Optimal communication complexity of generic multicast key distribution

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

Volumn 3027, Issue , 2004, Pages 153-170

  Micciancio, Daniele ^a   Panjwani, Saurabh ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

Key distribution; Lower bounds; Multicast

Indexed keywords

CRYPTOGRAPHY;

GENERIC PROTOCOLS; GROUP MANAGERS; KEY DISTRIBUTION; LOWER BOUNDS; OPTIMAL COMMUNICATION; PSEUDO RANDOM; SECURE MULTICASTS; SYMMETRIC KEY ENCRYPTION;

MULTICASTING;

EID: 25444488186     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-24676-3_10     Document Type: Article

References (16)

1. M. Abadi and P. Rogaway. Reconciling two views of cryptography (the computational soundness of formal encryption). Journal of Cryptology, 15(2):103-127, 2002.
2. D. Boneh, G. Durfee, and M. Franklin. Lower bounds for multicast message authentication. In B. Pfitzmann, editor, Advances in Cryptology - EUROCRYPT 2001, Proceedings of the International Conference on the Theory and Application of Cryptographic Techniques, volume 2045 of Lecture Notes in Computer Science, pages 437-452, Innsbruck, Austria, May 2001. Springer-Verlag.
3. R. Canetti, J. Garay, G. Itkis, D. Micciancio, M. Naor, and B. Pinkas. Multicast security: A taxonomy and some efficient constructions. In INFOCOM 1999. Proceedings of the Eighteenth Annual Joint Conference of the IEEE Computer and Communications Societies, volume 2, pages 708-716, New York, NY, Mar. 1999. IEEE.
4. R. Canetti, T. Malkin, and K. Nissim. Efficient communication-storage tradeoffs for multicast encryption. In J. Stern, editor, Advances in Cryptology - EUROCRYPT '99, Proceedings of the International Conference on the Theory and Application of Cryptographic Techniques, volume 1592 of Lecture Notes in Computer Science, Prague, Czech Republic, May 1999. Springer-Verlag.
5. D. Dolev and A. Yao. On the security of public key protocols. IEEE Transactions on Information Theory, 29(2):198-208, 1983.
6. A. Fiat and M. Naor. Broadcast encryption. In D. R. Stinson, editor, Advances in Cryptology- CRYPTO '93, Proceedings of the 13th annual international Cryptology conference, volume 773 of Lecture Notes in Computer Science, pages 480-491, Santa Barbara, California, USA, Aug. 1993. Springer-Verlag.
7. R. Gennaro. A protocol to achieve independence in constant rounds. IEEE Transactions on Parallel and Distributed Systems, 11(7):636-647, 2000.
8. O. Goldreich, S. Goldwasser, and S. Micali. How to construct random functions. Journal of the ACM, 33:792-807, 1986.
9. H. Harney and G. Muckenhirn. Group key management protocol (GKMP) architecture. Request for Comments 2094, Internet Engineering Task Force, July 1997.
10. H. Harney and C. Muckenhirn. Group key management protocol (GKMP) specification. Request for Comments 2093, Internet Engineering Task Force, July 1997.
11. M. Luby and J. Staddon. Combinatorial Bounds for Broadcast Encryption. In K. Nyberg, editor, Advances in Cryptology - EUROCRYPT '98, Proceedings of the International Conference on the Theory and Application of Cryptographic Techniques, volume 1403 of Lecture Notes in Computer Science, pages 512-526, Espoo, Finland, May 1998. Springer-Verlag.
12. D. Micciancio and B. Warinschi. Completeness theorems for the abadi-rogaway logic of encrypted expressions. Journal of Computer Security, 12(1):99-129, 2004. Preliminary version in WITS 2002.
13. A. Perrig, D. X. Song, and J. D. Tygar. ELK, A New Protocol for Efficient LargeGroup Key Distribution. In IEEE Symposium on Security and Privacy, pages 247-262, Oakland, CA, USA, May 2001. IEEE.
14. J. Snoeyink, S. Suri, and G. Varghese. A lower bound for multicast key distribution. In INFOCOM 2001. Proceedings of the Twentieth Annual Joint Conference of the IEEE Computer and Communications Societies, volume 1, pages 422-431, New York, NY, Apr. 2001. IEEE.
15. D. M. Wallner, E. G. Harder, and R. C. Agee. Key management for multicast: issues and architecture. Request for Comments 2627, Internet Engineering Task Force, June 1999.
16. C. K. Wong, M. Gouda, and S. S. Lam. Secure group communications using key graphs. IEEE/ACM Transactions on Networking, 8(1):16-30, Feb. 2000. Preliminary version in SIGCOMM 1998.