Abstract
In this paper, combinatorial design followed by a probabilistic merging is applied to key pre-distribution in sensor nodes. A transversal design is used to construct a (v, b, r, k) configuration and then randomly chosen blocks are merged to form sensor nodes. We present detailed mathematical analysis of the number of nodes, number of keys per node and the probability that a link gets affected if certain number of nodes are compromised. The technique is tunable to user requirements and it also compares favourably with state of the art design strategies. An important feature of our design is the presence of more number of common keys between any two nodes.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
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)
Camtepe, S.A., Yener, B.: Combinatorial design of key distribution mechanisms for wireless sensor networks. In: Eurosics 2004 (2004)
Chan, H., Perrig, A., Song, D.: Random key predistribution schemes for sensor networks. In: IEEE Symposium on Research in Security and Privacy, pp. 197–213 (2003)
Colbourn, C.J., Dinitz, J.H.: The CRC Handbook of Combinatorial Designs. CRC Press, Boca Raton (1996)
Du, W., Ding, J., Han, Y.S., Varshney, P.K.: A pairwise key pre-distribution scheme for wireles sensor networks. In: Proceedings of the 10th ACM conference on Computer and Communications Security, ACM CCS 2003, pp. 42–51 (2003)
Eschenauer, L., Gligor, V.B.: A key-management scheme for distributed sensor networks. In: Proceedings of the 9th ACM conference on Computer and Communications Security, ACM CCS 2002, pp. 41–47 (2002)
Gura, N., Patel, A., Wander, A., Eberle, H., Shantz, S.C.: Comparing Elliptic Curve Cryptography and RSA on 8-bit CPUs. In: Joye, M., Quisquater, J.-J. (eds.) CHES 2004. LNCS, vol. 3156, pp. 119–132. Springer, Heidelberg (2004)
Kahn, J.M., Katz, R.H., Pister, K.S.J.: Next century challenges: Mobile networking for smart dust. In: Proceedings of the 5th annual ACM/IEEE international conference on mobile computing and networking, pp. 483–492 (1999)
Lee, J., Stinson, D.: Deterministic key predistribution schemes for distributed sensor networks. In: Handschuh, H., Hasan, M.A. (eds.) SAC 2004. LNCS, vol. 3357, pp. 294–307. Springer, Heidelberg (2004)
Lee, J., Stinson, D.: A combinatorial approach to key predistribution for distributed sensor networks. In: IEEE Wireless Computing and Networking Conference (WCNC 2005), March 13-17, New Orleans, LA, USA (2005)
Liu, D., Ning, P.: Establishing pairwise keys in distributed sensor networks. In: Proceedings of the 10th ACM conference on Computer and Communications Security, ACM CCS 2003 (2003)
Stinson, D.: Cryptography: Theory and Practice, 2nd edn. Chapman & Hall, CRC Press (2002)
Stinson, D.R.: Combinatorial Designs: Constructions and Analysis. Springer, New York (2003)
Street, A.P., Street, D.J.: Combinatorics of experimental design. Clarendon Press, Oxford (1987)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Chakrabarti, D., Maitra, S., Roy, B. (2005). A Key Pre-distribution Scheme for Wireless Sensor Networks: Merging Blocks in Combinatorial Design. In: Zhou, J., Lopez, J., Deng, R.H., Bao, F. (eds) Information Security. ISC 2005. Lecture Notes in Computer Science, vol 3650. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11556992_7
Download citation
DOI: https://doi.org/10.1007/11556992_7
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-29001-8
Online ISBN: 978-3-540-31930-6
eBook Packages: Computer ScienceComputer Science (R0)