Abstract
Key distribution is one of the most challenging security issues in wireless sensor networks where sensor nodes are randomly scattered over a hostile territory. In such a sensor deployment scenario, there will be no prior knowledge of post deployment configuration. For security solutions requiring pairwise keys, it is impossible to decide how to distribute key pairs to sensor nodes before the deployment. Existing approaches to this problem are to assign more than one key, namely a key-chain, to each node. Key-chains are randomly drawn from a key-pool. Either two neighboring nodes have a key in common in their key-chains, or there is a path, called key-path, among these two nodes where each pair of neighboring nodes on this path has a key in common. Problem in such a solution is to decide on the key-chain size and key-pool size so that every pair of nodes can establish a session key directly or through a path with high probability. The size of the key-path is the key factor for the efficiency of the design. This paper presents novel, deterministic and hybrid approaches based on Combinatorial Design for key distribution. In particular, several block design techniques are considered for generating the key-chains and the key-pools.
Comparison to probabilistic schemes shows that our combinatorial approach produces better connectivity with smaller key-chain sizes.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Anderson, I.: Combinatorial Designs: Construction Methods. Ellis Horwood Limited (1990)
Blom, R.: An optimal class of symmetric key generation systems. In: Beth, T., Cot, N., Ingemarsson, I. (eds.) EUROCRYPT 1984. LNCS, vol. 209, pp. 335–338. Springer, Heidelberg (1985)
Blundo, C., De Santis, A., Herzberg, A., Kutten, S., Vaccaro, U., Yung, M.: Perfectlysecure key distribution for dynamic conferences. In: Brickell, E.F. (ed.) CRYPTO 1992. LNCS, vol. 740, pp. 471–486. Springer, Heidelberg (1993)
Camtepe, S.A., Yener, B.: Combinatorial Design of Key Distribution Mechanisms for Wireless Sensor Networks. RPI Computer Science Department, Technical Report 04-10 (2004), www.cs.rpi.edu/research/tr.html
Carman, D.W., Matt, B.J., Cirincione, G.H.: Energy-efficient and Low-latency Key Management for Sensor Networks. In: Proceedings of 23rd Army Science Conference (2002)
Chan, H., Perrig, A., Song, D.: Random Key Predistribution Schemes for Sensor Networks. In: 2003 IEEE Symposium on Research in Security and Privacy (2003)
Chen, M., Cui, W., Wen, V., Woo, A.: Security and Deployment Issues in a Sensor Network. Ninja Project, A Scalable Internet Services Architecture, Berkeley (2000), http://citeseer.nj.nec.com/chen00security.html
Colbourn, C.J., Dinitz, J.H.: The CRC Handbook of Combinatorial Designs. CRC Press, Boca Raton (1996)
Du, W., Deng, J., Han, Y.S., Varshney, P.: A Pairwise Key Pre-distribution Scheme for Wireless Sensor Networks. In: Proceedings of the 10th ACM Conference on Computer and Communications Security, CCS (2003)
Du, W., Deng, J., Han, Y.S., Chen, S., Varshney, P.K.: A Key Management Scheme for Wireless Sensor Networks Using Deployment Knowledge. INFOCOM (2004)
Deng, J., Han, R., Mishra, S.: Enhancing Base Station Security in Wireless Sensor Networks. Technical Report CU-CS-951-03, Department of Computer Science, University of Colorado (2003)
Deng, J., Han, R., Mishra, S.: A Performance Evaluation of Intrusion-Tolerant Routing inWireless Sensor Networks. In: Zhao, F., Guibas, L.J. (eds.) IPSN 2003. LNCS, vol. 2634, pp. 349–364. Springer, Heidelberg (2003)
Dembowski, P.: Finite Geometries. Springer, Heidelberg (1968)
Eschenauer, L., Gligor, V.D.: A key-management scheme for distributed sensor networks. In: Proceedings of the 9th ACM conference on Computer and communications security (2002)
Hall, M.: Combinatorial Theory. Blaisdell Publishing Company (1967)
Hirschfeld, J.W.P.: Projective Geometries Over Finite Fields. Clarendon Press, Oxford (1979)
Liu, D., Ning, P.: Efficient Distribution of Key Chain Commitments for Broadcast Authentication in Distributed Sensor Networks. In: The 10th Annual Network and Distributed System Security Symposium (February 2003)
Liu, D., Ning, P., Sun, K.: Efficient self-healing group key distribution with revocation capability. In: Proceedings of the 10th ACM conference on Computer and communication security (2003)
Liu, D., Ning, P.: Establishing pairwise keys in distributed sensor networks. In: Proceedings of the 10th ACM conference on Computer and communication security (2003)
Merkle, R.: Secure Communication over insecure channels. Communications of the ACM (1978)
Payne, S.E., Thas, J.A.: Finite Generalized Quadrangles. Research Notes in Mathematics. Pitman Advanced Publishing Program (1984)
Pedoe, D.: An introduction to Projective Geometry. Oxford (1963)
Perrig, A., Szewczyk, R., Wen, V., Culler, D., Tygar, J.D.: SPINS: Security Protocols for Sensor Networks. Wireless Networks Journal, WINE (2002)
Slijepcevic, S., Potkonjak, M., Tsiatsis, V., Zimbeck, S., Srivastava, M.B.: On communication Security in Wireless Ad-Hoc Sensor Network. In: Eleventh IEEE International Workshops on Enabling Technologies: Infrastructure for Collaborative Enterprises, WETICE 2002 (2002)
Stajano, F., Anderson, R.: The resurrecting duckling: security issues for ad-hoc wireless networks. In: AT&T software symposium (1999)
Stinson, D.R., Vanstone, S.A.: A combinatorial approach to threshold schemes. In: Pomerance, C. (ed.) CRYPTO 1987. LNCS, vol. 293, pp. 330–339. Springer, Heidelberg (1988)
Stinson, D.R.: A construction for authentication / secrecy codes from certain combinatorial designs. In: Pomerance, C. (ed.) CRYPTO 1987. LNCS, vol. 293, pp. 355–366. Springer, Heidelberg (1988)
Stinson, D.R.: Combinatorial characterizations of authentication codes. In: Feigenbaum, J. (ed.) CRYPTO 1991. LNCS, vol. 576, pp. 62–73. Springer, Heidelberg (1992)
Song, Y., Wool, A., Yener, B.: Combinatorial Design of Multi-ring Networks with Combined Routing and Flow Control. Computer Networks 3(3), 247–267 (2003)
Undercoffer, J., Avancha, S., Joshi, A., Pinkston, J.: Security for Sensor Networks. In: CADIP Research Symposium (2002)
Wallis, W.D.: Combinatorial Desing. Marcel Dekker Inc., New York (1988)
Yener, B., Ofek, Y., Yung, M.: Combinatorial Design of Congestion Free Networks. In: IEEE/ACM Transactions on Networking, vol. 5(6), December 1997, pp. 989–1000 (1997)
Zhu, S., Xu, S., Setia, S., Jajodia, S.: Establishing Pairwise Keys for Secure Communication in Ad Hoc Networks: A Probabilistic Approach. In: 11th IEEE International Conference on Network Protocols, ICNP 2003 (2003)
Zhu, S., Setia, S., Jajodia, S.: LEAP: efficient security mechanisms for large-scale distributed sensor networks. In: Proceedings of the 10th ACM conference on Computer and communication security (2003)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Çamtepe, S.A., Yener, B. (2004). Combinatorial Design of Key Distribution Mechanisms for Wireless Sensor Networks. In: Samarati, P., Ryan, P., Gollmann, D., Molva, R. (eds) Computer Security – ESORICS 2004. ESORICS 2004. Lecture Notes in Computer Science, vol 3193. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30108-0_18
Download citation
DOI: https://doi.org/10.1007/978-3-540-30108-0_18
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-22987-2
Online ISBN: 978-3-540-30108-0
eBook Packages: Springer Book Archive