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
Multicast security and its extension to a mobile environment
Wireless Networks
Secure group communications using key graphs
IEEE/ACM Transactions on Networking (TON)
Key Agreement in Dynamic Peer Groups
IEEE Transactions on Parallel and Distributed Systems
Batch rekeying for secure group communications
Proceedings of the 10th international conference on World Wide Web
Reliable group rekeying: a performance analysis
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
ACM Transactions on Information and System Security (TISSEC)
Distributed Collaborative Key Agreement Protocols for Dynamic Peer Groups
ICNP '02 Proceedings of the 10th IEEE International Conference on Network Protocols
Reducing the Cost of the Critical Path in Secure Multicast for Dynamic Groups
ICDCSW '02 Proceedings of the 22nd International Conference on Distributed Computing Systems
Key Trees and the Security of Interval Multicast
ICDCS '02 Proceedings of the 22 nd International Conference on Distributed Computing Systems (ICDCS'02)
Kronos: A Scalable Group Re-Keying Approach for Secure Multicast
SP '00 Proceedings of the 2000 IEEE Symposium on Security and Privacy
Key bundles and parcels: secure communication in many groups
Computer Networks: The International Journal of Computer and Telecommunications Networking
A lower bound for multicast key distribution
Computer Networks: The International Journal of Computer and Telecommunications Networking
Enclaves: enabling secure collaboration over the Internet
IEEE Journal on Selected Areas in Communications
The VersaKey framework: versatile group key management
IEEE Journal on Selected Areas in Communications
Key bundles and parcels: secure communication in many groups
Computer Networks: The International Journal of Computer and Telecommunications Networking
Performance optimization of region-based group key management in mobile ad hoc networks
Performance Evaluation
| Hi-index | 0.00 |
We consider a system where each user is in one or more elementary groups. In this system, arbitrary groups of users can be specified using the operations of union, intersection, and complement over the elementary groups in the system. Each elementary group in the system is provided with a security key that is known only to the users in the elementary group and to the system server. Thus, for any user u to sccurely multicast a data item d to every user in an arbitrary group G, u first forwards d to the system server which encrypts it using the keys of the elementary groups that comprise G before multicasting the encrypted d to every user in G. Every elementary group is also provided with a key tree to ensure that the cost of changing the key of the elementary group, when a user leaves the group, is small. In [E. Jung, A.X. Liu, M.G. Gouda, Key bundles and parcels: secure communication in many groups, in: LNCS 2816, Group Communications and Charges, 2003], we introduced two methods for packing the key trees of elementary groups into key bundles and into key parcels. We also showed that packing into key bundles has the advantage of reducing the number of encryptions needed to multicast a data item to the complement of an elementary group, while packing into key parcels has the advantage of reducing the total number of keys in the system. In this paper, we present more details of key bundles and parcels: the algorithms that construct key bundles and parcels, and more simulation results comparing key bundles and parcels. We also discuss how to reconfigure key bundles and parcels when the user joins or leaves different elementary groups and how to balance the load among multiple servers.