KSII Transactions on Internet and Information Systems (TIIS)

Korean Society for Internet Information (한국인터넷정보학회)
권호 표지
DOI QR코드

DOI QR Code

Quorum-based Key Management Scheme in Wireless Sensor Networks

  • Wuu, Lih-Chyau (Graduate School of Computer Science and Information Engineering, National Yunlin Unviersity of Science and Technology) ;
  • Hung, Chi-Hsiang (Graduate School of Computer Science and Information Engineering, National Yunlin Unviersity of Science and Technology) ;
  • Chang, Chia-Ming (Graduate School of Computer Science and Information Engineering, National Yunlin Unviersity of Science and Technology)
  • Received : 2012.05.29
  • Accepted : 2012.08.17
  • Published : 2012.09.30
Download PDF
⟨ Previous Next ⟩

Abstract

To ensure the security of wireless sensor networks, it is important to have a robust key management scheme. In this paper, we propose a Quorum-based key management scheme. A specific sensor, called as key distribution server (KDS), generates a key matrix and establishes a quorum system from the key matrix. The quorum system is a set system of subsets that the intersection of any two subsets is non-empty. In our scheme, each sensor is assigned a subset of the quorum system as its pre-distributed keys. Whenever any two sensors need a shared key, they exchange their IDs, and then each sensor by itself finds a common key from its assigned subset. A shared key is then generated by the two sensors individually based on the common key. By our scheme, no key is needed to be refreshed as a sensor leaves the network. Upon a sensor joining the network, the KDS broadcasts a message containing the joining sensor ID. After receiving the broadcast message, each sensor updates the key which is in common with the new joining one. Only XOR and hash operations are required to be executed during key update process, and each sensor needs to update one key only. Furthermore, if multiple sensors would like to have a secure group communication, the KDS broadcasts a message containing the partial information of a group key, and then each sensor in the group by itself is able to restore the group key by using the secret sharing technique without cooperating with other sensors in the group.

Keywords

References

  1. David W. Carman, Peter S. Kruus and Brian J. Matt, "Constraints and approaches for distributed sensor network security," Network Associates Inc, 2000.
  2. Haowen Chan, Adrian Perrig and Dawn Song, "Random key predistribution schemes for sensor networks," in Proc. of the IEEE Symposium on Security and Privacy, pp.197-213, May.2003.
  3. Ni Chen, Jian-Bo Yao and Guang-Jun Wen, "An improved matrix key pre-distribution scheme for wireless sensor networks," in Proc. of the Int. Conf. on Embedded Software and Systems, pp.40-45, Jul.2008.
  4. Yi Cheng and Dharma P. Agrawal, "Efficient pairwise key establishment and management in static wireless sensor networks," in Proc. of IEEE Int. Conf. on Mobile Ad hoc and Sensor Systems, Nov.2005.
  5. Yi Cheng and Dharma P. Agrawal, "Improved pairwise key establishment for wireless sensor networks," in Proc. of IEEE Int. Conf. on Wireless and Mobile Computing, Networking and Communications, pp.442-448, Jun. 2006.
  6. Hung-Yu Chien, Rung-Ching Chen and Annie Shen, "Efficient key pre-distribution for sensor nodes with strong connectivity and low storage space," in Proc. of 22th Int. Conf. on Advanced Information Networking and Applications, pp.327-333, Mar.2008.
  7. Wenliang Du, Jing Deng, Yunghsiang S. Han, Pramod K. Varshney, Jonathan Katz and Aram Khalili, "A pairwise key predistribution scheme for wireless sensor networks," ACM Transactions on Information and System Security, vol.8, no.2, May.2005.
  8. Laurent Eschenauer and Virgil D. Gligor, "A key-management scheme for distributed sensor networks," In Proc. of the 9th ACM conf. on Computer and communications security, pp.41-47, Nov.2002.
  9. Donggang Liu, Peng Ning and Rongfang Li, "Establishing pairwise keys in distributed sensor networks," ACM Transactions on Information and System Security, vol.8, no.1, Feb.2005.
  10. Kui Ren, Kai Zeng and Wenjing Lou, "A new approach for random key pre-distribution in large-scale wireless sensor networks," Journal of Wireless Communications & Mobile Computing - Wireless Network security, vol.6, no.3, May.2006.
  11. Eric Ke Wang and Yunming Ye, "An efficient and secure key establishment scheme for wireless sensor network," in Proc. of the Third Int. Symposium on Intelligent Information Technology and Security Informatics, pp.511-516, Apr.2010.
  12. Li Xu and Jinbo Shen, "A novel key pre-distribution scheme using one-way hash chain and bivariate polynomial for wireless sensor networks," in Proc. of the 3rd Int. Conf. on Anti-counterfeiting, Security, and Identification in Communication, pp.575-580, Aug.2009.
  13. Rolf Blom, "An optimal class of symmetric key generation systems," in Proc. of the EUROCRYPT 84 workshop on Advances in cryptology: theory and application of cryptographic techniques, pp. 335-338, 1985.
  14. S.D. Lang and L.J. Mao, "A torus quorum protocol for distributed mutual exclusion," in Proc. of the 10th Int. Conf. on Parallel and Distributed Computing and Systems, 1998.
  15. Jehn-Ruey Jiang, Shing-Tsaan Huang and Yu-Chen Kuo, "Cohorts structures for fault-tolerant k entries to a critical section," IEEE Transactions on Computers, vol.46 no.2, Feb.1997.
  16. Mie Toyomura, Sayaka Kamei and Hirotsugu Kakugawa, "A quorum-based distributed algorithm for group mutual exclusion," in Proc. of the Fourth Int. Conf. on Parallel and Distributed Computing, Applications and Technologies, pp.742-746, Aug.2003.
  17. David Peleg and Avishai Wool, "The availability of crumbling wall quorum systems," Journal of Discrete Applied Mathematics, Vol. 74, No. 1, April 4, 1997.
  18. Adi Shamir, "How to share a secret," Communications of the ACM, vol.22, no.11. pp.612-613, Nov.1979. https://doi.org/10.1145/359168.359176