Efficient algorithms for finding maximum matching in graphs
ACM Computing Surveys (CSUR)
Use of elliptic curves in cryptography
Lecture notes in computer sciences; 218 on Advances in cryptology---CRYPTO 85
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
Authenticated group key agreement and friends
CCS '98 Proceedings of the 5th ACM conference on Computer and communications security
Graph theory and its applications
Graph theory and its applications
An Efficient Implementation of Edmonds' Algorithm for Maximum Matching on Graphs
Journal of the ACM (JACM)
Elliptic curves in cryptography
Elliptic curves in cryptography
Simple and fault-tolerant key agreement for dynamic collaborative groups
Proceedings of the 7th ACM conference on Computer and communications security
Key Agreement in Dynamic Peer Groups
IEEE Transactions on Parallel and Distributed Systems
Performance analysis of elliptic curve cryptography for SSL
WiSE '02 Proceedings of the 1st ACM workshop on Wireless security
A New Addition Formula for Elliptic Curves over GF(2^n)
IEEE Transactions on Computers
A Secure Audio Teleconference System
CRYPTO '88 Proceedings of the 8th Annual International Cryptology Conference on Advances in Cryptology
A One Round Protocol for Tripartite Diffie-Hellman
ANTS-IV Proceedings of the 4th International Symposium on Algorithmic Number Theory
A Group Key Establishment Scheme for Ad Hoc Networks
AINA '03 Proceedings of the 17th International Conference on Advanced Information Networking and Applications
Self-Stabilizing Protocols for Maximal Matching and Maximal Independent Sets for Ad Hoc Networks
IPDPS '03 Proceedings of the 17th International Symposium on Parallel and Distributed Processing
CLIQUES: A New Approach to Group Key Agreement
ICDCS '98 Proceedings of the The 18th International Conference on Distributed Computing Systems
Efficient computations of the Tate pairing for the large MOV degrees
ICISC'02 Proceedings of the 5th international conference on Information security and cryptology
Fast elliptic curve arithmetic and improved weil pairing evaluation
CT-RSA'03 Proceedings of the 2003 RSA conference on The cryptographers' track
Key agreement in ad hoc networks
Computer Communications
New multiparty authentication services and key agreement protocols
IEEE Journal on Selected Areas in Communications
Key management approaches to offer data confidentiality for secure multicast
IEEE Network: The Magazine of Global Internetworking
A lightweight group-key management protocol for secure ad-hoc-network routing
Computer Networks: The International Journal of Computer and Telecommunications Networking
| Hi-index | 0.00 |
Mobile Ad hoc Networks (MANETs) create additional challenges for implementing the group key establishment due to resource constraints on nodes and dynamic changes on the topology. To facilitate the deployment of group key agreements in MANETs, a range of distributed algorithms have been proposed. However, for a given level of security, these algorithms incur linearly increasing communication and computational costs. In this paper, we present two scalable maximum matching algorithms (M2) to deploy binary tree-based group key agreements in MANETs. Furthermore, the proposed technique is lightweight since it uses the Elliptic Curve Diffie-Hellman key exchange in place of the regular Diffie-Hellman and also does not require third-party's support. The performance analysis shows that our distributed M2 algorithms reduce key establishment's round number from O(n) to O(log2n) and our novel group key establishment decreases communication cost and computational overhead significantly.