Donggang Liu
Peng Ning
ABSTRACT
Pairwise key establishment is a fundamental security service in sensor networks; it enables sensor nodes to communicate securely with each other using cryptographic techniques. However, due to the resource constraints on sensors, it is infeasible to use traditional key management techniques such as public key cryptography and key distribution center (KDC). To facilitate the study of novel pairwise key predistribution techniques, this paper presents a general framework for establishing pairwise keys between sensors on the basis of a polynomial-based key predistribution protocol [2]. This paper then presents two efficient instantiations of the general framework: a random subset assignment key predistribution scheme and a grid-based key predistribution scheme. The analysis in this paper indicates that these two schemes have a number of nice properties, including high probability (or guarantee) to establish pairwise keys, tolerance of node captures, and low communication overhead. Finally, this paper presents a technique to reduce the computation at sensors required by these schemes.
- S. Basagni, K. Herrin, D. Bruschi, and E. Rosti. Secure pebblenets. In Proc. of ACM Int'l Symp. on Mobile ad hoc networking and computing, pages 156--163, 2001.]] Google Scholar
Digital Library
- C. Blundo, A. De Santis, A. Herzberg, S. Kutten, U. Vaccaro, and M. Yung. Perfectly-secure key distribution for dynamic conferences. In Advances in Cryptology -- CRYPTO '92, LNCS 740, pages 471--486, 1993.]] Google ScholarDigital Library
- D.W. Carman, P.S. Kruus, and B.J.Matt. Constrains and approaches for distributed sensor network security. Technical report, NAI Labs, 2000.]]Google Scholar
- H. Chan, A. Perrig, and D. Song. Random key predistribution schemes for sensor networks. In IEEE Symposium on Research in Security and Privacy, 2003.]] Google ScholarDigital Library
- L. Eschenauer and V. D. Gligor. A key-management scheme for distributed sensor networks. In Proc. of the 9th ACM Conf. on Computer and Communications Security, pages 41--47, November 2002.]] Google ScholarDigital Library
- O. Goldreich, S. Goldwasser, and S. Micali. How to construct random functions. J. of the ACM, 33(4):792--807, October 1986.]] Google ScholarDigital Library
- C. Karlof and D. Wagner. Secure routing in wireless sensor networks: Attacks and countermeasures. In First IEEE Int'l Workshop on Sensor Network Protocols and Applications, May 2003.]]Google Scholar
- D.E. Knuth. The Art of Computer Programming, volume Vol. 2: Seminumerical Algorithms. Addison-Wesley, third edition, 1997. ISBN: 0-201-89684-2.]] Google ScholarDigital Library
- D. Liu and P. Ning. Efficient distribution of key chain commitments for broadcast authentication in distributed sensor networks. In Proc. of the 10th Annual Network and Distributed System Security Symposium, pages 263--276, February 2003.]]Google Scholar
- A. Perrig, R. Canetti, D. Song, and D. Tygar. Efficient authentication and signing of multicast streams over lossy channels. In Proc. of IEEE Security and Privacy Symposium, May 2000.]] Google ScholarDigital Library
- A. Perrig, R. Canetti, D. Song, and D. Tygar. Efficient and secure source authentication for multicast. In Proc. of Network and Distributed System Security Symposium, February 2001.]]Google Scholar
- A. Perrig, R. Szewczyk, V. Wen, D. Culler, and J.D. Tygar. Spins: Security protocols for sensor networks. In Proc. of Seventh Annual Int'l Conf. on Mobile Computing and Networks, July 2001.]] Google ScholarDigital Library
- F. Stajano and R. Anderson. The resurrecting duckling: security issues for ad hoc networks. In Proc. of 7th Int'l Workshop on Security Protocols, pages 172--194, 1999.]] Google ScholarDigital Library
- W. Stallings. Cryptography and Network Security: Principles and Practice. Prentice Hall, 2nd edition, 1999.]] Google ScholarDigital Library
- D. Wong and A. Chan. Efficient and mutually authenticated key exchange for low power computing devices. In Proc. ASIACRYPT 2001., December 2001.]] Google ScholarDigital Library
- A. D. Wood and J. A. Stankovic. Denial of service in sensor networks. IEEE Computer, 35(10):54--62, October 2002.]] Google ScholarDigital Library
Index Terms
- Establishing pairwise keys in distributed sensor networks
Recommendations
A key-management scheme for distributed sensor networks
CCS '02: Proceedings of the 9th ACM conference on Computer and communications securityDistributed Sensor Networks (DSNs) are ad-hoc mobile networks that include sensor nodes with limited computation and communication capabilities. DSNs are dynamic in the sense that they allow addition and deletion of sensor nodes after deployment to grow ...
Establishing pairwise keys in distributed sensor networks
Pairwise key establishment is a fundamental security service in sensor networks; it enables sensor nodes to communicate securely with each other using cryptographic techniques. However, due to the resource constraints on sensor nodes, it is not feasible ...
Location-aware key management scheme for wireless sensor networks
SASN '04: Proceedings of the 2nd ACM workshop on Security of ad hoc and sensor networksSensor networks are composed of a large number of low power sensor devices. For secure communication among sensors, secret keys must be established between them. Recently, several pairwise key schemes have been proposed for large distributed sensor ...
Comments