Hop-by-Hop Message Authentication in Wireless Sensor Networks based on Elliptic Curve Cryptography

In wireless sensor networks many message authentication schemes have been developed, based on either symmetric-key cryptosystems or public-key cryptosystems. 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, 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.