Multicast security: A taxonomy and some efficient constructions

Proceedings - IEEE INFOCOM

Volumn 2, Issue , 1999, Pages 708-716

  Canetti, Ran ^a   Garay, Juan ^b   Itkis, Gene ^c   Micciancio, Daniele ^d   Naor, Moni ^e   Pinkas, Benny ^e  

^a IBM T J WATSON RESEARCH CENTER   (United States)

^b Lucent Bell Labs   (United States)

^c News Data Systems   (United States)

^d MIT Research   (United States)

^e WEIZMANN INSTITUTE OF SCIENCE   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

COMPLEX PROBLEMS; EFFICIENT CONSTRUCTION; KEY REVOCATION; MESSAGE AUTHENTICATION CODES; MULTICAST COMMUNICATION; MULTICAST PROTOCOL; MULTICAST SCENARIOS; MULTICAST SECURITY; MULTICASTS; SECURITY MECHANISM; SECURITY PROBLEMS; SECURITY PROTOCOLS; SOURCE AUTHENTICATION; UNICAST;

AUTHENTICATION; INTERNET PROTOCOLS; MULTICASTING; NETWORK SECURITY; TAXONOMIES; INTERNET; NETWORK PROTOCOLS; SECURITY OF DATA;

COMMUNICATION; MULTICASTING;

DIGITAL SIGNATURES; MESSAGE AUTHENTICATION CODES;

EID: 0032661699     PISSN: 0743166X     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/INFCOM.1999.751457     Document Type: Conference Paper

References (30)

1. A. Albanese, J. Bloemer, J. Edmonds, M. Luby and M. Sudan, "Priority Encoding Transmission", IEEE Tran. on Inf. Th., Vol. 42. No. 6, Nov. 1996.
2. N. Alon, "Probabilistic Methods in External Finite Set Theory", in Extremal Problems for Finite Sets, 1991, 39-57.
3. A. J. Ballardie, "A New Approach to Multicast Communication in a Datagram Network", Ph.D. Thesis, University College London, May 1995.
4. M. Bellare, R. Canetti and H. Krawczyk, "Keying Hash Functions for Message Authentication", Advances in Cryprology - Cgpto'96, LNCS vol. 1109. Springer-Verlag, 1996.
5. M. Blum and S. Micali, "How to Generate Cryptographically Strong Sequences of Pseudo-Random Bits", SIAM J. on Comp., 13, 1984, 850-864.
6. C. Blundo. A. De Santis, A. Herzberg, S. Kutten, U. Vaccaro and M. Yung, "Perfectly-secure key distribution for dynamic conferences, Advances in Cryptofogy - Crypro'92, LNCS vol. 740. Springer-Verlag. 1993, 471- 486.
7. R. Canetti. R. Gennaro. D. Herzberg and D. Naor, "Proactive Security: Long-term protection against break-ins", Crypto Bytes, Vol. 3, No. 1, Sprint 1997.
8. R. Canetti and B. Pinkas, "A taxonomy of multicast security issues". internetdraftdraft-canetti-secure-multicast-taxonomy- -01. txt. November 1998.
9. Y. Desmedt and Y. Frankel,'Threshold cryptosystems". Advances in Cryptology - Crypto'89, LNCS vol. 435, Springer-Verlag, 1990, pp. 307- 315.
10. Y. Desmedt, Y. Frankel and M. Yung, "Multi-receiverMulti-sender network security: efficient authenticated multicastlfeedback", IEEE Infocom'92. pp. 2045-2054.
11. M. Dyer, T. Fenner, A. Frieze and A. Thomason, "On Key Storage in Secure Networks", J. of Cryptology, Vol. 8, 1995, 189-200.
12. A. Fiat and M. Naor, "Broadcast Encryption", Advances in Cryprology -CRYPTO'92, LNCS vol. 839, 1994, pp. 257-270.
13. Gemmel P., "An introduction to threshold cryptography", in CrypfoByres, Winter 1997, 7-12.
14. R. Gennaro and P. Rohatgi, "How to sign digital streams", Advances in Cryptology - CRYPTO'97, LNCS, vol. 1294, Springer-Verlag. 180-197.
15. L. Gong and N. Schacham, "Elements of Trusted Multicasting, " TR SRICSL- 94-03. Computer Science Laboratory, SRI International, May 1994.
16. Hamey H. and Muckenhim C., "Group Key Management Protocol (GKMP) Architecture", RFC 2094. July 1997.
17. IP Security Protocol (ipsec), IETF working group. URL: http://www.ietf.org/html.charters/ipsec-charter.html.
18. H. Krawczyk, "SKEME: A Versatile Secure Key Exchange Mechanism for Internet", in IEEE I996 Symp. on Network and Dist. Systems Security.
19. H. Krawczyk, M. Bellare and R. Canetti, "HMAC: Keyed-Hashing for Message Authentication", RFC 2104, February 1997.
20. M. Luby, Pseudorandomness and Cryptographic Applications, Princeton University Press. 1996.
21. D. McGrew and A. T. Sherman, "Key Establishment in Large Dynamic Groups Using One-way Function Trees", manuscript, 1998.
22. S. Mittra, "Iolus: A Framework for Scalable Secure Multicasting", Proc. of the ACM SIGCOMM'97, Cannes, France, Sept. 1997.
23. M. Naor and O. Reingold, "From Unpredictability to Indistinguishability: A Simple Construction of Pseudo-Random Functions from MACS", Advances in Cryprology - Crypro'98, LNCS vol. 1462, Springer-Verlag, 1998, pp. 267-282.
24. R. L. Rivest, The MD5 Message Digest Algorithm, RFC 1321, April 1992.
25. R. Safavi-Naini and H. Wang, "New results on Multi-receiver Authentication Code, " Advances in Cryptology - EVROCRYPT'98, LNCS vol. 1403, Springer-Verlag, 1998, pp. 527-541.
26. The Secure Multicast Group of the lnternet Research Task Force, see http://www.ipmulticast.com/community/smug/.
27. M. Steiner. G. Tsudik and M. Waidner, "Diffie-Hellman key distribution extended to group communication", 3rd ACM Conference on Computer and Communications Security", 1996.
28. D.M. Wallner, E.J. Harder and R.C. Agee, "Key Management for Multicast: Issues and Architectures". "draft-wdlner-key-arch-00. txt".
29. C.K. Wong, M. Gouda and S. Lam, "Secure Group Communications Using Key Graphs", Sigcomm'98.
30. C.K. Wong and S. Lam, "Digital Signatures for Flows and Multicasts", The University of Texas at Austin, Department of Computer Sciences, Technical Report TR-98-15.Ju ly 1998. 1998, pp. 267-282.