Probabilistic optimization techniques for multicast key management

Authors:
Ali Aydin Selçuk;Deepinder Sidhu
Affiliations:
Department of Computer Science, Purdue University, West Lafayette, IN;Department of Computer Science and Electrical Engineering, Maryland Center for Telecommunications Research, University of Maryland Baltimore, MD
Venue:
Computer Networks: The International Journal of Computer and Telecommunications Networking
Year:
2002

Citing 12
Cited 2

Dynamic Huffman coding

Journal of Algorithms
Design and analysis of dynamic Huffman codes

Journal of the ACM (JACM)
Text compression

Text compression
Broadcast encryption

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
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

Efficient broadcast encryption with user profiles

Information Sciences: an International Journal
Adaptive multicast key management for tactical networks

MILCOM'06 Proceedings of the 2006 IEEE conference on Military communications

Quantified Score

Hi-index	0.01

Visualization

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 in 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 amount of variation in the rekey characteristics of the group members.