International Journal of Computer
Trends and Technology

Research Article | Open Access | Download PDF

Volume 2 | Issue 1 | Year 2011 | Article Id. IJCTT-V2I1P103 | DOI : https://doi.org/10.14445/22312803/IJCTT-V2I1P103

A Routing-Driven Public-Key Cryptosystem Based Key Management Scheme for a Sensor Network

Satya Venkatesh Kadali, O.Srinivasa Rao, Dr MHM Krishna Prasad

Citation :

Satya Venkatesh Kadali, O.Srinivasa Rao, Dr MHM Krishna Prasad, "A Routing-Driven Public-Key Cryptosystem Based Key Management Scheme for a Sensor Network," International Journal of Computer Trends and Technology (IJCTT), vol. 2, no. 1, pp. 254-257, 2011. Crossref, https://doi.org/10.14445/22312803/IJCTT-V2I1P103

Abstract

In homogeneous sensor networks, many-to-one traffic pattern dominates and hence a sensor may only communicate with a small portion of its neighbors. So, the homogeneous sensor networks have poor performance and scalability. Most existing key management schemes try to establish shared keys for all pairs of neighbor sensors, no matter whether these will communicate with each other or not, and this causes large overhead. This project proposes a novel routing-driven key management scheme, which establishes shared keys only for those neighboring sensors that communicate with each other by using RSA public-key algorithm along with Quantum Key Distribution Protocols (QKDPs). Quantum cryptography easily resists replay and passive attacks. Classical cryptography enables efficient key verification and user authentication. This work integrates the advantages of these two techniques along with QKDPs so that the eavesdroppers can be detected, replay attacks can be easily avoided. This project also proposes how user authentication and session key verification can be done in a single step process at the receiving end.

Keywords

Security, key management, sensor networks, Quantum Key Distribution Protocols (QKDPs).

References

[1] L. Eschenauer and V. D. Gligor, “A key management scheme for distributed sensor networks,” in Proc. 9th ACM Conference on Computerand Communication Security, pp. 41-47, Nov. 2002.
[2] H. Chan, A. Perrig, and D. Song, “Random key predistribution schemes for sensor networks,” in Proc. 2003 IEEE Symposium on Security and Privacy, May 2003, pp. 197-213.
[3] Yong Ma, Siddharth Dala1, Majd Alwan, James Aylor, “ROP: A Resource Oriented Protocol for Heterogeneous Sensor Networks” Wireless Communications, vol. 6, no. 9, pp. 3395–3401, in 2007.
[4] K. Whitehouse, C. Sharp, E. Brewer, and D. Culler, “Hood: a neighborhood abstraction for sensor networks,” in Proc. ACM International Conference on Mobile Systems, Applications, and Services (MobiSys ’04), Boston, MA, June, 2004.
[5] N. Koblitz, “Elliptic curve cryptosystems,” Mathematics of omputation, vol. 48, pp. 203-209, 1987.
[6] N. Gura, A. Patel, A. Wander, H. Eberle, and S. C. Shantz, “Comparing elliptic curve cryptography and RSA on 8-bit CPUs,” in Proc. 6th International Workshop on Cryptographic Hardware and Embedded Systems, Boston, MA, Aug. 2004.
[7] N. Koblitz, A Course in Number Theory and Cryptography, 2nd ed. Graduate Texts in Mathematics, vol. 114, Springer, 1994.
[8] I. Blake, G. Seroussi, and N. Smart, Elliptic Curves in Cryptography, London Mathematical Society, Lecture Note Series 265, Cambridge University Press, 1999.