By Topic

Efficient Region -Based Group Key Agreement Protocol for Ad Hoc Networks using Elliptic Curve Cryptography

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Kumar, K. ; Dept. of CSE, Gov. Coll. of Eng., Bargur ; Sumathy, V. ; Nafeesa Begum, J.

A group key agreement (GKA) protocol is a mechanism to establish a cryptographic key for a group of participants, based on each one's contribution, over a public network. Security of various group-oriented applications for ad-hoc groups requires a group secret shared between all participants. In ad hoc networks, the movement of the network nodes may quickly change the topology resulting in the increased in e overhead during messaging for topology maintenance, the region based schemes of ad hoc networks therefore aim at handling topology maintenance, managing node movement and reducing overhead. When the group composition changes, group controller can employ supplementary GKA protocols to derive a new key. Thus, they are well-suited to the key establishment needs of dynamic peer-to-peer networks as in ad hoc networks. While many of the proposed GKA protocols are too expensive to be employed by the constrained devices often present in ad hoc networks, others lack a formal security analysis. In this paper, a simple, secure and efficient region based GKA protocol using elliptic curve cryptography well suited to dynamic ad hoc networks is presented. This paper introduces a region-based contributory group key agreement that achieves the performance lower bound by utilizing a novel group elliptic curve Diffie-Hellman (GECDH) protocol and tree-based group elliptic curve Diffle-Hellman (TGECDH) protocol, called GEDH & TGECDH protocol. Both theoretical and simulation studies shows that the proposed scheme achieves much lower communication, computation and memory cost than the existing group Diffie-Hellman and tree based contributory group key agreement schemes.

Published in:

Advance Computing Conference, 2009. IACC 2009. IEEE International

Date of Conference:

6-7 March 2009