Authentication Through Elliptic Curve Cryptography (ECC) Technique in WMN

Authentication Through Elliptic Curve Cryptography (ECC) Technique in WMN

Geetanjali Rathee (Jaypee University of Information Technology, Solan, India) and Hemraj Saini (Jaypee University of Information Technology, Solan, India)
Copyright: © 2018 |Pages: 11
DOI: 10.4018/IJISP.2018010104
OnDemand PDF Download:
$30.00
List Price: $37.50

Abstract

Recently, Wireless Mesh Network is deliberated as a significant technology due to its self-healing and self-organizing characteristics. In WMN, data is forwarded through multiple hops to the destination node. One of the factors that impact the network performance is the secure communication delay. An authentication technique having significant delay may enhance the possibility of several security threats. A number of authentication protocols have been proposed in the literature but if existing practices are deliberated then to optimize one of the constraint other parameters are affected radically. In this manuscript, a Diffie-Hellman elliptic curve technique is used over WMN which reduces latency and computational overhead issues. Further to prove the integrity of proposed work, the performance is measured theoretically and analyzed experimentally over ns2 simulator.
Article Preview

The transmit nature of communication depends on the median nodes for multi-hop conduction which occurs various security vulnerabilities in wireless mesh networks. In WMN, authentication is endorsed in two transmitting groups (either a set of MCs or MR) to recognize the legitimacy.

Figure 1.

Message transmission

Symmetric and public key cryptosystems are the two ways to provide authentication in WMN. GSM networks used symmetric cryptosystem and provide mutual authentication between VLR (Visited Location Register) and mobile devices (Tang & Wu, 2008). However, the scheme may suffer from DOS attack at HLR and cause long latency in multi hop WMN. Public key cryptosystem is used by EAP standard provide an authentication infrastructure between servers and clients. The methods of Public key cryptosystem are quite complex and lacks the ability to meet the requirement for MC’s. In order to reduce authentication delay in WMN, a number of schemes have been proposed in the literature. In (Aziz and Diffie, 1994) Aboba pointed out that 50ms in video conferencing and 150ms in streaming media must be ensured to provide a quality user experience. But every EAP based 802.1x limits the authentication delay min of 1000ms and 250ms during fast resume mode. Akbar and khan (Daly, Zarai & Kamoun et al., 2011) proposed a multi-hop authentication scheme which is based on EAP-TTLS (Tunneled Transport layer security). In this the minimum authentication delay is achieved up to 250ms. Further Lee et. Al. (I. Lee et al., 2007) proposed a distributed authentication method in which several trusted nodes are distributed among multiple domains of WMN. ID based cryptography is proposed by Zhang et. Al. (Y. Zhang et al., 2007) give a novel user broker operator trust model. All these approaches are available for single hop authentication. He, Joshi, Agrawal et al. (He, Joshi, Agrawal et al., 2010) proposed a de-centralized generation mechanism and provide multi-hop authenticity using symmetric polynomial based key generation. Although the authors are able to reduce in average authentication delay up to 100ms but suffers from other drawbacks i.e. DoS attack, computational overhead, passive eavesdrop etc. Authentication delay in multi hop scenario is quite difficult because messages have to travel multiple hops between source and destination. Thus, the requirement of QoS and security services, a fast and reliable authentication schemes need to be designed.

In this paper, ECDH (Lederer, Mader, Koschuch et al., 2009) mechanism is analyzed over WMN which provide the authentication between source and destination without involvement of intermediate nodes and reduce authentication delay at maximum level.

Complete Article List

Search this Journal:
Reset
Open Access Articles: Forthcoming
Volume 12: 4 Issues (2018): 1 Released, 3 Forthcoming
Volume 11: 4 Issues (2017)
Volume 10: 4 Issues (2016)
Volume 9: 4 Issues (2015)
Volume 8: 4 Issues (2014)
Volume 7: 4 Issues (2013)
Volume 6: 4 Issues (2012)
Volume 5: 4 Issues (2011)
Volume 4: 4 Issues (2010)
Volume 3: 4 Issues (2009)
Volume 2: 4 Issues (2008)
Volume 1: 4 Issues (2007)
View Complete Journal Contents Listing