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
IEEE/ACM Transactions on Networking (TON)
Batch rekeying for secure group communications
Proceedings of the 10th international conference on World Wide Web
Multicasting on the Internet and Its Applications
Multicasting on the Internet and Its Applications
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
Balanced Batch LKH: New Proposal, Implementation and Performance Evaluation.
ISCC '03 Proceedings of the Eighth IEEE International Symposium on Computers and Communications
Kronos: A Scalable Group Re-Keying Approach for Secure Multicast
SP '00 Proceedings of the 2000 IEEE Symposium on Security and Privacy
A survey of key management for secure group communication
ACM Computing Surveys (CSUR)
Network-Aware Security for Group Communications
Network-Aware Security for Group Communications
JET: dynamic join-exit-tree amortization and scheduling for contributory key management
IEEE/ACM Transactions on Networking (TON)
Dynamic Balanced Key Tree Management for Secure Multicast Communications
IEEE Transactions on Computers
| Hi-index | 0.00 |
To achieve both access control and service availability, many researchers have attempted to design an efficient key management system for secure multicast services. Periodic and batch rekeying (PBR) is well known for its significant improvement in rekeying efficiency for large-scale and highly dynamic groups at the cost of relaxing some forward secrecy. However, PBR is uncontrollably vulnerable in its worst case when departing users are uniformly distributed in the leaf level of the key tree. Given a lack of users' departure information, the system cannot efficiently plan for their accommodations in the key tree. We observe that in many applications, e.g. charge-by-duration services, users' departure information is accessible to the system when it joins the group. In this paper, we exploit the value of this information, and propose a novel time-based key management scheme called "departure-aware key tree structure" (DAKS). We employ a tree-star combined topology to schedule the key updates in DAKS. Using knowledge of departing times, our scheme can achieve high efficiency for batch rekeying. Specifically, we show through analyses and simulation that by applying our scheme, rekeying efficiency can be improved by approximately 50%-60% with less key storage overhead and no other side effects.