ABSTRACT
The chapter proposes a provably secure authenticated multiple-key establishment protocol for wireless sensor networks (WSNs). Security of the protocol is based on the computational infeasibility of solving the elliptic curve discrete logarithm problem and computational Diffie-Hellman problem on Bilinear Pairing. User authentication is one of the most challenging security requirements
Contents 4.1 Introduction ..................................................................................................................... 68 4.2 Preliminaries .................................................................................................................... 69
4.2.1 Elementary Concepts of Elliptic Curve (EC) ........................................................ 69 4.2.2 Group Law in Elliptic Curve ................................................................................ 70 4.2.3 Elliptic Curve Cryptography ................................................................................ 72 4.2.4 Pairing-Based Cryptography ................................................................................. 72
4.3 Notations ..........................................................................................................................74 4.4 Security Model ..................................................................................................................74 4.5 Proposed Protocol Based on ECC .....................................................................................76 4.6 Security Analysis .............................................................................................................. 78 4.7 Proposed Protocol on Bilinear Pairings ............................................................................ 79 4.8 Security Analysis .............................................................................................................. 82 4.9 Computational Cost ......................................................................................................... 83 4.10 Implementation Issues ...................................................................................................... 84
4.10.1 Testing .................................................................................................................. 86 4.11 Conclusion ....................................................................................................................... 86 References ................................................................................................................................. 86
in WSNs. It is required to establish the correct session key between two adjacent nodes of WSNs to achieve this security goal. Here we prove that the proposed protocol is secure against attacks on data integrity and known-key security attacks on a session key. It also provides perfect forward secrecy.
