Abstract
In this paper, we discuss the use of combinatorial set systems (combinatorial designs) in the design of key predistribution schemes (KPSs) for sensor networks. We show that the performance of a KPS can be improved by carefully choosing a certain class of set systems as “key ring spaces”. Especially, we analyze KPSs based on a type of combinatorial design known as a <it>transversal design</it>. We employ two types of transversal designs, which are represented by the set of all linear polynomials and the set of quadratic polynomials (over some finite field), respectively. These KPSs turn out to have significant efficiency in a shared-key discovery phase without degrading connectivity and resiliency.
- Blom, R. 1985. An optimal class of symmetric key generation systems. In <it>International Conference on the Theory and Applications of Cryptographic Techniques (EUROCRYPT'84) Proceedings</it>. Lecture Notes in Computer Science, vol. 209. Springer, 335--338. Google Scholar
Digital Library
- Blundo, C., Santis, A. D., Herzberg, A., Kutten, S., Vaccaro, U., and Yung, M. 1998. Perfectly secure key distribution for dynamic conferences. <it>Inform. Comput. 146</it>, 1--23. Google Scholar
Digital Library
- Carmen, D., Kruus, P., and Matt, B. 2000. Constraints and approaches for distributed sensor network security. Tech. rep. 00-010, NAI Labs.Google Scholar
- Çamtepe, S. and Yener, B. 2004. Combinatorial design of key distribution mechanisms for wireless sensor networks. In <it>ESORICS 2004 Proceedings</it>. Lecture Notes in Computer Science, vol. 3193. Springer, 293--308.Google Scholar
- Çamtepe, S. and Yener, B. 2007. Combinatorial design of key distribution mechanisms for wireless sensor networks. <it>IEEE/ACM Trans. Network. 15</it>, 346--358. Google Scholar
Digital Library
- Chakrabarti, D., Maitra, S., and Roy, B. 2005. A key pre-distribution scheme for wireless sensor networks: merging blocks in combinatorial design. In <it>ISC 2005 Proceedings.</it> Lecture Notes in Computer Science, vol. 3650. Springer, 89--103. Google Scholar
Digital Library
- Chan, H., Perrig, A., and Song, D. 2003. Random key predistribution schemes for sensor networks. In <it>Proceedings of the 2003 Symposium on Security and Privacy</it>. IEEE Computer Society, 197--213. Google Scholar
Digital Library
- Colbourn, C. and Dinitz, J., Eds. 2007. <it>The CRC Handbook of Combinatorial Designs</it>, 2nd Ed. CRC Press, Boca Raton.Google Scholar
- Du, W., Deng, J., Han, Y., Varshney, P., Katz, J., and Khalili, A. 2005. A pairwise key predistribution scheme for wireless sensor networks. <it>ACM Trans. Inform. Syst. Secur. 8</it>, 228--258. Google Scholar
Digital Library
- Eschenauer, L. and Gligor, V. 2002. A key-management scheme for distributed sensor networks. In <it>Proceedings of the 9th ACM Conference on Computer and Communications Security</it>. ACM Press, 41--47. Google Scholar
Digital Library
- Lee, J. and Stinson, D. 2005a. A combinatorial approach to key predistribution for distributed sensor networks. In <it>IEEE Wireless Communications and Networking Conference (WCNC'05)</it>. Vol. 2. IEEE Communications Society, 1200--1205.Google Scholar
- Lee, J. and Stinson, D. 2005b. Deterministic key predistribution schemes for distributed sensor networks. In <it>SAC 2004 Proceedings</it>. Lecture Notes in Computer Science, vol. 3357. Springer, 294--307. Google Scholar
Digital Library
- Lee, J. and Stinson, D. 2006a. Common intersection designs. <it>J. Combin. Designs 14</it>, 251--269.Google Scholar
- Lee, J. and Stinson, D. 2006b. Tree-based key distribution patterns. In <it>SAC 2005 Proceedings</it>. Lecture Notes in Computer Science, vol. 3897. Springer, 189--204. Google Scholar
Digital Library
- Leighton, T. and Micali, S. 1994. Secret-key agreement without public-key cryptography. In <it>CRYPTO 1993 Proceedings</it>. Lecture Notes in Computer Science, vol. 773. Springer, 456--479. Google Scholar
Digital Library
- Liu, D., Ning, P., and Li, R. 2005. Establishing pairwise keys in distributed sensor networks. <it>ACM Trans. Inform. Syst. Secur. 8</it>, 41--77. Google Scholar
Digital Library
- Ramkumar, M. and Memon, N. 2003. Pre-loaded key based multicast and broadcast authentication in mobile ad-hoc networks. In <it>IEEE GLOBECOM 2003</it>. IEEE Communications Society, 1405--1409.Google Scholar
- Ramkumar, M. and Memon, N. 2005. An efficient key predistribution scheme for ad hoc network security. <it>IEEE J. Select. Areas Comm. 23</it>, 611--621. Google Scholar
Digital Library
- Roman, R., Zhou, J., and Lopez, J. 2005. On the security of wireless sensor network. In <it>ICCSA 2005 Proceedings</it>. Lecture Notes in Computer Science, vol. 3482. Springer, 681--690. Google Scholar
Digital Library
- Stinson, D. 2003. <it>Combinatorial Designs: Constructions and Analysis</it>. Springer, Berlin, Germany. Google Scholar
Digital Library
- Wei, R. and Wu, J. 2005. Product construction of key distribution schemes for sensor networks. In <it>SAC 2004 Proceedings</it>. Lecture Notes in Computer Science, vol. 3357. Springer, 280--293. Google Scholar
Digital Library
Index Terms
On the Construction of Practical Key Predistribution Schemes for Distributed Sensor Networks Using Combinatorial Designs
Recommendations
Key Predistribution Scheme for Clustered Hierarchical Wireless Sensor Networks based on Combinatorial Designs
Combinatorial designs are powerful mathematical tools with comprehensive and simple algebraic structures. Recently, many researchers have used combinatorial designs as key predistribution schemes in wireless sensor networks WSNs. Previous studies on ...
Group-based key predistribution for wireless sensor networks
Many key predistribution techniques have been developed recently to establish pairwise keys between sensor nodes in wireless sensor networks. To further improve these schemes, researchers have also proposed to take advantage of the sensors' expected ...
A pairwise key predistribution scheme for wireless sensor networks
To achieve security in wireless sensor networks, it is important to be able to encrypt and authenticate messages sent between sensor nodes. Before doing so, keys for performing encryption and authentication must be agreed upon by the communicating ...








Comments