A Secure Key Pre-distribution Scheme in Wireless Sensor Networks using Elliptic Curve Diffie-Hellman Key Exchange
T D Ilakkiya, C Jayakumar and T D Shobana. Article: A Secure Key Pre-distribution Scheme in Wireless Sensor Networks using Elliptic Curve Diffie-Hellman Key Exchange. IJCA Proceedings on International Conference on Innovations In Intelligent Instrumentation, Optimization and Electrical Sciences ICIIIOES(8):34-38, December 2013. Full text available. BibTeX
@article{key:article,
author = {T. D. Ilakkiya and C. Jayakumar and T. D. Shobana},
title = {Article: A Secure Key Pre-distribution Scheme in Wireless Sensor Networks using Elliptic Curve Diffie-Hellman Key Exchange},
journal = {IJCA Proceedings on International Conference on Innovations In Intelligent Instrumentation, Optimization and Electrical Sciences},
year = {2013},
volume = {ICIIIOES},
number = {8},
pages = {34-38},
month = {December},
note = {Full text available}
}
Abstract
Wireless Sensor Networks are often deployed in adverse or hostile environments so there is always a need for key management schemes for sensor nodes. The existing q-composite Random Key Predistribution (RKP) scheme is a probabilistic key management scheme where each node is preloaded with a subset of keys that are randomly selected from a pool of keys. If a pair of neighbor nodes which have at least q common keys can be used to establish a secure link between the nodes. In this paper, we enhanced the previous security analysis (i. e. , resilience against node capture) of the q-composite RKP scheme and we present a lightweight implementation of the Elliptic Curve Diffie-Hellman (ECDH) key exchange for wireless sensor nodes Elliptic Curve Diffie-Hellman (ECDH) key exchange which is feasible for resource-restricted sensor nodes. The proposed method ECDH key exchange in WSNs is offering perfect resilience to node capture, excellent scalability, and low memory as well as reducing communication over-head. ECDH is the highly computation-intensive nature of its underlying cryptographic operations, causing fast execution times and with low energy consumption. Our results show that a full ECDH key exchange between two different nodes consumes a normal energy (including radio communication), which is significantly better for high secure environment reported ECDH implementations on comparable platforms.
References
- M. A. Simpl?cio, P. S. L. M. Barreto, C. B. Margi, and T. M. B. Carvalho, "A survey on key management mechanisms for distributed wireless sensor networks," Computer Networks vol. 54, no. 15, pp. 2591– 2612, 2010.
- L. Eschenauer and V. D. Gligor, "A key-management scheme for dis-tributed sensor networks," in Proc. 2002 ACMConference on Computer and Communications Security, pp. 41–47.
- H. Chan, A. Perrig, and D. X. Song, "Random key pre-distribution schemes for sensor networks," in Proc. 2003 IEEE Symposium on Security and Privacy, pp. 197–213.
- S. Zhu, S. Xu, S. Setia, and S. Jajodia, "Establishing pairwise keys for secure communication in adhoc networks: a probabilistic approach," in Proc. 2003 IEEE International Conference on Network Protocols, pp. 326–335.
- Y. Xiao, V. K. Rayi, B. Sun, X. Du, F. Hu, and M. Galloway,"A survey of key management schemes in wireless sensor networks,"ComputerCommunications. ,vol. 30,no. 11-12,pp. 2314–2341, 2007.
- P. Bose, H. Guo, E. Kranakis, A. Maheshwari, P. Morin, J. Morrison, M. H. M. Smid, and Y. Tang, "On the false-positive rate of Bloom filters," Inf. Processing Letters. , vol. 108, no. 4, pp. 210–213, 2008.
- K. J. Christensen, A. Roginsky, and M. Jimeno, "A new analysis of the false positive rate of a Bloom filter," Inf. Processing Letters vol. 110, no. 21, pp. 944–949, 2010. [8 "Diffie- Hellman Key Exchange Protocol, Its Generalization and Nilpotent Groups," Ayan Mahalanobis, Florida, August 2005.
- ECC over RSA for Asymmetric Encryption: A Review, IJCSI International Journal of Computer Science Issues, Vol. 8, Issue 3, No. 2, May 2011