Skip to main content
SpringerLink
Log in

On the Applicability of Combinatorial Designs to Key Predistribution for Wireless Sensor Networks

  • Conference paper
Book cover Coding and Cryptology (IWCC 2009)

Part of the book series: Lecture Notes in Computer Science ((LNSC,volume 5557))

Included in the following conference series:

Abstract

The constraints of lightweight distributed computing environments such as wireless sensor networks lend themselves to the use of symmetric cryptography to provide security services. The lack of central infrastructure after deployment of such networks requires the necessary symmetric keys to be predistributed to participating nodes. The rich mathematical structure of combinatorial designs has resulted in the proposal of several key predistribution schemes for wireless sensor networks based on designs. We review and examine the appropriateness of combinatorial designs as a tool for building key predistribution schemes suitable for such environments.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Integrated smart sensing systems (2007), http://dpi.projectforum.com/isss/11

  2. Institut für Chemie und Dynamik der Geosphäre (ICG), Forschungszentrum Jülich: SoilNet - a Zigbee based soil moisture sensor network (2008), http://www.fz-juelich.de/icg/icg-4/index.php?index=739

  3. Blackburn, S.R., Etzion, T., Martin, K.M., Paterson, M.B.: Distinct-difference configurations: Multihop paths and key predistribution in sensor networks (2008), http://arxiv.org/abs/0811.3896

  4. Blackburn, S.R., Etzion, T., Martin, K.M., Paterson, M.B.: Efficient key predistribution for grid-based wireless sensor networks. In: Safavi-Naini, R. (ed.) ICITS 2008. LNCS, vol. 5155, pp. 54–69. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  5. 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)

    Chapter  Google Scholar 

  6. Blundo, C., Santis, A.D., Vaccaro, U., Herzberg, A., Kutten, S., Yung, M.: Perfectly secure key distribution for dynamic conferences. In: Brickell, E.F. (ed.) CRYPTO 1992. LNCS, vol. 740, pp. 471–486. Springer, Heidelberg (1993)

    Chapter  Google Scholar 

  7. Camtepe, S.A., Yener, B.: Combinatorial design of key distribution mechanisms for wireless sensor networks. In: Samarati, P., Ryan, P.Y.A., Gollmann, D., Molva, R. (eds.) ESORICS 2004. LNCS, vol. 3193, pp. 293–308. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  8. Camtepe, S.A., Yener, B.: Key distribution mechanisms for wireless sensor networks: a survey. Rensselaer Polytechnic Institute, Computer Science Department, Technical Report TR-05-07 (March 2005)

    Google Scholar 

  9. Chakrabarti, D., Maitra, S., Roy, B.: A key pre-distribution scheme for wireless sensor networks: merging blocks in combinatorial design. International Journal of Information Security 5(2)

    Google Scholar 

  10. Chakrabarti, D., Seberry, J.: Combinatorial structures for design of wireless sensor networks. In: Zhou, J., Yung, M., Bao, F. (eds.) ACNS 2006. LNCS, vol. 3989, pp. 365–374. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

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

    Google Scholar 

  12. Colbourn, C.J., Dinitz, J.H. (eds.): The CRC Handbook of Combinatorial Designs. CRC Press, Boca Raton (2007)

    MATH  Google Scholar 

  13. Eschenauer, L., Gligor, V.: A key management scheme for distributed sensor networks. In: Proceedings of 9th ACM Conference on Computer and Communication Security (November 2002)

    Google Scholar 

  14. 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)

    Google Scholar 

  15. Lee, J., Stinson, D.R.: A combinatorial approach to key predistribution for distributed sensor networks. In: IEEE Wireless Communications and Networking Conference, pp. 6–11, CD-ROM, paper PHY53-06 (2005), http://www.cacr.math.uwaterloo.ca/dstinson/pubs.html

  16. Lee, J., Stinson, D.R.: Deterministic key predistribution schemes for distributed sensor networks. In: Handschuh, H., Hasan, M.A. (eds.) SAC 2004. LNCS, vol. 3357, pp. 294–307. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  17. Lee, J., Stinson, D.R.: Common intersection designs. Journal of Combinatorial Designs 14(4), 251–269 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  18. Lopez, J.: Unleashing public-key cryptography in wireless sensor networks. Journal of Computer Security 14(5)

    Google Scholar 

  19. Martin, K.M.: The combinatorics of key establishment. In: Surveys in Combinatorics 2007. London Mathematical Society Lecture Note Series, vol. 346, pp. 223–273. Cambridge University Press, Cambridge (2007)

    Chapter  Google Scholar 

  20. Martin, K.M., Paterson, M.B.: An application-oriented framework for wireless sensor network key establishment. Electron. Notes Theor. Comput. Sci. 192(2), 31–41 (2008)

    Article  MATH  Google Scholar 

  21. Martin, K.M., Paterson, M.B., Stinson, D.R.: Key predistribution scheme for homogeneous wireless sensor networks with group deployment of nodes (2008), http://www.isg.rhul.ac.uk/~martin/files/gdfinal.pdf

  22. McCulloch, J., McCarthy, P., Guru, S.M., Peng, W., Hugo, D., Terhorst, A.: Wireless sensor network deployment for water use efficiency in irrigation. In: REALWSN 2008: Proceedings of the workshop on Real-world wireless sensor networks, pp. 46–50. ACM Press, New York (2008)

    Google Scholar 

  23. Mitchell, C.J., Piper, F.C.: The cost of reducing key storage requirements in secure networks. Computers and Security 6, 339–341 (1987)

    Article  Google Scholar 

  24. Mitchell, C.J., Piper, F.C.: Key storage in secure networks. Discrete Applied Mathematics 21, 215–228 (1988)

    Article  MathSciNet  MATH  Google Scholar 

  25. Park, E.C., Blake, I.F.: Reducing communication overhead of key distribution schemes for wireless sensor networks. In: Proceedings of ICCCN 2007, pp. 1345–1350. IEEE Press, Los Alamitos (2007)

    Google Scholar 

  26. Römer, K., Mattern, F.: The design space of wireless sensor networks. IEEE Wireless Communications Magazine 11(6), 54–61 (2004)

    Article  Google Scholar 

  27. Ruj, S., Roy, B.: Key predistribution using partially balanced designs in wireless sensor networks. In: Stojmenovic, I., Thulasiram, R.K., Yang, L.T., Jia, W., Guo, M., de Mello, R.F. (eds.) ISPA 2007. LNCS, vol. 4742, pp. 431–445. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  28. Stinson, D.R.: On some methods of unconditionally secure key distribution and broadcast encryption. Designs Codes and Cryptography 12, 215–243 (1997)

    Article  MathSciNet  MATH  Google Scholar 

  29. Stinson, D.R., Wei, R.: Generalized cover free families. Discrete Mathematics 279, 463–477 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  30. Wei, R., Wu, J.: Product construction of key distribution schemes for sensor networks. In: Handschuh, H., Hasan, M.A. (eds.) SAC 2004. LNCS, vol. 3357, pp. 280–293. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  31. Xiao, Y., Rayi, V.K., Sun, B., Du, X., Hu, F., Galloway, M.: A survey of key management schemes in wireless sensor networks. Comput. Commun. 30(11-12), 2314–2341 (2007)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Information Security Group, Royal Holloway, University of London, Egham, Surrey, TW20 0EX, U.K.

    Keith M. Martin

Authors
  1. Keith M. Martin
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. National Computer Systems, Center for Information Technology,, 73 Science Park Drive, S0511, Republic of Singapore

    Yeow Meng Chee  & San Ling  & 

  2. National University of Defense Technology, 411073, Changshu Hunan, China

    Chao Li

  3. National Computer Systems, Center for Information Technology, 73 Science Park Drive, S0511, Republic of Singapore

    Huaxiong Wang  & Chaoping Xing  & 

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Martin, K.M. (2009). On the Applicability of Combinatorial Designs to Key Predistribution for Wireless Sensor Networks. In: Chee, Y.M., Li, C., Ling, S., Wang, H., Xing, C. (eds) Coding and Cryptology. IWCC 2009. Lecture Notes in Computer Science, vol 5557. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-01877-0_12

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-01877-0_12

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-01813-8

  • Online ISBN: 978-3-642-01877-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation