Secure group communications using key graphs
Proceedings of the ACM SIGCOMM '98 conference on Applications, technologies, architectures, and protocols for computer communication
Reliable group rekeying: a performance analysis
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
Revocation and Tracing Schemes for Stateless Receivers
CRYPTO '01 Proceedings of the 21st Annual International Cryptology Conference on Advances in Cryptology
Layered Multicast Group Construction for Reliable Multicast Communications
NGC '99 Proceedings of the First International COST264 Workshop on Networked Group Communication
Scalable Secure Group Communication over IP Multicast
ICNP '01 Proceedings of the Ninth International Conference on Network Protocols
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
Multicast group behavior in the Internet's multicast backbone (MBone)
IEEE Communications Magazine
A comparison of sender-initiated and receiver-initiated reliable multicast protocols
IEEE Journal on Selected Areas in Communications
Algorithms for dynamic multicast key distribution
Journal of Experimental Algorithmics (JEA)
JET: dynamic join-exit-tree amortization and scheduling for contributory key management
IEEE/ACM Transactions on Networking (TON)
On replacing cryptographic keys in hierarchical key management systems
Journal of Computer Security - The Third IEEE International Symposium on Security in Networks and Distributed Systems
Mykil: a secure and highly available key management system for large group multicast
International Journal of Computers and Applications
Scalable group key management with partially trusted controllers
ICN'05 Proceedings of the 4th international conference on Networking - Volume Part II
| Hi-index | 0.00 |
Recently, many group key management approachesbased on the use of logical key trees have been proposed toaddress the issue of scalable group rekeying that is neededto support secure communications for large and dynamicgroups. In this paper, we present two optimizations for logicalkey tree organizations that utilize information aboutthe characteristics of group members to further reduce theoverhead of group rekeying. First, we propose a partitionedkey tree organization that exploits the temporal patterns ofgroup member joins and departures to reduce the overheadof rekeying. Using an analytic model, we show that our optimizationcan achieve up to 31.4% reduction in key serverbandwidth overhead over the unoptimized scheme. Second,we propose an approach under which the key tree is organizedbased on the loss probabilities of group members.Our analysis shows this optimization can reduce the rekeyingoverhead by up to 12.1%.