ESS‐IBAA: Efficient, short, and secure ID‐based authentication algorithm for wireless sensor network

Abstract

Summary Designing an efficient, short, and secure authentication algorithm for resource‐constrained sensor nodes of wireless sensor networks (WSNs) is a challenging task. Authentication in WSNs is mainly performed by the digital signature algorithm. In this paper, we propose an efficient, short, and secure pairing computation‐free ID‐based authentication algorithm (signature scheme) ESS‐IBAA for WSNs which completely follows the rule of identity‐based cryptosystem. Identity‐based schemes, unlike traditional public‐key infrastructure (PKI)‐based schemes, remove the need for public‐key certificates for public‐key validation. It also removes extra costs associated with the public‐key certificate and traffic management. Further, due to the requirement of low power and fast authentication, bilinear pairing computation‐free identity‐based signature schemes are applicable in WSNs. Keeping this in mind, ESS‐IBAA scheme is proposed, which is pairing computation free and uses a general cryptographic hash function in the place of a costly map‐to‐point hash function. The proposed scheme ESS‐IBAA is secure against existential forgery on adaptive chosen message and ID attack in the random oracle model under the hardness of the elliptic curve discrete logarithm problem (ECDLP). Moreover, comparative performance analysis shows that the proposed scheme ESS‐IBAA is much more efficient in both communication cost and computation cost from the existing related schemes.

Improving ANiTW Performance Using Bigrams Character Encoding and Identity-Based Signature

“…However, the high cost of pairing computation and long signature size can be a problem for the implementation process in low-bandwidth environments (e.g., cell phones where most users use social media) [34]. A pairing-free scheme has also been proposed as an alternative approach for generating a faster and shorter signature generation over an elliptic curve [34,35]. Moreover, since the signature is a point element in an elliptic curve, we can shorten the signature size by performing point compression and decompression [36].…”

“…b: Generating signature Considering the signature length and the computational cost, we choose to implement a modified scheme of Yaduvanshi's [34] and Mishra's [35] methods. The scheme is divided into four stages, setup, user key extraction, signature generation, and signature verification.…”

“…The scheme is divided into four stages, setup, user key extraction, signature generation, and signature verification. On the proposed method, the setup and key extraction scheme proposed by Yaduvanshi et al [34] is implemented with hash functions proposed by Mishra et al [35]. Two hash function used on this process are H 1 : (0, 1)…”

Energy-Efficient Adaptive Sensing Scheduling in Wireless Sensor Networks Using Fibonacci Tree Optimization Algorithm

“…Adaptive self-configuring sEnsor networks topologies (ASCENT) [ 18 ], PEAS, PECAS, Low-energy adaptive clustering hierarchy (LEACH-GA) [ 23 ], IBLEACH [ 24 ], energy-efficient surveillance system (ESS) [ 25 ] and BS [ 20 ] do not take complete coverage of the region as their primary goal. Cooperative spectrum sensing (CSS) [ 22 ], however, is the opposite.…”

Energy-Efficient Adaptive Sensing Scheduling in Wireless Sensor Networks using Fibonacci Tree Optimization Algorithm

“…This is a goal that is hard not to consider. 131 ASCENT [18], PEAS, PECAS, LEACH-GA [19], IBLEACH [20], ESS [23], OGDC 132 [24], and BS does not regard complete coverage of the region as their primary goal.…”