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

Abstract

AbstractThis 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 agreement problem in Ad Hoc network in terms of memory cost, computation cost and communication cost.KeywordsAd Hoc NetworkRegion-Based Group Key Agreement (RBGKA) ProtocolGroup Elliptic Curve Diffie-Hellman (GECDH) protocolTree-Based Group Elliptic Curve Diffie-Hellman (TGECDH) protocol