Paper 2013/747 Original: eprint.iacr.org/2013/747 ↗
Authenticated Multiple Key Establishment Protocol for Wireless Sensor Networks
Abstract
The article proposes a provably secure authenticated multiple key establishment protocol for Wireless Sensor Network. Security of the protocol is based on the computational infeasiblity of solving Elliptic Curve Discrete Logarithm Problem and Computational Diffie-Hellman Problem on Bilinear Pairing. User authentication is a one of the most challenging security requirement in wireless sensor networks (WSN). 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 the attack on data integrity and known key security attack on session key. It also provides perfect forward secrecy.
Metadata
- Available format(s)
PDF- Publication info
- Preprint.
- History
- 2013-11-17: last updated
- 2013-11-17: published
- Short URL
- https://ia.cr/2013/747
- License
- https://creativecommons.org/licenses/by/4.0/
BibTeX
@misc{cryptoeprint:2013/747,
author = {Jayaprakash Kar},
title = {Authenticated Multiple Key Establishment Protocol for Wireless Sensor Networks},
howpublished = {Cryptology {ePrint} Archive, Paper 2013/747},
year = {2013},
url = {https://eprint.iacr.org/2013/747}
}