Research Article
An Efficient Scheme for Establishing Pairwise Keys for Wireless Sensor Networks
@INPROCEEDINGS{10.1109/COMSWA.2007.382459, author={Abhishek Gupta and Pavan Nuggehalli and Joy Kuri}, title={An Efficient Scheme for Establishing Pairwise Keys for Wireless Sensor Networks}, proceedings={1st International IEEE Workshop on WIreless Systems: Advanced Research and Development}, publisher={IEEE}, proceedings_a={WISARD}, year={2007}, month={7}, keywords={Cryptography Energy capture Flash memory Information security Microcontrollers Read-write memory Resilience Surveillance Temperature sensors Wireless sensor networks}, doi={10.1109/COMSWA.2007.382459} }- Abhishek Gupta
Pavan Nuggehalli
Joy Kuri
Year: 2007
An Efficient Scheme for Establishing Pairwise Keys for Wireless Sensor Networks
WISARD
IEEE
DOI: 10.1109/COMSWA.2007.382459
Abstract
This paper addresses the problem of secure path key establishment in wireless sensor networks that uses the random key pre-distribution technique. Inspired by the recent proxy-based scheme in the work of Ling and Znati (2005) and Li et al. (2005), we introduce a friend-based scheme for establishing pairwise keys securely. We show that the chances of finding friends in a neighbourhood are considerably more than that of finding proxies, leading to lower communication overhead. Further, we prove that the friend-based scheme performs better than the proxy-based scheme both in terms of resilience against node capture as well as in energy consumption for pairwise key establishment, making our scheme more feasible.
Copyright © 2007–2024 IEEE
