Performance and reliability analysis of computer systems: an example-based approach using the SHARPE software package
Secure group communications using key graphs
IEEE/ACM Transactions on Networking (TON)
Key Agreement in Dynamic Peer Groups
IEEE Transactions on Parallel and Distributed Systems
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
Efficient and secure keys management for wireless mobile communications
Proceedings of the second ACM international workshop on Principles of mobile computing
Performance Optimizations for Group Key Management Schemes
ICDCS '03 Proceedings of the 23rd International Conference on Distributed Computing Systems
Secure Broadcast Communication in Wired and Wireless Networks
Secure Broadcast Communication in Wired and Wireless Networks
Kronos: A Scalable Group Re-Keying Approach for Secure Multicast
SP '00 Proceedings of the 2000 IEEE Symposium on Security and Privacy
Efficient Secure Multicast with Well-Populated Multicast Key Trees
ICPADS '04 Proceedings of the Parallel and Distributed Systems, Tenth International Conference
Last hop topology sensitive multicasting key managment
Proceedings of the 1st ACM international workshop on Quality of service & security in wireless and mobile networks
Location-Aware Combinatorial Key Management Scheme for Clustered Sensor Networks
IEEE Transactions on Parallel and Distributed Systems
DAKS: an efficient batch rekeying scheme for departure-aware multicast services
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
An efficient and scalable EBS-based batch rekeying scheme for secure group communications
MILCOM'09 Proceedings of the 28th IEEE conference on Military communications
Secure group re-keying using key inverses
Journal of High Speed Networks
| Hi-index | 0.00 |
Advances in wireless communications and mobile computing have led to the emergence of group communications and applications over wireless. In many of these group interactions, new members can join and current members can leave at any time, and existing members must communicate securely to achieve application-specific missions or network-specific functionality. Since wireless networks are resource-constrained, a key challenge is to provide secure and efficient group communication mechanisms that satisfy application requirements while minimizing the communication cost. Instead of individual rekeying, i.e., performing a rekey operation right after each join or leave request, periodic batch rekeying has been proposed to alleviate rekeying overhead in resource-constrained wireless networks. In this paper, we propose an analytical model to address the issue of how often batch rekeying should be performed. We propose threshold-based batch rekeying schemes and demonstrate that an optimal rekey interval exists for each scheme. We further compare these schemes to identify the best scheme that can minimize the communication cost of rekeying while satisfying application requirements when given a set of parameter values characterizing the operational and environmental conditions of the system. In a highly dynamic wireless environment in which the system parameter values change at runtime, our work may be used to adapt the rekeying interval accordingly.