Diffie-Hellman key distribution extended to group communication
CCS '96 Proceedings of the 3rd ACM conference on Computer and communications security
Communication complexity of group key distribution
CCS '98 Proceedings of the 5th ACM conference on Computer and communications security
Secure group communications using key graphs
IEEE/ACM Transactions on Networking (TON)
Leader election algorithms for mobile ad hoc networks
DIALM '00 Proceedings of the 4th international workshop on Discrete algorithms and methods for mobile computing and communications
Identity-Based Encryption from the Weil Pairing
CRYPTO '01 Proceedings of the 21st Annual International Cryptology Conference on Advances in Cryptology
Efficient Algorithms for Pairing-Based Cryptosystems
CRYPTO '02 Proceedings of the 22nd Annual International Cryptology Conference on Advances in Cryptology
Identity Based Authenticated Group Key Agreement Protocol
INDOCRYPT '02 Proceedings of the Third International Conference on Cryptology: Progress in Cryptology
A One Round Protocol for Tripartite Diffie-Hellman
ANTS-IV Proceedings of the 4th International Symposium on Algorithmic Number Theory
The height of a random binary search tree
Journal of the ACM (JACM)
Energy-Optimal and Energy-Balanced Sorting in a Single-Hop Wireless Sensor Network
PERCOM '03 Proceedings of the First IEEE International Conference on Pervasive Computing and Communications
Tree-based group key agreement
ACM Transactions on Information and System Security (TISSEC)
Attack on an ID-based authenticated group key agreement scheme from PKC 2004
Information Processing Letters
Routing in mobile ad hoc networks
Routing in mobile ad hoc networks
Energy-efficient and scalable group key agreement for large ad hoc networks
PE-WASUN '05 Proceedings of the 2nd ACM international workshop on Performance evaluation of wireless ad hoc, sensor, and ubiquitous networks
Cluster-based Group Key Agreement for Wireless Ad hoc Networks
ARES '08 Proceedings of the 2008 Third International Conference on Availability, Reliability and Security
A Clustering-based Group Key Agreement Protocol for Ad-Hoc Networks
Electronic Notes in Theoretical Computer Science (ENTCS)
CANS '08 Proceedings of the 7th International Conference on Cryptology and Network Security
Scalable authenticated tree based group key exchange for ad-hoc groups
FC'07/USEC'07 Proceedings of the 11th International Conference on Financial cryptography and 1st International conference on Usable Security
NanoECC: testing the limits of elliptic curve cryptography in sensor networks
EWSN'08 Proceedings of the 5th European conference on Wireless sensor networks
Authenticated and communication efficient group key agreement for clustered ad hoc networks
CANS'06 Proceedings of the 5th international conference on Cryptology and Network Security
New directions in cryptography
IEEE Transactions on Information Theory
A conference key distribution system
IEEE Transactions on Information Theory
Autonomous Shared Key Management Scheme for Space Networks
Wireless Personal Communications: An International Journal
| Hi-index | 0.00 |
The special nature and the constraints posed by wireless ad hoc networks make the establishment of a group key among all nodes a difficult and challenging task. Therefore, the execution of a group key agreement protocol which involves all the nodes in the network must be very carefully selected having in mind both the computation and communication efficiency. 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 achieves a good energy balance and is very flexible because it can be used either as contributory, non-contributory, unauthenticated or authenticated protocol by simply modifying a step of the protocol. Finally, we compare the communication/computation complexity of the unauthenticated and authenticated versions of our protocol with previously known protocols and show that they compare favourably with them.