Hop-by-Hop Message Authentication and Source Privacy in Wireless Sensor Networks

Abstract

Message authentication is one of the most effective ways to thwart unauthorized and corrupted messages from being forwarded in wireless sensor networks (WSNs). For this reason, many message authentication schemes have been developed, based on either symmetric-key cryptosystems or public-key cryptosystems. Most of them, however, have the limitations of high computational and communication overhead in addition to lack of scalability and resilience to node compromise attacks. To address these issues, a polynomial-based scheme was recently introduced. However, this scheme and its extensions all have the weakness of a built-in threshold determined by the degree of the polynomial: when the number of messages transmitted is larger than this threshold, the adversary can fully recover the polynomial. In this paper, we propose a scalable authentication scheme based on elliptic curve cryptography (ECC). While enabling intermediate nodes authentication, our proposed scheme allows any node to transmit an unlimited number of messages without suffering the threshold problem. In addition, our scheme can also provide message source privacy. Both theoretical analysis and simulation results demonstrate that our proposed scheme is more efficient than the polynomial-based approach in terms of computational and communication overhead under comparable security levels while providing message source privacy.

Existing System

Message authentication schemes have been developed based on either symmetric-key cryptosystems or public-key cryptosystems. The existing anonymous communication protocols are largely stemmed. The limitations of high computational and communication overhead in addition to lack of scalability and resilience to node compromise attacks. The existing anonymous communication protocols are largely stemmed. Security against existential forgery under adaptive-chosen message attacks is the maximum level of security.

Proposed System

In addition, our scheme can also provide message source privacy. Both theoretical analysis and simulation results demonstrate that our proposed scheme is more efficient than the polynomial-based approach in terms of computational and communication overhead under comparable security levels while providing message source privacy. The proposed Sama is secure against existential forgery under adaptive Chosen message attacks in the random oracle model. Many authentication schemes have been Proposed in literature to provide message authenticity. And integrity verification for wireless sensor networks (wsns). An alternative solution was proposed to thwart the intruder from recovering the polynomial by computing the coefficients of the polynomial.

Architecture