Abstract
Many of today’s distributed applications are based on group communication. Given the openness of today’s networks, communication among group members must be secure and, at the same time, efficient. In this paper we consider a realistic distributed setting modeling general networks, including the Internet, that suggests the use of Kerberos, and, more specifically, a distributed mode of operation of Kerberos, called crossrealm authentication protocol, as a desirable choice for distributed applications.
We design an efficient protocol for secure group communication via multicast, using Kerberos. While developing the main components of our protocol, we construct an efficient paradigm for crossreal mauthen tication protocols that decreases communication over the Internet, makes most operations local, and reduces the workload of the involved components. We also design extensions of single-center multicast encryption schemes to multiple-center schemes. Our main protocol is obtained by combining these two contributions.
Copyright 2001, Telcordia Technologies, Inc. All Rights Reserved.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
K. Becker and U. Wille. Communication complexity of group key distribution. In Proceedings ofthe 5th ACM Conference on Computer and Communication Security, pages 1–6, San Francisco, CA, November 1998.
R. Canetti, J. Garay, G. Itkis, D. Miccianco, M. Naor, and B. Pinkas. Multicast security: A taxonomy and efficient authentication. In IEEE INFOCOMM, 1999.
R. Canetti, T. Malkin, and K. Nissim. Efficient communication storage tradeoffs for multicast encryption. In Proceedings of “A dvances in Cryptology-EUROCRYPT’ 99”, Lecture Notes in Computer Science, Springer Verlag, 1999.
W. Diffie and M. Hellman. New directions in cryptography. IEEE Transaction on Information Theory, 22:644–654, November 1976.
M. Hur, B. Tung, T. Ryutov, C. Neuman, A. Medvinsky, G. Tsudik, and B. Sommerfeld. Public key cryptography for cross-realm authentication in kerberos, May 2001. Internet draft.
Y. Kim, A. Perrig, and G. Tsudik. Simple and fault-tolerant key agreement for dynamic collaborative groups. In Proceedings ofthe 7th ACM Conference on Computer and Communication Security, CCS’00, pages 235–244, November 2000.
F. MacWilliams and N. Sloane. The theory oferr or-correcting codes. Elsevier Science, 1977.
R. Needham and M. Shroeder. Using encryption for authentication in large networks of computers. Communications ofthe ACM, 21(12):993–999, December 1978.
C. Neuman and T. Ts’o. Kerberos: an authentication service for computer networks. IEEE Communications, 32(9):33–38, September 1994.
A. Perrig. Efficient collaborative key management protocols for secure autonomous group communication. In CryptTEC, 1999.
M. Steiner, G. Tsudik, and M. Waidner. Diffie-hellman key distribution extended to groups. In Proceedings ofthe 3rd ACM Conference on Computer and Communications in Security, CCS’96, pages 31–37, March 1996.
D. Wallner, E. Harder, and R. Agee. Key management for multicast: Issues and architectures, June 1999. RFC 2627.
C. Wong, M. Gouda, and S. Lam. Secure group communication using key graphs. In Proceedings ofthe ACM SIGCOMM’98, pages 68–79, September 1998.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Di Crescenzo, G., Kornievskaia, O. (2001). Efficient Kerberized Multicast in a Practical Distributed Setting. In: Davida, G.I., Frankel, Y. (eds) Information Security. ISC 2001. Lecture Notes in Computer Science, vol 2200. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45439-X_3
Download citation
DOI: https://doi.org/10.1007/3-540-45439-X_3
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42662-2
Online ISBN: 978-3-540-45439-7
eBook Packages: Springer Book Archive