Abstract
Wireless sensor network (WSNs) is highly vulnerable to attacks because it consists of various resource-constrained sensor nodes which communicates among themselves via wireless links. Establishment of pairwise keys between sensor nodes is used to realize many of the security services for wireless sensor networks. Hence, securely distributing keys among sensor nodes is a fundamental challenge for providing security services in WSNs. Even though the random key pre-distribution approach is suitable for low power and resource constrained sensor nodes, a shared key between a pair of nodes is not guaranteed and thus, they may not be able to communicate with each other. Matrix based scheme for key pre-distribution essentially use LU decomposition of matrix which can provide keys between any pair of nodes but are quite vulnerable to attack. This paper proposes a new robust key pre-distribution schemes based on LDU′ composition of matrices. In the first scheme, we use integer as elements of symmetric matrices and in the second scheme we use polynomials over finite fields as elements of the symmetric matrices. The existing approach use decomposition of matrices which is compute intensive but our proposed scheme uses composition of matrices. The analysis shows that the proposed scheme allows almost 100% connectivity regardless of the number of keys and provides 100% resilience against node capture.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Choi, S.J., Youn, H.Y.: Mkps: A multi-level key pre- distribution scheme for secure wireless sensor networks. In: HCI, vol. (2), pp. 808–817 (2007)
Naik, P., Ravichandran, K., Sivalingam, K.M.: Cryptographic key exchange based on locationing information. Pervasive Mob. Comput. 3(1), 15–35 (2007)
Park, C.-W., Choi, S.J., Youn, H.Y.: A noble key pre- distribution scheme with lu matrix for secure wireless sensor networks. CIS (2), 494–499 (2005)
Zhu, S., Xu, S., Setia, S., Jajodia, S.: Establishing pairwise keys for secure communication in ad hoc networks: A probabilistic approach. In: ICNP, pp. 326–335 (2003)
Akyildiz, I.F., Su, W., Sankarasubramaniam, Y., Cayirci, E.: Wireless sensor networks: a survey Arch. Rat. Mech. Anal. 78, 393–422 (1982)
Stajano, F.: Security for Ubiquitous Computing. John Wiley and Sons, Chichester (2002)
Rivest, R.L., Shamir, A., Adleman, L.: A Method for Obtaining Digital Signatures and Public-Key Cryptosystems. Communications of the ACM 21(2), 120–126 (1978)
Eschenauer, L., Gligor, V.D.: A key-management scheme for distributed sensor networks. In: ACM Conference on Computer and Communications Security, pp. 41–47 (2002)
Blom, R.: An optimal class of symmetric key generation systems. In: Eurocrypt 1976 (1976)
Perrig, A., Szewczyk, R., Wen, V., Culler, D., Tygar, J.D.: Spins: security protocols for sensor networks. In: MobiCom 2001: Proceedings of the 7th Annual International Conference on Mobile Computing and Networking, pp. 189–199. ACM, New York (2001)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kumar, S., Dohare, D. (2011). Efficient Key Distribution Schemes for Wireless Sensor Networks Using LDU′ Composition of Symmetric Matrices. In: Wyld, D.C., Wozniak, M., Chaki, N., Meghanathan, N., Nagamalai, D. (eds) Trends in Network and Communications. WeST NeCoM WiMoN 2011 2011 2011. Communications in Computer and Information Science, vol 197. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-22543-7_35
Download citation
DOI: https://doi.org/10.1007/978-3-642-22543-7_35
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-22542-0
Online ISBN: 978-3-642-22543-7
eBook Packages: Computer ScienceComputer Science (R0)