Research Article
Computationally Efficient Mutual Entity Authentication in Wireless Sensor Networks
@INPROCEEDINGS{10.1007/978-3-642-11723-7_13, author={Zhijun Li and Guang Gong}, title={Computationally Efficient Mutual Entity Authentication in Wireless Sensor Networks}, proceedings={Ad Hoc Networks. First International Conference, ADHOCNETS 2009, Niagara Falls, Ontario, Canada, September 22-25, 2009. Revised Selected Papers}, proceedings_a={ADHOCNETS}, year={2012}, month={7}, keywords={mutual entity authentication computationally efficient learning parity with noise wireless sensor networks HB protocol HB-hybrid}, doi={10.1007/978-3-642-11723-7_13} }- Zhijun Li
Guang Gong
Year: 2012
Computationally Efficient Mutual Entity Authentication in Wireless Sensor Networks
ADHOCNETS
Springer
DOI: 10.1007/978-3-642-11723-7_13
Abstract
Mutual entity authentication plays an important role in securing wireless sensor networks. In this paper, we present a computationally efficient authentication framework, based on learning parity with noise problem. The authentication only requires the simplest bit-operations, which makes it suitable for resource-restrained wireless sensor networks. The framework not only presents an approach to securely combine two one-way authentication protocols from the HB-family, but also provides significant enhancements in terms of feasibility of storage/communication requirement. It spawns three specific protocols with different trade-offs between communication overload and memory cost. We extensively analyze their performance and security properties. Furthermore, their applications in different wireless sensor network scenarios are discussed in detail.
