Secure group communications using key graphs
Proceedings of the ACM SIGCOMM '98 conference on Applications, technologies, architectures, and protocols for computer communication
Constructing minimum-energy broadcast trees in wireless ad hoc networks
Proceedings of the 3rd ACM international symposium on Mobile ad hoc networking & computing
Minimum-energy broadcast in all-wireless networks: NP-completeness and distribution issues
Proceedings of the 8th annual international conference on Mobile computing and networking
Efficient and secure keys management for wireless mobile communications
Proceedings of the second ACM international workshop on Principles of mobile computing
Probabilistic optimization techniques for multicast key management
Computer Networks: The International Journal of Computer and Telecommunications Networking
EHBT: An Efficient Protocol for Group Key Management
NGC '01 Proceedings of the Third International COST264 Workshop on Networked Group Communication
Key Establishment in Large Dynamic Groups Using One-Way Function Trees
IEEE Transactions on Software Engineering
ELK, a New Protocol for Efficient Large-Group Key Distribution
SP '01 Proceedings of the 2001 IEEE Symposium on Security and Privacy
Effect of overhearing transmissions on energy efficiency in dense sensor networks
Proceedings of the 3rd international symposium on Information processing in sensor networks
Optimal tree structure for key management of simultaneous join/leave in secure multicast
MILCOM'03 Proceedings of the 2003 IEEE conference on Military communications - Volume II
| Hi-index | 0.00 |
Secure and efficient multicast communication is an important area of research for tactical networks. Such forms of communication are essential for efficient collaborative planning, command and control, and situational awareness based applications. In order to realize secure group communication on the battlefield, secure multicast routing must be available and the necessary cryptographic keys must be distributed to the current group members. The routes must be maintained and the keys must be distributed, despite changes in network node position, network topology, communication channel performance, and other factors which affect network connectivity and performance. This paper presents an efficient algorithm for secure group key management called One-way Function Chains eXtended (OFC/X). It is specifically designed for use in dynamic, mobile, ad hoc networks such as tactical networks. We present analytical results comparing the bandwidth performance of OFC/X with other multicast keying algorithms that have appeared in literature. We also compare the energy consumption of OFC/X during member deletion with these algorithms in ad hoc networks. We found that all other keying algorithms use at least 30 percent more energy than OFC/X and that the LKH algorithm requires between 3 and 4 times the energy of OFC/X while using slightly over twice the bandwidth.