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
An Information Theoretic Analysis of Rooted-Tree Based Secure Multicast Key Distribution Schemes
CRYPTO '99 Proceedings of the 19th Annual International Cryptology Conference on Advances in Cryptology
Efficient communication-storage tradeoffs for multicast encryption
EUROCRYPT'99 Proceedings of the 17th international conference on Theory and application of cryptographic techniques
Optimizing deletion cost for secure multicast key management
Theoretical Computer Science
Optimal Tree Structures for Group Key Tree Management Considering Insertion and Deletion Cost
COCOON '08 Proceedings of the 14th annual international conference on Computing and Combinatorics
Approximately optimal trees for group key management with batch updates
Theoretical Computer Science
Optimal tree structures for group key tree management considering insertion and deletion cost
Theoretical Computer Science
Key-update distribution in secure group communication
Computer Communications
Approximately optimal trees for group key management with batch updates
TAMC'07 Proceedings of the 4th international conference on Theory and applications of models of computation
Secure group communication with self-healing and rekeying in wireless sensor networks
MSN'07 Proceedings of the 3rd international conference on Mobile ad-hoc and sensor networks
Adaptive multicast key management for tactical networks
MILCOM'06 Proceedings of the 2006 IEEE conference on Military communications
Optimal tree structure with loyal users and batch updates
Journal of Combinatorial Optimization
Optimal key tree structure for two-user replacement and deletion problems
Journal of Combinatorial Optimization
| Hi-index | 0.00 |
As applications of secure multicast in networks continue to grow, the demand for an efficient scheme to manage group keys for secure group communication becomes more urgent. In this paper, we propose a new key tree structure for group key management. With this optimal tree structure, system resources such as network bandwidth can be saved. We devise an algorithm to generate this optimal tree and show that it can be implemented efficiently. We also design an adaptive system for group key management which consists of four components: a request receiver, a key tree update controller, a delay calculator and a request predictor. This system can maintain the optimality of the key tree dynamically. It is verified by theoretical analysis and simulation result that the performance of our scheme is better than other schemes based on traditional tree structures.