ACM SIGCOMM Computer Communication Review
CRYPTO '93 Proceedings of the 13th annual international cryptology conference on Advances in cryptology
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
Some New Results on Key Distribution Patterns and BroadcastEncryption
Designs, Codes and Cryptography
KHIP—a scalable protocol for secure multicast routing
Proceedings of the 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
Efficient Security for Large and Dynamic Multicast Groups
WETICE '98 Proceedings of the 7th Workshop on Enabling Technologies: Infrastructure for Collaborative Enterprises
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
A Secure Group Key Management Communication Lower Bound
A Secure Group Key Management Communication Lower Bound
Key bundles and parcels: secure communication in many groups
Computer Networks: The International Journal of Computer and Telecommunications Networking
MICROCAST: smart card based (micro)pay-per-view for multicast services
CARDIS'02 Proceedings of the 5th conference on Smart Card Research and Advanced Application Conference - Volume 5
Optimal communication complexity of generic multicast key distribution
IEEE/ACM Transactions on Networking (TON)
Optimizing the batch mode of group rekeying: lower bound and new protocols
INFOCOM'10 Proceedings of the 29th conference on Information communications
Optimal tree structure with loyal users and batch updates
Journal of Combinatorial Optimization
| Hi-index | 0.00 |
With the rapidly growing importance of multicast in the Internet, several schemes for scalable key distribution have been proposed. These schemes require the broadcast of @Q(logn) encrypted messages to update the group key when the nth user joins or leaves the group. In this paper, we establish a matching lower bound (Independently, and concurrently, Richard Yang and Simon Lam discovered a similar bound with slightly different properties and proofs. An earlier version of our paper appeared in Infocom 2001 while their result appears in [R. Yang, S. Lam, A secure group key management communication lower bound, Technical Report TR-00-24, Department of Computer Sciences, UT Austin, July 2000, revised September 2000].), thus showing that @Q(logn) encrypted messages are necessary for a general class of key distribution schemes and under different assumptions on user capabilities. While key distribution schemes can exercise some tradeoff between the costs of adding or deleting a user, our main result shows that for any scheme there is a sequence of 2n insertion and deletions whose total cost is @W(nlogn). Thus, any key distribution scheme has a worst-case cost of @W(logn) either for adding or for deleting a user.