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
Key Establishment in Large Dynamic Groups Using One-Way Function Trees
IEEE Transactions on Software Engineering
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
Protocol design for scalable and reliable group rekeying
IEEE/ACM Transactions on Networking (TON)
A scalable multicast key management scheme for heterogeneous wireless networks
IEEE/ACM Transactions on Networking (TON)
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
Optimal communication complexity of generic multicast key distribution
IEEE/ACM Transactions on Networking (TON)
A lower bound for multicast key distribution
Computer Networks: The International Journal of Computer and Telecommunications Networking
Efficient communication-storage tradeoffs for multicast encryption
EUROCRYPT'99 Proceedings of the 17th international conference on Theory and application of cryptographic techniques
| Hi-index | 0.00 |
In group communications, an efficient rekeying scheme plays a key role in providing access control when a membership change happens. For reducing the communication cost in the rekeying operation, one proposed model is to rekey upon individual membership change. It is theoretically proved that given the forward secrecy requirement, the optimal amortized communication cost is at least O(log n) (n is the group size) for an Individual Rekeying (IR). Another model is to rekey upon a batch of multiple membership changes: Batch Rekeying (BR), which largely reduces the rekeying communication cost, and relieves implementation difficulties in the IR model (e.g., extremely intensive rekey messages and key arriving disorders in large-size and highly dynamic groups). Unlike IR, however, the communication lower bound in BR is not yet explicitly stated. This paper first extends the communication lower bound for IR to the BR model. Specifically, we prove that given the batch level forward secrecy, the communication costs for updating the whole group subset by subset in a sequence of b batch rekeyings are at least O(b ċ (log2 b - 1)) + O(n). This bound, as a superset, inclusively explains the IR bound as a special case of b = n. Second, for achieving the found bound, we provide a departing-time related key topology that works optimally under the bound. Third, to further implement the proposed optimal topology, we propose two novel BR protocols, one with support of forward secrecies and the other with support of two-way secrecies. Through extensive analyses and simulations, the proposed protocols are shown to achieve notable upgrades in major performance metrics: 60% ∼ 70% reduction in communication overheads, 50% ∼ 60% reduction in key storage overheads, and elimination of key tree unbalance.