Skip to main content
SpringerLink
Log in

Tree-based key predistribution for wireless sensor networks

  • Published:
Wireless Networks Aims and scope Submit manuscript

Abstract

The establishment of secure links between neighboring nodes is one of the most challenging problems in wireless sensor networks. In this article, we present an efficient key predistribution scheme for sensor networks such that pairwise keys are defined by iterated hash computations based on a tree structure. Our scheme can be regarded as an improvement of HARPS, Ramkumar and Memon (IEEE J Sel Area Commun 23(3):611–621, 2005),or a generalization of Leighton and Micali’s scheme (Lect Notes Comput Sci 773:456–479, 1994). We rigorously analyze our scheme focusing on the resiliency of the network and hash computational complexity for each node and compare the performance with existing schemes. Specifically, we show that our scheme provides stronger resiliency and requires less hash computational complexity than HARPS.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6

Similar content being viewed by others

References

  1. Blom, R. (1985). An optimal class of symmetric key generation systems. Lecture Notes in Computer Science, 209, 335–338. (Advances in Cryptology—EUROCRYPT ’84).

    Article  Google Scholar 

  2. Blundo, C., De Santis, A., Herzberg, A., Kutten, S., Vaccaro, U., & Yung, M. (1993). Perfectly-secure key distribution for dynamic conferences. Lecture Notes in Computer Science, 740, 471–486. (Advances in Cryptology—CRYPTO ’92).

    Article  Google Scholar 

  3. Çamtepe, S. A., & Yener, B. (2004). Combinatorial design of key distribution mechanisms for wireless sensor networks. Lecture Notes in Computer Science, 3193, 293–308. (ESORICS 2004 Proceedings).

    Article  Google Scholar 

  4. Carmen, D. W., Kruus, P. S., & Matt, B. J. (2000). Constraints and approaches for distributed sensor network security. NAI Labs Technical Report #00-010, September 2000.

  5. Chan, H., Perrig, A., & Song, D. (2003). Random key predistribution schemes for sensor networks. In IEEE Symposium on Research in Security and Privacy, May 2003 (pp. 197–213).

  6. Delgosha, F., & Fekri, F. (2006). Threshold key-establishment in distributed sensor networks using a multivariate scheme. In Proceedings of the 25th IEEE International Conference on Computer Communications, April 2006.

  7. Du, W., Deng, J., Han, Y. S., Chan, S., & Varsheney, P. K. (2004). A key management scheme for wireless sensor networks using deployment knowledge. In Proceedings of the 23th IEEE International Conference on Computer Communications, March 2004.

  8. Du, W., Deng, J., Han, Y. S., & Varsheney, P. K. (2003). A pairwise key pre-distribution scheme for wireless sensor networks. In Proceedings of the 10th ACM Conference on Computer and Communications Security, October (pp. 42–51).

  9. Eschenauer, L., & Gligor, V. D. (2002). A key-management scheme for distributed sensor networks. In Proceedings of the 9th ACM Conference on Computer and Communications Security, November 2002 (pp. 41–47).

  10. Huang, D., Mehta, M., Medhi, D., & Harn, L. (2004). Location-aware key management scheme for wireless sensor networks. In Proceedings of the 2nd ACM Workshop on Security of Ad Hoc and Sensor Networks, October 2004 (pp. 29–42).

  11. Ito, T., Ohta, H., Matsuda, N., & Yoneda, T. (2005). A key pre-distribution scheme for secure sensor networks using probability density function of node deployment. In Proceedings of the 3nd ACM Workshop on Security of Ad Hoc and Sensor Networks, November 2005 (pp. 69–75).

  12. Lee, J., & Stinson, D. R. On the construction of practical key predistribution schemes for distributed sensor networks using combinatorial designs. ACM Transactions on Information and System Security, 11(2), Article 5.

  13. Lee, J., & Stinson, D. R. (2004). Deterministic key predistribution schemes for distributed sensor networks. Lecture Notes in Computer Science, 3357, 294–307. (SAC 2004 Proceedings).

    MathSciNet  Google Scholar 

  14. Lee, J., & Stinson, D. R. (2005). Tree-based key distribution patterns. Lecture Notes in Computer Science, 3897, 189–204. (SAC 2005 Proceedings).

    Article  MathSciNet  Google Scholar 

  15. Leighton, T., & Micali, S. (1994). Secret-key agreement without public-key cryptography. Lecture Notes in Computer Science, 773, 456–479. (Advances in Cryptology—CRYPTO ’93).

    Article  Google Scholar 

  16. Liu, D., & Ning, P. (2003). Establishing pairwise keys in distributed sensor networks. In Proceedings of the 10th ACM Conference on Computer and Communications Security, October 2003 (pp. 52–61).

  17. Liu, D., & Ning, P. (2003). Location-based pairwise key establishments for static sensor networks. In Proceedings of the 1st ACM Workshop on Security of Ad Hoc and Sensor Networks, October 2003 (pp. 72–82).

  18. Martin, K. M., & Paterson, M. An application-oriented framework for wireless sensor network key establishment. To appear in Electronic Notes in Theoretical Computer Science.

  19. Ramkumar, M. (2006). I-HARPS: An efficient key predistribution scheme for mobile computing applications. In Proceedings of IEEE Globecom ’06, November 2006.

  20. Ramkumar, M., & Memon, N. (2005). An efficient key predistribution scheme for ad hoc network security. IEEE Journal on Selected Areas in Communications, 23(3), 611–621.

    Article  Google Scholar 

  21. Roman, R., Zhou, J., & Lopez, J. (2005). On the security of wireless sensor network. Lecture Notes in Computer Science, 3482, 681–690. (ICCSA 2005 Proceedings).

    Article  Google Scholar 

  22. Sanchez, D. S., & Baldus, H. (2005). A deterministic pairwise key pre-distribution scheme for mobile sensor networks. In Proceedings of the 1st IEEE/CreateNet International Conference on Security and Privacy for Emerging Areas in Communication Networks, September 2005 (pp. 277–288).

  23. Traynor, P., Kumar, R., Choi, H., Cao, G., Zhu, S., & La Porta, T. (2006). Efficient hybrid security mechanisms for heterogeneous sensor networks. IEEE Transactions on Mobile Computing, 6(6), 663–677.

    Article  Google Scholar 

  24. Wei, R., & Wu, J. (2004). Product construction of key distribution schemes for sensor networks. Lecture Notes in Computer Science, 3357, 280–293. (SAC 2004 Proceedings).

    Article  MathSciNet  Google Scholar 

  25. Xiao, Y., Rayi, V. K., Sun, B., Du, X., Hu, F., & Galloway, M. (2007). A survey of key management schemes in wireless sensor networks. Computer Communications, 30(11–12), 2314–2341.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. The Attached Institute of Electronics and Telecommunications Research Institute, P.O. Box 1, Yuseong-gu, Daejeon, 305-600, Korea

    Jooyoung Lee & Daesung Kwon

Authors
  1. Jooyoung Lee
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Daesung Kwon
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Jooyoung Lee.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Lee, J., Kwon, D. Tree-based key predistribution for wireless sensor networks. Wireless Netw 15, 1140–1151 (2009). https://doi.org/10.1007/s11276-008-0108-3

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11276-008-0108-3

Keywords

Search

Navigation