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
Reliable group rekeying: a performance analysis
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
Mobile IP; Design Principles and Practices
Mobile IP; Design Principles and Practices
Deployment issues for the IP multicast service and architecture
IEEE Network: The Magazine of Global Internetworking
Secure multicast groups on ad hoc networks
Proceedings of the 1st ACM workshop on Security of ad hoc and sensor networks
Performance optimization of region-based group key management in mobile ad hoc networks
Performance Evaluation
Wireless networking security: open issues in trust, management, interoperation and measurement
International Journal of Security and Networks
International Journal of Ad Hoc and Ubiquitous Computing
Scalable key management for secure multicast communication in the mobile environment
Pervasive and Mobile Computing
Key management with host mobility in dynamic groups
Proceedings of the 3rd international conference on Security of information and networks
On design tradeoffs between security and performance in wireless group communicating systems
NPSEC'05 Proceedings of the First international conference on Secure network protocols
ICCNMC'05 Proceedings of the Third international conference on Networking and Mobile Computing
| Hi-index | 0.00 |
Many emerging mobile wireless applications depend upon secure group communications, in which data is encrypted and the group's data encryption key is changed whenever a member joins or leaves the group's session. Hierarchical approaches have recently been proposed to manage the distribution of the data encryption key in a scalable manner for fixed (non-mobile) networks. In this paper, we characterize the impact of mobility on secure rekeying of group communication in a hierarchical key-distribution framework. We propose several rekeying algorithms that preserve confidentiality as members move within the hierarchy. The algorithms differ in the locality of communication, the amount of messages needed to rekey the data key/key-encryption key, the key-encryption key rekey rate, and the number of key-encryption keys held by group members. We develop Markov models to quantify the performance of the proposed algorithms. Our results shows that the FEDRP and SR inter-area rekeying algorithms are superior under different circumstances. In the situation of lower arrival rate and higher mobility, SR has the lowest intra-AS message rate, rekey rate and a low inter-AS message rate. On the other hand, with higher arrival rate and lower mobility, FEDRP has a low rekey rate, inter-AS message rate and the lowest intra-AS message rate. This is achieved by allowing members to hold a small number of keys. In a wireless environment, where bandwidth is often a limiting resource, minimization of communication overhead is of critical importance. This goal could be achieved by using a dynamic strategy to combine the benefits of FEDRP and SR algorithms.