Abstract:

A provably secure authenticated multiple key establishment protocol for Wireless Sensor Networks (WSNs) is proposed.Security of the protocol is based on the computational infeasibility of solving elliptic curve discrete logarithm problem and computational DiffieHellman problem on bilinear pairing.The authentication among the nodes is one of the most challenging security requirements in WSNs.To achieve this security goal, it is required to establish a correct session key among the three adjacent nodes of WSNs. It is proved that the proposed protocol is secure against the attacks on data integrity and the known key security attacks on session key.It also provides perfect forward secrecy.

Key words: bilinear pairing;key exchange;session key