Browse > Article

Key Pre-distribution using the Quorum System in Wireless Sensor Networks  

Kang Ji-Myung (서울대학교 전기.컴퓨터공학부)
Lee Sung-Ryeoll (서울대학교 전기.컴퓨터공학부)
Cho Seong-Ho (서울대학교 전기.컴퓨터공학부)
Kim Chong-Kwon (서울대학교 전기.컴퓨터공학부)
Ahn Joung-Chul (국가보안기술연구소 보안기술팀)
Abstract
The security feature is essential in wireless sensor network such as intrusion detection or obstacle observation. Sensor nodes must have shared secret between nodes to support security such as privacy. Many methods which provide key pre-distribution need too many keys or support poor security. To solve this problem, probabilistic key pre-distribution is proposed. This method needs a few keys and use probabilistic method to share keys. However, this method does not guarantee key sharing between nodes, and neighbor nodes nay not communicate each other. It leads to waste of network resource such as inefficient routing, extra routing protocol. In this paper, we propose new key distribution method using quorum system which needs a few keys and guarantee key sharing between nodes. We also propose extension of the method which needs fewer keys and guarantee key sharing when node deployment knowledge is well known.
Keywords
Wireless sensor network; Security; Symmetric key pre-distribution; Quorum system; Key pre-distribution using deployment knowledge;
Citations & Related Records
연도 인용수 순위
  • Reference
1 R. Blom, 'Non-Public Key Distribution,' in Advances in Cryptology - CRYPTO 1982, August 1982
2 W.Du, J, Deng, Y.S. Han, S. Chen, and P.K. Varshney, 'A key management scheme for wireless sensor networks using deployment knowledge,' in Proc. of IEEE INFOCOM, 2004   DOI
3 Laurent Eschenauer, 'A Key-Management Scheme for Distributed Sensor Networks,' ACM CCS 2002   DOI
4 J.Spence, 'The Strange Logic of Random Graphs, Algorithms and Combinatorics 22,' Springer-Verlag 2000
5 Haowen Chan,Adrian Perrig, Dawn Song, 'random key pre-distribution schemes for sensor networks,' IEEE symposium on Research in Security and Privacy, 2003
6 A. Perrig, R. Szewczyk, V. Wen, D. Cullar, and J. D. Tygar, 'Spins: Security protocols for sensor networks,' in Proceedings of the 7th Annual ACM/IEEE International Conference on Mobile Computing and Networking (MobiCom), Rome, Italy, July 2001, pp. 189-199
7 W.S. Luk and T.T. Wong, 'Two new quorum based algorithms for distributed mutual exclusion,' in Proc. of International Conference on Distributed Computing Systems, pp. 100-106, 1997   DOI
8 S. Zhu, S. Setia, and S. Jajodia, 'LEAP: Efficient Security Mechanisms for Large-Scale Distributed Sensor Networks,' in ACM Computer and Communications Security (CCS) 2003, October 2003   DOI
9 C.J. Colbourn, J.H. Dinitz and D.R. Stinson, 'quorum systems constructed from combinatorial designs,' Information and Computation, pp.160-173, 2001   DOI   ScienceOn
10 S.D. Lang and L.J. Mao, 'A torus quorum protocol for distributed mutual exclusion,' in Proc. of the 10th Internat. Conference on Parallel and Distributed Computing and Systems, pp. 635-638, 1998
11 M. Maekawa, 'A \surdN algorithm for mutual exclusion in decentralized systems,' ACM Transactions on Computer Systems, 145-159, 1985   DOI   ScienceOn
12 Y.C. Tseng, C.S. Hsu and T.Y. Hsieh, 'Power-saving protocols for IEEE 802.11-based multi-hop ad hoc networks,' in Proc. of IEEE INFOCOM, 2002   DOI
13 W. Diffie and M. E. Hellman, 'New directions in cryptography,' IEEE Transactions on Information Theory, vol. 22, pp. 44-654, November 1976   DOI
14 D. Liu and P. Ning, 'Establishing pairwise keys in distributed sensor networks,' in Proceedings of the 10th ACM Conference on Computer and Communications Security (CCS), Washington, DC, USA, October 27-31, 2003, pp. 52-61   DOI
15 R. L. Rivest, A. Shamir, and L. M. Adleman, 'A method for obtaining digital signatures and public-key cryptosystems,' ommunications of the ACM, vol. 21, no. 2, pp. 120-126, 1978   DOI   ScienceOn
16 W.Du, J. Deng, Y. S. Han, and P. K. Varshney, 'A pairwise key predistribution scheme for wireless sensor networks,' in Proceedings of the 10th ACM Conference on Computer and Communications Security (CCS), Washington, DC, USA, October 27-31 2003, pp. 42-51   DOI