Abstract
The Logical Key Hierarchy (LKH) scheme and its derivatives are among the most efficient protocols for multicast key management. Traditionally, the key distribution tree in an LKH-based protocol is organized as a balanced binary tree, which gives a uniform O(log n) complexity for compromise recovery for an n-member group. In this paper, we study improving the performance of LKH-based key distribution protocols by organizing the LKH tree with respect to the members’ rekeying probabilities instead of keeping a uniform balanced tree. We propose two algorithms which combine ideas from data compression with the special requirements of multicast key management. Simulation results show that these algorithms can reduce the cost of multicast key management significantly, depending on the variation of rekey characteristics among group members.
This research was supported in part by the Department of Defense at the Maryland Center for Telecommunications Research, University of Maryland Baltimore County. The views and conclusions contained in this document are those of the authors and should not be interpreted as representing the official policies, either expressed or implied, of the Department of Defense or the U.S. Government
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
K. Almeroth and M. Ammar. Collection and modeling of the join/leave behavior of multicast group members in the mbone. In High Performance Distributed Computing Focus Workshop (HPDC’96), August 1996.
K. Almeroth and M. Ammar. Multicast group behavior in the internet’s multicast backbone (mbone). IEEE Communications, 35(6), June 1997.
A. Ballardie. Scalable multicast key distribution, May 1996. Internet RFC 1949.
T. C. Bell, J. G. Cleary, and I. H. Witten. Text Compression. Prentice-Hall, 1990.
M. Burmester and Y. Desmedt. A secure and efficient conference key distribution system. In Alfredo De Santis, editor, Advances in Cryptology-Eurocrypt’94, pages 275–286. Springer-Verlag, 1994.
R. Canetti, J. Garay, G. Itkis, D. Micciancio, M. Naor, and B. Pinkas. Multicast security: A taxonomy and some efficient constructions. In Infocomm’99 Conference, 1999.
A. Fiat and M. Naor. Broadcast encryption. In Douglas R. Stinson, editor, Advances in Cryptology-CRYPTO’ 93, pages 480–491. Springer-Verlag, 1993.
T. Hardjono, B. Cain, and N. Doraswamy. A framework for group key management for multicast security, February 2000. Internet draft (work in progress).
H. Harney, C. Muckenhirn, and T. Rivers. Group key management protocol specification, July 1997. Internet RFC 2093.
D. E. Knuth. Dynamic Huffman coding. Journal of Algorithms, 6:163–180, 1985.
A. M. Law and W. D. Kelton. Simulation Modeling and Analysis. McGraw-Hill, 3rd edition, 2000.
M. Luby and J. Staddon. Combinatorial bounds for broadcast encryption. In Advances in Cryptology-EUROCRYPT’ 93. Springer-Verlag, 1998.
D. A. McGrew and A. T. Sherman. Key establishment in large dynamic groups using one-way function trees. Technical Report 0755, TIS Labs, May 1998. A revised version to appear in the IEEE Transactions on Software Engineering.
S. Mittra. Iolus: A framework for scalable secure multicasting. In Proceedings of the ACM SIGCOMM’97 Conference, September 1997.
R. Poovendran and J. S. Baras. An information theoretic analysis of rooted-tree based secure multicast key distribution schemes. In Advances in Cryptology-Crypto’99. Springer-Verlag, 1999.
S. Saeednia and R. Safavi-Naini. Efficient identity-based conference key distribution protocols. In Proceedings of Information Security and Privacy Conference, ACISP’98. Springer-Verlag, 1998.
M. Steiner, G. Tsudik, and M. Waidner. CLIQUES: A new approach to group key agreement. In International Conference on Distributed Computing Systems, pages 380–387. IEEE Computer Society, 1998.
D. Wallner, E. Harder, and R. Agee. Key management for multicast: Issues and architectures, July 1997. Internet draft (work in progress).
C. K. Wong, M. Gouda, and S. S. Lam. Secure group communication using key graphs. In Proceedings of the ACM SIGCOMM’98 Conference, September 1998.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Aydin Selçuk, A., Sidhu, D. (2000). Probabilistic Methods in Multicast Key Management. In: Goos, G., Hartmanis, J., van Leeuwen, J., Pieprzyk, J., Seberry, J., Okamoto, E. (eds) Information Security. ISW 2000. Lecture Notes in Computer Science, vol 1975. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44456-4_14
Download citation
DOI: https://doi.org/10.1007/3-540-44456-4_14
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-41416-2
Online ISBN: 978-3-540-44456-5
eBook Packages: Springer Book Archive