Donggang Liu
Peng Ning
ABSTRACT
Sensor networks are ideal candidates for applications such as target tracking and environment monitoring. Security in sensor networks is critical when there are potential adversaries. Establishment of pairwise keys is a fundamental security service, which forms the basis of other security services such as authentication and encryption. However, establishing pairwise keys in sensor networks is not a trivial task, particularly due to the resource constraints on sensors. This paper presents several techniques for establishing pairwise keys in static sensor networks. These techniques take advantage of the observation that in static sensor networks, although it is difficult to precisely pinpoint sensors' positions, it is often possible to approximately determine their locations. This paper presents a simple location-aware deployment model, and develops two pairwise key predistribution schemes, a closest pairwise keys predistribution scheme and a location-based pairwise keys scheme using bivariate polynomials, by taking advantage of sensors' expected locations. The analysis in this paper indicates that these schemes can achieve better performance if such location information is available and that the smaller the deployment error (i.e., the difference between a sensor's actual location and its expected location) is, the better performance they can achieve.
- S. Basagni, K. Herrin, D. Bruschi, and E. Rosti. Secure pebblenets. In Proceedings of ACM International Symposium on Mobile ad hoc networking and computing, pages 156--163, 2001.]] Google Scholar
Digital Library
- C. Blundo, A. De Santis, Amir 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 Scholar
- S. Buchegger and J. L. Boudec. Performance analysis of the CONFIDANT protocol (cooperation of nodes: Fairness in dynamic ad-hoc networks). In Proceedings of The Third ACM International Symposium on Mobile Ad Hoc Networking and Computing, pages 226--236, June 2002.]] 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 Proceedings of the 9th ACM Conference 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. Journal of the ACM, 33(4):792--807, October 1986.]] Google ScholarDigital Library
- C. Karlof and David Wagner. Secure routing in wireless sensor networks: Attacks and countermeasures. In First IEEE International Workshop on Sensor Network Protocols and Applications, May 2003.]]Google ScholarCross Ref
- D. Liu and P. Ning. Efficient distribution of key chain commitments for broadcast authentication in distributed sensor networks. In Proceedings of the 10th Annual Network and Distributed System Security Symposium, pages 263--276, February 2003.]]Google Scholar
- D. Liu and P. Ning. Establishing pairwise keys in distributed sensor networks. In 10th ACM Conference on Computer and Communications Security, October 2003.]] Google ScholarDigital Library
- C. Lu, B. Blum, T. Abdelzaher, J. Stankovic, and T. He. Rap: A real-time communication architecture for large-scale wireless sensor networks. In The 8th IEEE Real-Time and Embedded Technology and Applications Symposium, San Jose, California, September 2002.]] Google ScholarDigital Library
- S. Marti, T. J. Giuli, K. Lai, and M. Baker. Mitigating routing misbehavior in mobile ad hoc networks. In Proceedings of the Sixth annual ACM/IEEE International Conference on Mobile Computing and Networking, pages 255--265, 2000.]] Google ScholarDigital Library
- 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 Proceedings of Network and Distributed System Security Symposium, February 2001.]]Google Scholar
- A. Perrig, R. Canetti, D. Song, and D. Tygar. The tesla broadcast authentication protocol. In RSA Cryptobytes, 2002.]]Google Scholar
- A. Perrig, R. Szewczyk, V. Wen, D. Culler, and J. D. Tygar. Spins: Security protocols for sensor networks. In Proceedings of Seventh Annual International Conference 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 Security Protocols: 7th International Workshop, pages 172--194, 1999.]] Google ScholarDigital Library
- D. Wong and A. Chan. Efficient and mutually authenticated key exchange for low power computing devices. In Proc. ASIACRYPT 2001., Dec 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
- Y. Zhang and W. Lee. Intrusion detection in wireless ad hoc networks. In Proceedings of the 6th International Conference on Mobile Computing and Networking (MobiCom 2000), pages 275--283, August 2000.]] Google ScholarDigital Library
Index Terms
- Location-based pairwise key establishments for static sensor networks
Recommendations
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 ...
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 ...
Comments