Applied cryptography (2nd ed.): protocols, algorithms, and source code in C
Applied cryptography (2nd ed.): protocols, algorithms, and source code in C
ELK, a New Protocol for Efficient Large-Group Key Distribution
SP '01 Proceedings of the 2001 IEEE Symposium on Security and Privacy
The VersaKey framework: versatile group key management
IEEE Journal on Selected Areas in Communications
Efficient and secure keys management for wireless mobile communications
Proceedings of the second ACM international workshop on Principles of mobile computing
A survey of key management for secure group communication
ACM Computing Surveys (CSUR)
A group key recovery mechanism based on logical key hierarchy
Journal of Computer Security
A new approach to scalable and fault-tolerant group key management protocols
Journal of High Speed Networks
Clique-based group key assignment in Wireless Sensor Networks
International Journal of Security and Networks
Efficient multicast key management for stateless receivers
ICISC'02 Proceedings of the 5th international conference on Information security and cryptology
Hierarchies of keys in secure multicast communications
Journal of Computer Security
Adaptive multicast key management for tactical networks
MILCOM'06 Proceedings of the 2006 IEEE conference on Military communications
| Hi-index | 0.00 |
Several protocols have been proposed to deal with the group key management problem. The most promising are those based on hierarchical binary trees. A hierarchical binary tree of keys reduces the size of the rekey messages, reducing also the storage and processing requirements. In this paper, we describe a new efficient hierarchical binary tree (EHBT) protocol. Using EHBT, a group manager can use keys already in the tree to derive newk eys. Using previously known keys saves information to be transmitted to members when a membership change occurs and newk eys have to be created or updated. EHBT can achieve (I 驴 log2 n) message size (I is the size of a key index) for join operations and (K驴log2 n) message size (K is the size of a key) for leave operations. We also showt hat the EHBT protocol does not increase the storage and processing requirements when compared to other HBT schemes.