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
Key Establishment in Large Dynamic Groups Using One-Way Function Trees
IEEE Transactions on Software Engineering
Balanced Batch LKH: New Proposal, Implementation and Performance Evaluation.
ISCC '03 Proceedings of the Eighth IEEE International Symposium on Computers and Communications
Kronos: A Scalable Group Re-Keying Approach for Secure Multicast
SP '00 Proceedings of the 2000 IEEE Symposium on Security and Privacy
A survey of key management for secure group communication
ACM Computing Surveys (CSUR)
Protocol design for scalable and reliable group rekeying
IEEE/ACM Transactions on Networking (TON)
Efficient Group Key Management Protocol with One-Way Key Derivation
LCN '05 Proceedings of the The IEEE Conference on Local Computer Networks 30th Anniversary
Dynamic Balanced Key Tree Management for Secure Multicast Communications
IEEE Transactions on Computers
Efficient group key management for multi-privileged groups
Computer Communications
Hierarchical group access control for secure multicast communications
IEEE/ACM Transactions on Networking (TON)
Key management for secure multicast using the ringnet hierarchy
CIS'04 Proceedings of the First international conference on Computational and Information Science
Distributed hierarchical access control for secure group communications
ICCNMC'05 Proceedings of the Third international conference on Networking and Mobile Computing
Scalable secure group communication over IP multicast
IEEE Journal on Selected Areas in Communications
| Hi-index | 0.00 |
Many internet applications are based on group communication model. For secure group communication scenario, key management is an important issue. In a hierarchical architecture, key trees are used. When users join or leave a key tree, all the ancestor nodes in the leave path till root gets affected. It encroaches threat to forward secrecy as well as backward secrecy. This poses a need for rekeying whenever users join or leave. Periodic batch rekeying is a process where the key server waits until the rekey interval is elapsed and does the rekeying process. Nevertheless, there are many key management schemes; there is still research fostering in key management in group communication for multi-privileged users, where the users of the group have access to multiple resources, unlike the traditional case with single resource. This paper addresses batch user join or leave case in multi-privileged environment. A variation of batch rekeying is introduced by using min(N, T) policy so that the users need not wait until the rekey interval is reached and the probabilistic analysis based on it are provided. It also discusses about the improvement in terms of number of rekeying done and provides a balanced tree when multiple users join/leave. Copyright © 2011 John Wiley & Sons, Ltd.