skip to main content
research-article

On the Construction of Practical Key Predistribution Schemes for Distributed Sensor Networks Using Combinatorial Designs

Published:01 May 2008Publication History
Skip Abstract Section

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.

References

  1. Blom, R. 1985. An optimal class of symmetric key generation systems. In &lt;it&gt;International Conference on the Theory and Applications of Cryptographic Techniques (EUROCRYPT'84) Proceedings&lt;/it&gt;. Lecture Notes in Computer Science, vol. 209. Springer, 335--338. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. Blundo, C., Santis, A. D., Herzberg, A., Kutten, S., Vaccaro, U., and Yung, M. 1998. Perfectly secure key distribution for dynamic conferences. &lt;it&gt;Inform. Comput. 146&lt;/it&gt;, 1--23. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. Carmen, D., Kruus, P., and Matt, B. 2000. Constraints and approaches for distributed sensor network security. Tech. rep. 00-010, NAI Labs.Google ScholarGoogle Scholar
  4. Çamtepe, S. and Yener, B. 2004. Combinatorial design of key distribution mechanisms for wireless sensor networks. In &lt;it&gt;ESORICS 2004 Proceedings&lt;/it&gt;. Lecture Notes in Computer Science, vol. 3193. Springer, 293--308.Google ScholarGoogle Scholar
  5. Çamtepe, S. and Yener, B. 2007. Combinatorial design of key distribution mechanisms for wireless sensor networks. &lt;it&gt;IEEE/ACM Trans. Network. 15&lt;/it&gt;, 346--358. Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. Chakrabarti, D., Maitra, S., and Roy, B. 2005. A key pre-distribution scheme for wireless sensor networks: merging blocks in combinatorial design. In &lt;it&gt;ISC 2005 Proceedings.&lt;/it&gt; Lecture Notes in Computer Science, vol. 3650. Springer, 89--103. Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. Chan, H., Perrig, A., and Song, D. 2003. Random key predistribution schemes for sensor networks. In &lt;it&gt;Proceedings of the 2003 Symposium on Security and Privacy&lt;/it&gt;. IEEE Computer Society, 197--213. Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. Colbourn, C. and Dinitz, J., Eds. 2007. &lt;it&gt;The CRC Handbook of Combinatorial Designs&lt;/it&gt;, 2nd Ed. CRC Press, Boca Raton.Google ScholarGoogle Scholar
  9. Du, W., Deng, J., Han, Y., Varshney, P., Katz, J., and Khalili, A. 2005. A pairwise key predistribution scheme for wireless sensor networks. &lt;it&gt;ACM Trans. Inform. Syst. Secur. 8&lt;/it&gt;, 228--258. Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. Eschenauer, L. and Gligor, V. 2002. A key-management scheme for distributed sensor networks. In &lt;it&gt;Proceedings of the 9th ACM Conference on Computer and Communications Security&lt;/it&gt;. ACM Press, 41--47. Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. Lee, J. and Stinson, D. 2005a. A combinatorial approach to key predistribution for distributed sensor networks. In &lt;it&gt;IEEE Wireless Communications and Networking Conference (WCNC'05)&lt;/it&gt;. Vol. 2. IEEE Communications Society, 1200--1205.Google ScholarGoogle Scholar
  12. Lee, J. and Stinson, D. 2005b. Deterministic key predistribution schemes for distributed sensor networks. In &lt;it&gt;SAC 2004 Proceedings&lt;/it&gt;. Lecture Notes in Computer Science, vol. 3357. Springer, 294--307. Google ScholarGoogle ScholarDigital LibraryDigital Library
  13. Lee, J. and Stinson, D. 2006a. Common intersection designs. &lt;it&gt;J. Combin. Designs 14&lt;/it&gt;, 251--269.Google ScholarGoogle Scholar
  14. Lee, J. and Stinson, D. 2006b. Tree-based key distribution patterns. In &lt;it&gt;SAC 2005 Proceedings&lt;/it&gt;. Lecture Notes in Computer Science, vol. 3897. Springer, 189--204. Google ScholarGoogle ScholarDigital LibraryDigital Library
  15. Leighton, T. and Micali, S. 1994. Secret-key agreement without public-key cryptography. In &lt;it&gt;CRYPTO 1993 Proceedings&lt;/it&gt;. Lecture Notes in Computer Science, vol. 773. Springer, 456--479. Google ScholarGoogle ScholarDigital LibraryDigital Library
  16. Liu, D., Ning, P., and Li, R. 2005. Establishing pairwise keys in distributed sensor networks. &lt;it&gt;ACM Trans. Inform. Syst. Secur. 8&lt;/it&gt;, 41--77. Google ScholarGoogle ScholarDigital LibraryDigital Library
  17. Ramkumar, M. and Memon, N. 2003. Pre-loaded key based multicast and broadcast authentication in mobile ad-hoc networks. In &lt;it&gt;IEEE GLOBECOM 2003&lt;/it&gt;. IEEE Communications Society, 1405--1409.Google ScholarGoogle Scholar
  18. Ramkumar, M. and Memon, N. 2005. An efficient key predistribution scheme for ad hoc network security. &lt;it&gt;IEEE J. Select. Areas Comm. 23&lt;/it&gt;, 611--621. Google ScholarGoogle ScholarDigital LibraryDigital Library
  19. Roman, R., Zhou, J., and Lopez, J. 2005. On the security of wireless sensor network. In &lt;it&gt;ICCSA 2005 Proceedings&lt;/it&gt;. Lecture Notes in Computer Science, vol. 3482. Springer, 681--690. Google ScholarGoogle ScholarDigital LibraryDigital Library
  20. Stinson, D. 2003. &lt;it&gt;Combinatorial Designs: Constructions and Analysis&lt;/it&gt;. Springer, Berlin, Germany. Google ScholarGoogle ScholarDigital LibraryDigital Library
  21. Wei, R. and Wu, J. 2005. Product construction of key distribution schemes for sensor networks. In &lt;it&gt;SAC 2004 Proceedings&lt;/it&gt;. Lecture Notes in Computer Science, vol. 3357. Springer, 280--293. Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. On the Construction of Practical Key Predistribution Schemes for Distributed Sensor Networks Using Combinatorial Designs

                            Recommendations

                            Reviews

                            John W. Fendrich

                            Key predistribution schemes (KPSs) enhance the efficiency of distributed sensor networks. This paper discusses secure key deterministic predistribution schemes for distributed sensor networks of communicating nodes. It considers work done by others. It asserts and shows that its schemes offer improvements in communication and computational complexity compared to nondeterministic schemes, together with improved network resiliency. Network resiliency is estimated by the probability that a link between two fixed, noncompromised nodes is affected after other nodes are compromised at random. Also, in the area of improved connectivity, a block graph concept is defined and shown to have desirable combinatorial properties. In fact, the presented distribution schemes are optimal and/or have guaranteed levels of performance with respect to the properties. The combinatorial framework, consisting of keyring spaces (essentially, sets of communicating nodes together with key distribution schemes), together with three operational phases (key distribution phase, shared-key discovery phase, and path-key establishment phase), is presented. Two types of transversal designs, represented by the set of all linear polynomials and the set of all quadratic polynomials over a finite field, are presented, employed, and created to present the predistribution schemes of the paper. Additionally, a linear scheme is compared to a multiple space scheme requiring multiprecision arithmetic for increased measured resiliency. Further research is called for to analyze the tradeoff between the six metrics studied and used in the paper, and to support the asserted improvements of the new distribution schemes (for example, the metrics of connectivity and resiliency). Online Computing Reviews Service

                            Access critical reviews of Computing literature here

                            Become a reviewer for Computing Reviews.

                            Comments

                            Login options

                            Check if you have access through your login credentials or your institution to get full access on this article.

                            Sign in

                            Full Access

                            • Published in

                              cover image ACM Transactions on Information and System Security
                              ACM Transactions on Information and System Security  Volume 11, Issue 2
                              March 2008
                              207 pages
                              ISSN:1094-9224
                              EISSN:1557-7406
                              DOI:10.1145/1330332
                              Issue’s Table of Contents

                              Copyright © 2008 ACM

                              Publisher

                              Association for Computing Machinery

                              New York, NY, United States

                              Publication History

                              • Published: 1 May 2008
                              • Accepted: 1 July 2007
                              • Revised: 1 October 2006
                              • Received: 1 November 2005
                              Published in tissec Volume 11, Issue 2

                              Permissions

                              Request permissions about this article.

                              Request Permissions

                              Check for updates

                              Qualifiers

                              • research-article
                              • Research
                              • Refereed

                            PDF Format

                            View or Download as a PDF file.

                            PDF

                            eReader

                            View online with eReader.

                            eReader
                            About Cookies On This Site

                            We use cookies to ensure that we give you the best experience on our website.

                            Learn more

                            Got it!