Abstract
Multicast communication is the main mode of communication for a wide range of Internet services such as video broadcasting and multi-party teleconferencing where there are multiple recipients. A secure multicast system allows a group initiator (or a centre) to send message over a multicast channel to a dynamically changing group of users. The main challenge in secure multicasting is efficient group key management. We propose new schemes for user revocation that can be used to establish a common key among subgroups of users. The schemes can be used with static or dynamic group initiator and allow temporary and permanent revocation of users. We also give a method of adding authentication to the proposed schemes. We prove security and compare efficiency of the new schemes.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
J. Anzai, N. Matsuzaki and T. Matsumoto. A Quick Group Key Distribution Scheme with “Entity Revocation”. Advances in Cryptology-ASIACRYPT’ 99, Lecture Notes in Computer Science 1716, pages 333–347, 1999.
C. Blundo, A. De Santis, A. Herzberg, S. Kutten, U. Vaccaro and M. Yung. Perfectly Secure Key Distribution for Dynamic Conferences. Advances in Cryptology-CRYPTO’92, Lecture Notes in Computer Science 740, pages 471–486, 1993.
M. Burmester and Y. Desmedt. A Secure and Efficient Conference Key Distribution System. Advances in Cryptology-EUROCRYPT’ 94, Lecture Notes in Computer Science 950, pages 275–286, 1995.
R. Canetti, J. Garay, G. Itkis, D. Micciancio, M. Naor and B. Pinkas. Issues in Multicast Security: A Taxonomy and Efficient Constructions. Proceedings of INFOCOM’ 99, pages 708–716, 1999.
R. Canetti, T. Malkin and K. Nissim. Efficient Communication-Storage Tradeoffs for Multicast Encryption. Advances in Cryptology-EUROCRYPT’ 99, Lecture Notes in Computer Science 1592, pages 459–474, 1999.
I. Chang, R. Engel, D. Kandlur, D. Pendarakis and D. Saha. Key Management for Secure Internet Multicast Using Boolean Function minimisation Techniques. Proceedings of INFOCOM’ 99, pages 689–698, 1999.
W. Diffie and M. Hellman. New Directions in Cryptography. IEEE Trans. Inform. Theory 22, pages 644–654, 1976.
A. Fiat and M. Naor. Broadcast Encryption. Advances in Cryptology-CRYPTO’ 93, Lecture Notes in Computer Science 773, pages 480–491, 1994.
O. Goldreich, S. Goldwasser and S. Micali. How to Construct Random Functions. JACM, Vol. 33, No. 4, pages 792–807, 1986.
Y. Kim, A. Perrig and G. Tsudik. Simple and Fault-Tolerance Key Agreement for Dynamic Collaborative Groups. Proceedings of CCS’ 00, pages 235–244, 2000.
P. S. Kruus. A Survey of Multicast Security Issues and Architectures. 21st National Information Systems Security Conferences, 1998.
P. S. Kruus and J. P. Macker. Techniques and Issues in Multicast Security. MILCOM’ 98, 1998.
R. Kumar, S. Rajagopalan and A. Sahai. Coding Constructions for Blacklisting Problems Without Computational Assumptions. Advances in Cryptology-CRYPTO’ 99, Lecture Notes in Computer Science 1666, pages 609–623, 1999.
H. Kurnio, R. Safavi-Naini, W. Susilo and H. Wang. Key Management for Secure Multicast with Dynamic Controller. Information Security and Privacy-ACISP 2000, Lecture Notes in Computer Science 1841, pages 178–190, 2000.
D. A. McGrew and A. T. Sherman. Key Establishment in Large Dynamic Groups Using One-Way Function Trees. Manuscript, 1998.
K. Nyberg, R.A. Rueppel. Message Recovery for Signature Schemes Based on the Discrete Logarithm Problem. Advances in Cryptology-EUROCRYPT’ 94, Lecture Notes in Computer Science 950, pages 182–193, 1995.
R. Safavi-Naini and H. Wang. New Constructions of secure multicast re-keying schemes using perfect hash families. 7th ACM Conference on Computer and Communication Security, ACM Press, 2000, 228–234.
A. Shamir. How to Share a Secret. Communications of the ACM 22, pages 612–613, 1979.
D. R. Stinson. On Some Methods for Unconditionally Secure Key Distribution and Broadcast Encryption. Designs, Codes and Cryptography 12, pages 215–243, 1997.
D. M. Wallner, E. J. Harder and R. C. Agee. Key Management for Multicast: Issues and Architectures. Internet Draft (draft-wallner-key-arch-01.txt), http://ftp://ftp.ietf.org/internet-drafts/draft-wallner-key-arch-01.txt.
C. K. Wong, M. Gouda and S. S. Lam. Secure Group Communication Using Key Graphs. Proceedings of SIGCOMM’ 98, pages 68–79, 1998.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kurnio, H., Safavi-Naini, R., Wang, H. (2002). Efficient Revocation Schemes for Secure Multicast. In: Kim, K. (eds) Information Security and Cryptology — ICISC 2001. ICISC 2001. Lecture Notes in Computer Science, vol 2288. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45861-1_13
Download citation
DOI: https://doi.org/10.1007/3-540-45861-1_13
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-43319-4
Online ISBN: 978-3-540-45861-6
eBook Packages: Springer Book Archive