How to construct random functions
Journal of the ACM (JACM)
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
On the topology of multicast trees
IEEE/ACM Transactions on Networking (TON)
CRYPTO '93 Proceedings of the 13th Annual International Cryptology Conference on Advances in Cryptology
Efficient State Updates for Key Management
DRM '01 Revised Papers from the ACM CCS-8 Workshop on Security and Privacy in Digital Rights Management
MARKS: Zero Side Effect Multicast Key Management Using Arbitrarily Revealed Key Sequences
NGC '99 Proceedings of the First International COST264 Workshop on Networked Group Communication
EHBT: An Efficient Protocol for Group Key Management
NGC '01 Proceedings of the Third International COST264 Workshop on Networked Group Communication
ELK, a New Protocol for Efficient Large-Group Key Distribution
SP '01 Proceedings of the 2001 IEEE Symposium on Security and Privacy
Zerber: r-confidential indexing for distributed documents
EDBT '08 Proceedings of the 11th international conference on Extending database technology: Advances in database technology
Privacy preserving document indexing infrastructure for a distributed environment
Proceedings of the VLDB Endowment
An Efficient and Secure Self-Healing Scheme for LKH
Journal of Network and Systems Management
| Hi-index | 0.00 |
Secret group communication can be achieved by encryption messages with a group key. Dynamic groups face the problem of changing the group key whenever members join or leave. One of the solutions to this problem is to send updated group keys to members via rekey messages in a secure manner. The recovery of lost group keys consequently becomes important because a member cannot decrypt the group data if she loses the rekey messages. Also, any rekey messages lost while a member is logged off cannot be recovered in real-time. Saving recent rekey messages and resending them by the key distribution center not only requires large storage space, but also can cause unnecessary transmission and decryption of keys. Furthermore, the keys in the unsaved rekey messages cannot be recovered. This paper analyzes the problem of rekey message loss and proposes an efficient scheme for recovering group keys based on a logical key hierarchy. The group key generation method used in the scheme make it possible to recover group keys without transmission and decryption of useless keys.