Group Key Exchange Analysis in Sensor Networks

— In Wireless sensor networks, the security is the primary imperative in message transmission. For secure group based message transmission, shared-key provides secure transmission. This paper addresses an intriguing security issue in portable specially appointed systems that are element gathering key assention for key foundation. For secure correspondence, a gathering key must be shared by all gathering individuals. This gathering key ought to be overhauled when the current bunch individuals are leaving the system or new individuals are coming into the current system. In this paper, we propose a productive gathering key understanding convention. Here the thought is the gathering key is calculated and sends to all the nodes which are part of the group. For calculating gathering keys we are using Elliptic Curve key forms. This paper analyzes the performance of weierstrass curve, Edward curve, and Jacobin curve. These gathering keys ought to be changed when there are participation changes, (for example, when the present part leaves or the new part joins). By presenting gathering based approach, messages and key redesigns will be constrained in gathering. Consequently calculation burden is changed when the gathering key calculation in centralized or distributed. Both hypothetical and pragmatic results demonstrate that Edward curve is the best form for proficient gathering key understanding convention performs well for the key foundation issue in impromptu system regarding proficiency what's more, security. And we analyze in both centralized and distributed.

[1]  N. Suganthi,et al.  Energy Efficient Key Management Scheme for Wireless Sensor Networks , 2014, Int. J. Comput. Commun. Control.

[2]  R. Datta,et al.  Transmission-efficient group-key generation in large dynamic MANET environments , 2012, 2012 Third International Conference on Emerging Applications of Information Technology.

[3]  Hui-Tang Lin,et al.  Multi-level and group-based key management for mobile ad hoc networks , 2012, 2012 International Conference on Information Security and Intelligent Control.

[4]  M. Buvana,et al.  A group key agreement protocol based on stability and power using Elliptic curve cryptography , 2011, 2011 International Conference on Emerging Trends in Electrical and Computer Technology.

[5]  Yan Gao,et al.  Modeling of Node Energy Consumption for Wireless Sensor Networks , 2011, Wirel. Sens. Netw..

[6]  V. Sumathy,et al.  A Novel Approach towards Cost Effective Region-Based Group Key Agreement Protocol for Ad Hoc Networks Using Elliptic Curve Cryptography , 2010, Int. J. Commun. Netw. Syst. Sci..

[7]  V. Vijayalakshmi,et al.  Secure Antnet Routing Algorithm for Scalable Adhoc Networks Using Elliptic Curve Cryptography , 2007 .

[8]  K. Ammayappan,et al.  Mutual Authentication and Key Agreement based on Elliptic Curve Cryptography for GSM , 2006, 2006 International Conference on Advanced Computing and Communications.

[9]  Khalid Kaabneh,et al.  Key Exchange Protocol in Elliptic Curve Cryptography with No Public Point , 2005 .

[10]  Vipul Gupta,et al.  An End-to-End Systems Approach to Elliptic Curve Cryptography , 2002, CHES.

[11]  K. Thilagavathi,et al.  An Efficient Authentication Protocol Based on Elliptic Curve Cryptography for Mobile Networks , 2009 .