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.

Highlights

  • Wireless networks are growing rapidly in recent years

  • This paper addresses an interesting security problem in wireless ad hoc networks: the dynamic group key agreement key establishment

  • We propose a novel, secure, scalable and efficient region-based group key agreement protocol for ad hoc networks

Read more

Summary

Introduction

Wireless networks are growing rapidly in recent years. Wireless technology is gaining more and more attention from both academia and industry. Packets from source wireless hosts are received by near-by base stations, injected into the underlying network infrastructure and transferred to destination hosts. The contribution of this work includes 1) In this paper, we propose a new efficient method for solving the group key management problem in adhoc network. This protocol provides efficient, scalable and reliable key agreement service and is well adaptive to the mobile environment of ad-hoc network. 3) We design and implement region-based group key agreement protocol using Java and conduct extensive experiments and theoretical analysis to evaluate the performance like memory cost, communication cost and computation cost of our protocol for Ad-Hoc network.

Elliptic Curve Cryptography
Two Parties Elliptic Curve Diffie-Hellman Protocol
Motivation
Overview of Region-Based Group Key Agreement Protocol
Network Dynamics
Member Leave
Communication Protocol
Applying Elliptic Curve Based Diffie-Hellman Key Exchange
Tree-Based Group Elliptic Curve Diffie-Hellman Protocol
Storage Overhead
Communication Overhead
Computation Overhead
Findings
Conclusions
Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.