Secure and Efficient Group Key Agreements for Cluster Based Networks
Transactions on Computational Science IV
A Cluster-Based Framework for the Security of Medical Sensor Environments
TrustBus '09 Proceedings of the 6th International Conference on Trust, Privacy and Security in Digital Business
Efficient cluster-based group key agreement protocols for wireless ad hoc networks
Journal of Network and Computer Applications
A lightweight group-key management protocol for secure ad-hoc-network routing
Computer Networks: The International Journal of Computer and Telecommunications Networking
Dynamic asymmetric group key agreement for ad hoc networks
Ad Hoc Networks
T-robust scalable group key exchange protocol with O(log n) complexity
ACISP'11 Proceedings of the 16th Australasian conference on Information security and privacy
Redesigning group key exchange protocol based on bilinear pairing suitable for various environments
Inscrypt'10 Proceedings of the 6th international conference on Information security and cryptology
Group key agreement for secure group communication in dynamic peer systems
Journal of Parallel and Distributed Computing
Privacy-preserving ID-based key agreement protocols for cluster-based MANETs
International Journal of Ad Hoc and Ubiquitous Computing
Privacy-preserving ID-based key agreement protocols for cluster-based MANETs
International Journal of Ad Hoc and Ubiquitous Computing
Autonomous Shared Key Management Scheme for Space Networks
Wireless Personal Communications: An International Journal
| Hi-index | 0.00 |
The establishment of a group key in wireless ad hoc networks is considered a difficult task from both an algorithmic and computational point of view. The reason is the special nature and the constraints posed by these networks. In this paper, we present an efficient group key agreement protocol which is particularly suitable for energy constrained, dynamically evolving wireless ad hoc networks. The topology of the network is reflected in a structure composed by small clusters. This clustering allows the synchronous execution of efficient tripartite key agreement protocols based on pairings. The required computations are simple for the devices to implement, the size of the exchanged messages is minimum and the storage memory required in every node is very small. The proposed protocol also avoids the usage of a TTP or a central authority and achieves a good energy balance. Finally, we compare the communication/computation complexity of our protocol with previously known protocols and show that it compares favourably with them.