Phd Projects | IEEE Project | IEEE Projects 2020-19 in Trichy & Chennai

IEEE Projects Trichy, Best IEEE Project Centre Chennai, Final Year Projects in Trichy - We Provide IEEE projects 2018 - 2019 , IEEE 2018 Java Projects for M.E/M.Tech, IEEE 2018 Dot net Projects for B.E/B.Tech, IEEE 2018 Power electronics Projects Engineering & Diploma Students, Matlab, Embedded, NS2 Projects
You are here: Home / ieee projects 2014 / WIRELESS SENSOR NETWORKS WITH HOP-BY-HOP MESSAGE AUTHENTICATION AND SOURCE PRIVACY

WIRELESS SENSOR NETWORKS WITH HOP-BY-HOP MESSAGE AUTHENTICATION AND SOURCE PRIVACY

by

In this abstract, we propose an unconditionally secure and efficient source anonymous message authentication (SAMA) scheme based on the optimal modified ElGamal signature (MES) scheme on elliptic curves. This MES scheme is secure against adaptive chosen-message attacks in the random oracle model. Our scheme enables the intermediate nodes to authenticate the message so that all corrupted message can be detected and dropped to conserve the sensor power. While achieving compromise resiliency, flexible-time authentication and source identity protection, our scheme does not have the threshold problem. Both theoretical analysis and simulation results demonstrate that our proposed scheme is more efficient than the polynomial-based algorithms under comparable security levels. Message authentication schemes have been developed, based on either symmetric-key crypto systems or public-key crypto systems. 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. So this abstract 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.