A Novel Approach towards Cost Effective Region-Based Group Key Agreement Protocol for Ad Hoc Networks Using Elliptic Curve Cryptography

Krishnan Kumar; J. Nafeesa Begum; V. Sumathy

doi:10.4236/ijcns.2010.34047

Home > Journals > Computer Science & Communications > IJCNS

IJCNS> Vol.3 No.4, April 2010

Share This Article:

Open Access

A Novel Approach towards Cost Effective Region-Based Group Key Agreement Protocol for Ad Hoc Networks Using Elliptic Curve Cryptography

Abstract Full-Text HTML

Download as PDF (Size:4339KB) PP. 369-379

DOI: 10.4236/ijcns.2010.34047 4,743 Downloads 8,465 Views Citations

Author(s) Leave a comment

Krishnan Kumar, J. Nafeesa Begum, V. Sumathy

Affiliation(s)

ABSTRACT

This paper addresses an interesting security problem in wireless ad hoc networks: the dynamic group key agreement key establishment. For secure group communication in an ad hoc network, a group key shared by all group members is required. This group key should be updated when there are membership changes (when the new member joins or current member leaves) in the group. In this paper, we propose a novel, secure, scalable and efficient region-based group key agreement protocol for ad hoc networks. This is implemented by a two-level structure and a new scheme of group key update. The idea is to divide the group into subgroups, each maintaining its subgroup keys using group elliptic curve diffie-hellman (GECDH) Protocol and links with other subgroups in a tree structure using tree-based group elliptic curve diffie-hellman (TGECDH) protocol. By introducing region-based approach, messages and key updates will be limited within subgroup and outer group; hence computation load is distributed to many hosts. Both theoretical analysis and experimental results show that this Region-based key agreement protocol performs well for the key establishment problem in ad hoc network in terms of memory cost, computation cost and communication cost.

KEYWORDS

Ad Hoc Network, Region-Based Group Key Agreement Protocol, Elliptic Curve Diffie-Hellman, Tree-Based Group Elliptic Curve Diffie-Hellman

Conflicts of Interest

The authors declare no conflicts of interest.

Cite this paper

K. Kumar, J. Begum and V. Sumathy, "A Novel Approach towards Cost Effective Region-Based Group Key Agreement Protocol for Ad Hoc Networks Using Elliptic Curve Cryptography," International Journal of Communications, Network and System Sciences, Vol. 3 No. 4, 2010, pp. 369-379. doi: 10.4236/ijcns.2010.34047.

References

[1]	Kefa Rabah, “Theory and Implementation of Elliptic Curve Cryptography,” Journal of Applied Sciences, Vol. 5, No. 4, 2005, pp. 604-633.

[2]	W. Stallings, “Cryptography and Network Security Principles and Practices,” 3rd Edition, Pearson Education.

[3]	Y. Wang, B. Ramamurthy and X. K. Zou, “The Performance of Elliptic Curve Based Group Diffie-Hellman Protocols for Secure Group Communication over Ad Hoc Networks,” IEEE International Conference on Communication, Vol. 5, 2006, pp. 2243-2248.

[4]	Y. Amir, Y. Kim, C. Nita-Rotaru and G. Tsudik, “On the Performance of Group Key-Agreement Protocols,” Proceedings of the 22nd IEEE International Conference on Distributed Computing Systems, Viena, Austria, 2002.

[5]	M. Steiner, G. Tsudik and M. Waidner, “Key Agreement in Dynamic Peer Groups,” IEEE Transaction on Parallel and Distributed Systems, Vol. 11, No. 8, 2000, pp. 769- 780.