Paper Info
Title
Performance analysis of deterministic key allocation schemes for wireless sensor networks
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.
Year
DOI
Venue
2012
10.1504/IJWMC.2012.047971
IJWMC
Keywords
Field
DocType
performance analysis,deterministic key allocation scheme,symmetric key cryptography,full-connectivity scheme,derive general expression,polynomial-based scheme,cryptographic key,wireless sensor network,security system,complete connectivity scheme,deterministic method,general key allocation scheme,deterministic key distribution algorithm,key distribution
Symmetric-key algorithm,Key distribution,Key space,Polynomial,Expression (mathematics),Computer science,Computer network,Key encapsulation,Theoretical computer science,Wireless sensor network,Key (cryptography),Distributed computing
Journal
Volume
Issue
Citations 
5
3
0
PageRank 
References 
Authors
0.34
20
3
Name
Order
Citations
PageRank
Abhishek Gupta1178.53
Joy Kuri231246.17
Sugata Sanyal348165.88