Multicast routing in internetworks and extended LANs
SIGCOMM '88 Symposium proceedings on Communications architectures and protocols
SIGCOMM '93 Conference proceedings on Communications architectures, protocols and applications
Communications of the ACM
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)
Scalable multicast security with dynamic recipient groups
ACM Transactions on Information and System Security (TISSEC)
A secure multicast protocol for the internet's multicast backbone
International Journal of Network Management
Batch rekeying for secure group communications
Proceedings of the 10th international conference on World Wide Web
Secure and Scalable Inter-Domain Group Key Management for N-to-N Multicast
ICPADS '98 Proceedings of the 1998 International Conference on Parallel and Distributed Systems
A Dual Encryption Protocol for Scalable Secure Multicasting
ISCC '99 Proceedings of the The Fourth IEEE 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
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
A survey of security issues in multicast communications
IEEE Network: The Magazine of Global Internetworking
A dynamic key management solution to access hierarchy
International Journal of Network Management
A tree-covering problem arising in integrity of tree-structured data
Information Processing Letters
A key management scheme for secure group communication using binomial key trees
International Journal of Network Management
An enhanced one way function tree rekey protocol based on chinese remainder theorem
ISCIS'05 Proceedings of the 20th international conference on Computer and Information Sciences
| Hi-index | 0.00 |
Securing group communications in dynamic and large-scale groups is more complex than securing one-to-one communications due to the inherent scalability issue of group key management. In particular, cost for key establishment and key renewing is usually relevant to the group size and subsequently becomes a performance bottleneck in achieving scalability. To address this problem, this paper proposes a new approach that features decoupling of group size and computation cost for group key management. By using a hierarchical key distribution architecture and load sharing, the load of key management can be shared by a cluster of third parties without revealing group messages to them. The proposed scheme provides better scalability because the cost for key management of each component is independent of the group size. Specifically, our scheme incurs constant computation and communication overheads for key renewing. In this paper, we present the detailed design of the proposed scheme and performance comparisons with other schemes. Briefly, our scheme provides better scalability than existing group key distribution approaches.