Abstract

Group key agreement protocol permits a set of users to create a common key to make sure security of information exchange among members of the group. It is extensively used in secure multiparty computation, resource security sharing, and distributed collaborative computing etc. For large wireless ad-hoc network, there is no authentication center, the computing power and communication distance of terminals are constrained, and nodes frequently join and exit the network. For these reasons, Group Key Management for securing multicast communications in an energy-constrained large wireless ad-hoc network environment is still remains a critical and challenging issue. In this direction, we propose a cluster-based hybrid hierarchical-group key agreement (CHH-GKA) framework to provide a scalable solution for Secure Group Communication (SGC) in large wireless ad hoc networks (WANETs). This technique is based on splitting a large group into a certain number of clusters in which the last member of each of the clusters is designated as a cluster head (CH) and the last member of the group is designated as the group controller (GC). First we apply on hand Naresh–Murthy-group key agreement (NM-GKA) protocol locally in every cluster in parallel in level-I to generate CKs and then in level-II, the CHs’ use these CKs and implement NM-GKA protocol again among them to form the complete group key. Finally each CH distributes the group key to all its members through their respective CK encrypted links. In this process, first we survey several cluster-based hierarchical GKA protocols and compare the proposed one with them and show that it provides optimal performance with regard to computation and communication expenses. Further, it also handles dynamic events and is provably secure in formal security model under the cryptographic suppositions.

Highlights

  • WANETS provide whenever–wherever networking amenities for communication establishment through the public wireless medium

  • Background protocols Here first we introduce several notations presented during the course of the paper and we present the backbone on hand Naresh–Murthy-group key agreement (NM-GKA) protocol

  • NM‐dynamic CCH protocol (NM‐DCHH) To address the dynamic events such as join and leave in GKA we proposed a NMDCCH-GKA by introducing NM-CHH.Join protocol and NM-CHH.Leave protocol as follows: NM‐CHH.Join protocol The principal security prerequisite of member joining is the protection of the earlier group key (GK) from both the outsiders and the newly joining group members

Read more

Summary

Introduction

WANETS provide whenever–wherever networking amenities for communication establishment through the public wireless medium. Most of the traditional GKA schemes stated in the literature are unable to handle the dynamic nature (joining and leaving of nodes from the clusters) in WANETs. In precise, the renowned protocols in [3, 11, 36, 38] competent for wired networks, may not be applicable to the WANETs due to their enormous dynamism. After a thorough study in examined research area, in this work we adopted cluster based hybrid hierarchical approach: dynamic cluster-based hybrid hierarchical group key agreement for large wireless ad hoc networks. The key contribution of this work is authenticated cluster-based hybrid hierarchical GKA: NM-CHH-GKA for large wireless ad hoc networks. Algorithm 1. (Procedure for Cluster Key Agreement): among every node of the cluster Ci

3: Choose share it to cluster Ci nodes
Conclusion and future scope
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.