Authors: Abhishek Gupta; Joy Kuri; Sugata Sanyal
Addresses: SAIT India Lab, Samsung India Software Operations, Bangalore 560093, India. ' Centre for Electronics Design and Technology, Indian Institute of Science, Bangalore 560012, India. ' School of Technology & Computer Science, Tata Institute of Fundamental Research, Homi Bhabha Road, Mumbai 400005, India
Abstract: Because of the resource-constrained nature of Wireless Sensor Networks (WSNs), it is easier to use a security system based on symmetric key cryptography. However, the distribution and management of cryptographic keys pose challenges of their own. In this paper, we study some deterministic methods of distribution of keys to nodes. We propose and analyse a polynomial-based scheme and a complete connectivity scheme. An analytical comparison between the schemes, in terms of security and connectivity, is presented next. Motivated by the schemes, we present a general key allocation scheme and derive general expressions for security and connectivity that are applicable to any deterministic key distribution algorithm in a certain class (not just the polynomial and full-connectivity schemes mentioned above). With the help of these expressions, we present a number of trade-offs which should be taken into account while designing a secure system.
Keywords: symmetric key cryptography; polynomial-based; complete connectivity; key distribution; performance evaluation; deterministic key allocation; wireless sensor networks; WSNs; wireless networks; security.
International Journal of Wireless and Mobile Computing, 2012 Vol.5 No.3, pp.271 - 291
Received: 30 Jan 2012
Accepted: 07 Mar 2012
Published online: 16 Jul 2012 *