Journal of Algorithms
Text compression
CRYPTO '93 Proceedings of the 13th annual international cryptology conference on Advances in cryptology
Iolus: a framework for scalable secure multicasting
SIGCOMM '97 Proceedings of the ACM SIGCOMM '97 conference on Applications, technologies, architectures, and protocols for computer communication
Secure group communications using key graphs
Proceedings of the ACM SIGCOMM '98 conference on Applications, technologies, architectures, and protocols for computer communication
Simulation Modeling and Analysis
Simulation Modeling and Analysis
Efficient Identity-Based Conference Key Distribution Protocols
ACISP '98 Proceedings of the Third Australasian Conference on Information Security and Privacy
An Information Theoretic Analysis of Rooted-Tree Based Secure Multicast Key Distribution Schemes
CRYPTO '99 Proceedings of the 19th Annual International Cryptology Conference on Advances in Cryptology
Key Establishment in Large Dynamic Groups Using One-Way Function Trees
IEEE Transactions on Software Engineering
Collecting and Modeling the Join/Leave Behavior of Multicast Group Members in the MBone
HPDC '96 Proceedings of the 5th IEEE International Symposium on High Performance Distributed Computing
CLIQUES: A New Approach to Group Key Agreement
ICDCS '98 Proceedings of the The 18th International Conference on Distributed Computing Systems
Multicast group behavior in the Internet's multicast backbone (MBone)
IEEE Communications Magazine
| Hi-index | 0.00 |
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.