Skip to main content
Log in

Re-keying analysis in group key management of wireless sensor networks

  • Research
  • Published:
Cryptography and Communications Aims and scope Submit manuscript

Abstract

The exclusion basis system is a combinatorial formulation of group key management that provides long-term and flexible protection for wireless sensor networks while allowing for reasonable adjustment of the number of keys per node and the number of re-key messages. In this paper, we extend the work of Karst and Wicker to near-resolvable design, symmetric balanced incomplete block designs, and balanced incomplete block designs with the repetition count of a distinct pair of elements equal to one, and it is observed that near-resolvable design provides minimal re-keying compared to symmetric balanced incomplete block designs and balanced incomplete block designs. Also, near-resolvable design and exclusion basis system have the same re-keying size when the number of keys is \(n-1\).

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

Access this article

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

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

Instant access to the full article PDF.

References

  1. Abel, R. Julian R., Gennian G., Jianxing Y.: Resolvable and near-resolvable designs. In: Handbook of Combinatorial Designs. pp. 150-158. Chapman and Hall/CRC, (2006)

  2. Bose, R.C.: On the construction of balanced incomplete block designs. Ann. Eugen. 9(4), 353–399 (1939)

    Article  MathSciNet  Google Scholar 

  3. Bose, R.C.: On some new series of balanced incomplete block designs. Bull. Calcutta Math. Soc 34, 17–31 (1942)

    MathSciNet  Google Scholar 

  4. Camtepe, Seyit A.: Bülent Y.: Combinatorial design of key distribution mechanisms for wireless sensor networks. In: Computer Security-ESORICS 2004: 9th European Symposium on Research in Computer Security, Sophia Antipolis, France, September 13–15, 2004. Proceedings 9, pp. 293–308. Springer, Berlin Heidelberg (2004)

  5. Camtepe, S.A., Blent, Y.: Combinatorial design of key distribution mechanisms for wireless sensor networks. IEEE/ACM Trans. Networking 15(2), 346–358 (2007)

    Article  Google Scholar 

  6. Chen, C., Huang, Z., Wen, Q., Fan, Y.: A novel dynamic key management scheme for wireless sensor networks. 4th IEEE International Conference on Broadband Network and Multimedia Technology (pp. 549-552), (2011, October)

  7. Chakrabarti, D., Maitra, S., Roy, B.: A key pre-distribution scheme for wireless sensor networks: merging blocks in combinatorial design. Int. J. Inf. Secur. 5, 105–114 (2006)

    Article  Google Scholar 

  8. Colbourn, C.J.: CRC handbook of combinatorial designs (pp. 124-132). CRC press (2010)

  9. Craigen, R., Kharaghani, H.: Hadamard matrices and Hadamard designs. In: Handbook of combinatorial designs (pp. 299-305). Chapman and Hall/CRC (2006)

  10. Durisic, M.P., Tafa, Z., Dimic, G., Milutinovic, V.: A survey of military applications of wireless sensor networks. IEEE Mediterranean conference on embedded computing (MECO). (pp. 196–199) (2012, June)

  11. Eltoweissy, M., John, B.: A framework for scalable multicast security with Bell-LaPadua confidentiality model. J. Internet Technol. 3(3), 201–212 (2002)

    Google Scholar 

  12. Eltoweissy, M., Hossain, M.H., Linda, M., Hal, I.S.: Combinatorial optimization of group key management. J. Netw. Syst. Manag. 12, 33–50 (2004)

    Article  Google Scholar 

  13. Eltoweissy, M., Wadaa, A., Olariu, S., Wilson, L.: Group key management scheme for large-scale sensor networks. Ad Hoc Netw. 3(5), 668–688 (2005)

    Article  Google Scholar 

  14. Eltoweissy, M., Moharrum, M., Mukkamala, R.: Dynamic key management in sensor networks. IEEE Commun. Mag. 44(4), 122–130 (2006)

    Article  Google Scholar 

  15. Fisher, R.A.: An examination of the different possible solutions of a problem in incomplete blocks. 174 (1940)

  16. Huang, Y.M., Hsieh, M.Y., Chao, H.C., Hung, S.H., Park, J.H.: Pervasive, secure access to a hierarchical sensor-based healthcare monitoring architecture in wireless heterogeneous networks. IEEE J. Sel. Areas Commun. 27(4), 400–411 (2009)

    Article  Google Scholar 

  17. Karst, N.J., Wicker, S.B.: Secure re-keying and collusion prevention using block designs. IEEE Trans. Netw. (2010)

  18. Karst, N.J., Wicker, S.B.: On the re-keying load in group key distributions using cover-free families. IEEE Trans. Inf. Theory 58(10), 6667–6671 (2012)

    Article  Google Scholar 

  19. Kageyama, S.: An improved inequality for balanced incomplete block designs. Ann. Math. Stat. 42(4), 1448–1449 (1971)

    Article  Google Scholar 

  20. Khabiri, E., Bettayeb, S.: Efficient algorithms for secure multicast key management. In: Proceedings. 31st IEEE Conference on Local Computer Networks. pp. 787–792 (2006, November)

  21. Khanafer, M., Guennoun, M., Mouftah, H.T.: WSN architectures for intelligent transportation systems. IEEE 3rd International Conference on New Technologies, Mobility and Security. pp. 1-8, (2009, December)

  22. Lee, J., Stinson, D.R.: A combinatorial approach to key pre-distribution for distributed sensor networks. In: IEEE Wireless Communications and Networking Conference. Vol. 2, pp. 1200-1205 (2005, March)

  23. Lee, J., Stinson, D.R.: On the construction of practical key pre-distribution schemes for distributed sensor networks using combinatorial designs. ACM Trans. Inf. Syst. Secur. (TISSEC) 11(2), 1–35 (2008)

    Article  Google Scholar 

  24. Liu, Y.Y., Yu, X.F., Zhao, D.: Hardware design of an environmental monitoring system based on wireless sensor networks. In: Advanced materials research, Trans Tech Publications Ltd. Vol. 864, pp. 891-896 (2014)

  25. Moharrum, M., Mukkamala, R., Eltoweissy, M.: TKGS: verifiable threshold-based key generation scheme in open wireless ad hoc networks. In: Proceedings. 13th International Conference on Computer Communications and Networks. IEEE Cat. No. 04EX969, pp. 31–36(2004, October)

  26. Moharrum, M.A., Eltoweissy, M.: A study of static versus dynamic keying schemes in sensor networks. In: Proceedings of the 2nd ACM international workshop on Performance evaluation of wireless ad hoc, sensor, and ubiquitous networks. pp. 122–129 (2005)

  27. Redwine, S.T.: A logic for the exclusion basis system. IEEE 37th Annual Hawaii International Conference on System Sciences. Proceedings of the pp. 6-pp (2004, January).

  28. Ruj, S., Nayak, A., Stojmenovic, I.: Fully secure pairwise and triple key distribution in wireless sensor networks using combinatorial designs. Proceedings IEEE INFOCOM, pp. 326-330 (2011, April)

  29. Stinson, D.R.: Combinatorial Designs: Constructions and Analysis, vol. 480. Springer, New York (2004)

    Google Scholar 

  30. Tie, L., Li, J.: Combinatorial optimization for wireless sensor networks. In: Proceedings of IEEE International Workshop on VLSI Design and Video Technology. pp. 439-442(2005, May)

  31. Wang, Y., Attebury, G., Ramamurthy, B.: Security in Wireless Sensor Networks. Auerbach Publications, CRC Press (2008)

    Google Scholar 

  32. Wong, C.K., Gouda, M., Lam, S.S.: Secure group communications using key graphs. IEEE/ACM Trans. Netw. 8(1), 16–30 (2000)

    Article  Google Scholar 

  33. Yates, F.: Incomplete randomized blocks. Ann. Eugen. 7(2), 121–140 (1936)

    Article  Google Scholar 

  34. Younis, M.F., Ghumman, K., Eltoweissy, M.: Location-aware combinatorial key management scheme for clustered sensor networks. IEEE Trans. Parallel Distrib. Syst. 17(8), 865–882 (2006)

    Article  Google Scholar 

  35. Zhan, F., Yao, N.: A collusion-resistant dynamic key management scheme for WSNs. Secur. Commun. Netw. 9(18), 6351–6364 (2016)

    Article  Google Scholar 

  36. Zhang, J., Varadharajan, V.: Wireless sensor network key management survey and taxonomy. J. Netw. Comput. Appl. 33(2), 63–75 (2010)

    Article  Google Scholar 

  37. Zhu, S., Setia, S., Jajodia, S.: Performance optimizations for group key management schemes. In: 23rd International Conference on Distributed Computing Systems, IEEE. Proceedings. pp. 163–171 (2003, May)

Download references

Author information

Authors and Affiliations

Authors

Contributions

1.2. conceived of the presented idea and 1. wrote the main manuscript text with support from 2. All authors reviewed the manuscript.

Corresponding author

Correspondence to Karam Ratan Singh.

Ethics declarations

Competing interests

The authors declare no competing interests.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Kumari, P., Singh, K.R. Re-keying analysis in group key management of wireless sensor networks. Cryptogr. Commun. 16, 665–677 (2024). https://doi.org/10.1007/s12095-023-00693-9

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s12095-023-00693-9

Keywords

Mathematics Subject Classification (2010)