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 sensor nodes, it is not feasible to use traditional key management techniques such as public key cryptography and key distribution center (KDC). A number of key predistribution techniques have been proposed for pairwise key establishment in sensor networks recently. To facilitate the study of novel pairwise key predistribution techniques, this paper develops a general framework for establishing pairwise keys between sensor nodes using bivariate polynomials. This paper then proposes two efficient instantiations of the general framework: a random subset assignment key predistribution scheme, and a hypercube-based key predistribution scheme. The analysis shows that both schemes have a number of nice properties, including high probability, or guarantee to establish pairwise keys, tolerance of node captures, and low storage, communication, and computation overhead. To further reduce the computation at sensor nodes, this paper presents an optimization technique for polynomial evaluation, which is used to compute pairwise keys. This paper also reports the implementation and the performance of the proposed schemes on MICA2 motes running TinyOS, an operating system for networked sensors. The results indicate that the proposed techniques can be applied efficiently in resource-constrained sensor networks.
- Basagni, S., Herrin, K., Bruschi, D., and Rosti,E. 2001. Secure pebblenets. In Proceedings of ACM International Symposium on Mobile Ad Hoc Networking and Computing. 156--163.]] Google Scholar
- Blundo, C., De Santis, A., Herzberg, A., Kutten, S., Vaccaro, U., and Yung, M. 1993. Perfectly-secure key distribution for dynamic conferences. In Advances in Cryptology---CRYPTO '92. Lecture Notes in Computer Science, vol. 740, Springer-Verlag, Berlin, 471--486.]] Google Scholar
- Carman, D., Kruus, P., and B. J., Matt. 2000. Constrains and Approaches for Distributed Sensor Network Security. Tech. rep., NAI Labs.]]Google Scholar
- Chan, H., Perrig, A., and Song, D. 2003. Random key predistribution schemes for sensor networks. In IEEE Symposium on Research in Security and Privacy. 197--213.]] Google ScholarDigital Library
- Crossbow Technology Inc.2004. Wireless sensor networks. http://www.xbow.com/Products/Wireless_Sensor_Networks.htm. Accessed in February 2004.]]Google Scholar
- Deng, J., Han, R., and Mishra, S. 2003. Security support for in-network processing in wireless sensor networks. In 2003 ACM Workshop on Security in Ad Hoc and Sensor Networks (SASN '03).]] Google Scholar
- Du, W., Deng, J., Han, Y. S., Chen, S., and Varshney, P. 2004. A key management scheme for wireless sensor networks using deployment knowledge. In Proceedings of IEEE INFOCOM'04.]]Google Scholar
- Du, W., Deng, J., Han, Y. S., and Varshney, P. 2003. A pairwise key pre-distribution scheme for wireless sensor networks. In Proceedings of 10th ACM Conference on Computer and Communications Security (CCS'03). 42--51.]] Google Scholar
- Eschenauer, L. and Gligor, V. D. 2002. A key-management scheme for distributed sensor networks. In Proceedings of the 9th ACM Conference on Computer and Communications Security. 41--47.]] Google Scholar
- Gay, D., Levis, P., von Behren, R., Welsh, M., Brewer, E., and Culler, D. 2003. The nesC language: A holistic approach to networked embedded systems. In Proceedings of Programming Language Design and Implementation (PLDI 2003).]] Google Scholar
- Goldreich, O., Goldwasser, S., and Micali, S. 1986. How to construct random functions. J. ACM 33, 4 (Oct.), 792--807.]] Google ScholarDigital Library
- Hill, J., Szewczyk, R., Woo, A., Hollar, S., Culler, D., and Pister, K. S. J. 2000. System architecture directions for networked sensors. In Architectural Support for Programming Languages and Operating Systems. 93--104.]] Google Scholar
- Hu, L. and Evans, D. 2003a. Secure aggregation for wireless networks. In Workshop on Security and Assurance in Ad Hoc Networks.]] Google Scholar
- Hu, L. and Evans, D. 2003b. Using directional antennas to prevent wormhole attacks. In Proceedings of the 11th Network and Distributed System Security Symposium. 131--141.]]Google Scholar
- Karlof, C. and Wagner, D. 2003. Secure routing in wireless sensor networks: Attacks and countermeasures. In Proceedings of 1st IEEE International Workshop on Sensor Network Protocols and Applications.]]Google Scholar
- Knuth, D. 1997. The Art of Computer Programming, 3rd ed. Vol. 2: Seminumerical Algorithms. Addison-Wesley. Reading, MA.]] Google ScholarDigital Library
- Liu, D. and Ning, P. 2003a. 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. 263--276.]]Google Scholar
- Liu, D. and Ning, P. 2003b. Establishing pairwise keys in distributed sensor networks. In Proceedings of 10th ACM Conference on Computer and Communications Security (CCS'03). 52--61.]] Google Scholar
- Liu, D. and Ning, P. 2003c. Location-based pairwise key establishments for static sensor networks. In 2003 ACM Workshop on Security in Ad Hoc and Sensor Networks (SASN '03). 720082.]] Google Scholar
- Newsome, J., Shi, R., Song, D., and Perrig, A. 2004. The sybil attack in sensor networks: Analysis and defenses. In Proceedings of IEEE International Conference on Information Processing in Sensor Networks (IPSN 2004).]] Google Scholar
- NIST. 1998. Skipjack and KEA algorithm specifications. http://csrc.nist.gov/encryption/skipjack/skipjack.pdf.]]Google Scholar
- Perrig, A., Canetti, R., Song, D., and Tygar, D. 2000. Efficient authentication and signing of multicast streams over lossy channels. In Proceedings of the 2000 IEEE Symposium on Security and Privacy.]] Google Scholar
- Perrig, A., Canetti, R., Song, D., and Tygar, D. 2001a. Efficient and secure source authentication for multicast. In Proceedings of Network and Distributed System Security Symposium.]]Google Scholar
- Perrig, A., Szewczyk, R., Wen, V., Culler, D., and Tygar, D. 2001b. SPINS: Security protocols for sensor networks. In Proceedings of 7th Annual International Conference on Mobile Computing and Networks.]] Google Scholar
- Pietro, R. D., Mancini, L. V., and Mei, A. 2003. Random key assignment for secure wireless sensor networks. In 2003 ACM Workshop on Security in Ad Hoc and Sensor Networks (SASN '03).]] Google Scholar
- Przydatek, B., Song, D., and Perrig, A. 2003. SIA: Secure information aggregation in sensor networks. In Proceedings of the First ACM Conference on Embedded Networked Sensor Systems (SenSys '03).]] Google Scholar
- Rivest, R. 1994. The RC5 encryption algorithm. In Proceedings of the 1st International Workshop on Fast Software Encryption, vol. 809, 86--96.]]Google Scholar
- Sastry, N., Shankar, U., and Wagner, D. 2003. Secure verification of location claims. In ACM Workshop on Wireless Security.]] Google Scholar
- Stajano, F. and Anderson, R. 1999. The resurrecting duckling: Security issues for ad hoc networks. In Proceedings of the 7th International Workshop on Security Protocols. 172--194.]] Google ScholarDigital Library
- Stallings, W. 1999. Cryptography and Network Security: Principles and Practice, 2nd ed. Prentice-Hall, Englewood Cliffs, NJ.]] Google Scholar
- Wong, D. and Chan, A. 2001. Efficient and mutually authenticated key exchange for low power computing devices. In Proceedings of ASIA CRYPT 2001.]] Google Scholar
- Wood, A. D. and Stankovic, J. A. 2002. Denial of service in sensor networks. IEEE Comput. 35, 10, 54--62.]] Google ScholarDigital Library
- Zhu, S., Setia, S., and Jajodia, S. 2003. LEAP: Efficient security mechanisms for large-scale distributed sensor networks. In Proceedings of 10th ACM Conference on Computer and Communications Security (CCS'03). 62--72.]] Google Scholar
- Zhu, S., Setia, S., Jajodia, S., and Ning, P. 2004. An interleaved hop-by-hop authentication scheme for filtering false data in sensor networks. In Proceedings of 2004 IEEE Symposium on Security and Privacy.]]Google Scholar
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
CCS '03: Proceedings of the 10th ACM conference on Computer and communications securityPairwise 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 ...
Group-based key pre-distribution in wireless sensor networks
WiSe '05: Proceedings of the 4th ACM workshop on Wireless securityMany key pre-distribution techniques have been developed recently to establish pairwise keys for wireless sensor networks. To further improve these schemes, researchers have proposed to take advantage of sensors' expected locations to help pre-...
Comments