A New Scheme for Establishing Pairwise Keys for Wireless Sensor Networks

  • Abhishek Gupta
  • Joy Kuri
  • Pavan Nuggehalli
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4308)


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 [1] and [2], 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 in terms of resilience against node capture.


Wireless Sensor Network Destination Node Request Packet Node Capture Secure Path 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Ling, H., Znati, T.: End-to-end pairwise key establishment using multi-path in wireless sensor network. In: Proceedings of the 2005 IEEE Global Communications Conference, GLOBECOM 2005 (2005)Google Scholar
  2. 2.
    Li, G., Ling, H., Znati, T.: Path key establishment using multiple secured paths in wireless sensor networks. In: Proceedings of ACM CoNEXT, Toulouse, France (2005)Google Scholar
  3. 3.
    Carman, D.W., Kruus, P.S., Matt, B.J.: Constraints and approaches for distributed sensor network security. Technical Report #00-010, NAI Labs (2000)Google Scholar
  4. 4.
    Eschenauer, L., Gligor, V.D.: A key-management scheme for distributed sensor networks. In: Proceedings of the 9th ACM Conference on Computer and Communications Security, CCS (2002)Google Scholar
  5. 5.
    Chan, H., Perrig, A., Song, D.: Random key predistribution schemes for sensor networks. In: Proceedings of IEEE Symposium on Research in Security and Privacy (2003)Google Scholar
  6. 6.
    Zhu, S., Xu, S., Setia, S., Jajodia, S.: Establishing pairwise keys for secure communication in ad hoc networks: a probabilistic approach. In: Proceedings of the 11th IEEE International Conference on Network Protocols, ICNP (2003)Google Scholar
  7. 7.
    Pietro, R.D., Mancini, L.V., Mei, A.: Random key assignment for secure wireless sensor networks. In: ACM Workshop on Security of Ad Hoc and Sensor Networks, George W. Johnson Center at George Mason University, Fairfax, VA, USA (2003)Google Scholar
  8. 8.
    Du, W., Deng, J., Han, Y.S., Chen, S., Varshney, P.K.: A key management scheme for wireless sensor networks using deployment knowledge. In: Proceedings of the IEEE INFOCOM (2004)Google Scholar
  9. 9.
    Du, W., Deng, J., Han, Y.S., Varshney, P.K.: A pairwise key pre-distribution scheme for wireless sensor networks. In: Proceedings of the 10th ACM Conference on Computer and Communications Security, CCS (2003)Google Scholar
  10. 10.
    Blom, R.: An optimal class of symmetric key generation systems. In: Beth, T., Cot, N., Ingemarsson, I. (eds.) EUROCRYPT 1984. LNCS, vol. 209, pp. 335–338. Springer, Heidelberg (1985)CrossRefGoogle Scholar
  11. 11.
    Spencer, J.: The Strange Logic of Random Graphs. In: Algorithms and Combinatorics 22, Springer-Verlag, Heidelberg (2000) ISBN: 3-540-41654-4Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Abhishek Gupta
    • 1
  • Joy Kuri
    • 1
  • Pavan Nuggehalli
    • 1
  1. 1.Centre for Electronics Design and TechnologyIndian Institute of ScienceBangalore

Personalised recommendations