Diffie-Hellman key distribution extended to group communication
CCS '96 Proceedings of the 3rd ACM conference on Computer and communications security
Multicluster, mobile, multimedia radio network
Wireless Networks
Handbook of Applied Cryptography
Handbook of Applied Cryptography
The Oracle Diffie-Hellman Assumptions and an Analysis of DHIES
CT-RSA 2001 Proceedings of the 2001 Conference on Topics in Cryptology: The Cryptographer's Track at RSA
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
Dynamic Group Diffie-Hellman Key Exchange under Standard Assumptions
EUROCRYPT '02 Proceedings of the International Conference on the Theory and Applications of Cryptographic Techniques: Advances in Cryptology
A One Round Protocol for Tripartite Diffie-Hellman
ANTS-IV Proceedings of the 4th International Symposium on Algorithmic Number Theory
ANTS-V Proceedings of the 5th International Symposium on Algorithmic Number Theory
Tree-based group key agreement
ACM Transactions on Information and System Security (TISSEC)
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)
A secure and scalable Group Key Exchange system
Information Processing Letters
Dynamic group key agreement in tree-based setting
ACISP'05 Proceedings of the 10th Australasian conference on Information Security and Privacy
CT-RSA'05 Proceedings of the 2005 international conference on Topics in Cryptology
Constant round dynamic group key agreement
ISC'05 Proceedings of the 8th international conference on Information Security
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
A survey of clustering schemes for mobile ad hoc networks
IEEE Communications Surveys & Tutorials
New directions in cryptography
IEEE Transactions on Information Theory
Provably Secure Constant Round Contributory Group Key Agreement in Dynamic Setting
IEEE Transactions on Information Theory
The Design and Simulation of a Mobile Radio Network with Distributed Control
IEEE Journal on Selected Areas in Communications
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
Hi-index | 0.00 |
Wireless ad hoc networks support rapid on-demand and adaptive communication among the nodes due to their self-configurable and autonomous nature and lack of fixed infrastructure. Security is a crucial factor for such systems. Since ad hoc networks rely on the collaboration principle, the issue of key distribution and efficient group key management in such networks represents two of the most important problems. We describe hybrid solutions to the problem of key distribution and key management by reflecting ad hoc networks in a topology composed of a set of clusters. To date no security proofs exist for these types of protocols. We present two dynamically efficient schemes. We show that both our hybrid schemes are provably secure in the standard model under Decision Diffie-Hellman (DDH) assumption. The proposed protocols avoid the use of a trusted third party (TTP) or a central authority, eliminating a single point of attack. We analyse the complexity of the schemes and differentiate between the two approaches based on performance in a wireless setting. In comparison with the existing cluster-based hybrid key agreement protocols, our proposed approaches individually provide better performance in terms of both communication and computation, handle dynamic events efficiently, and are supported by sound security analysis in formal security models under standard cryptographic assumptions.