A new approach for establishing pairwise keys for securing wireless sensor networks

Abstract

Wireless sensor networks based on highly resource-constrained devices require symmetric cryptography in order to make them secure. Integral to this is the exchange of unique symmetric keys between two devices. In this paper, we propose a novel decentralized key exchange protocol that guarantees the confidentiality of a key exchange even if an attacker has compromised some of the devices in the network. A central objective of the protocol design was to minimize resource consumption on the individual devices. We evaluate the resource requirements of our protocol in terms of memory requirements, CPU usage and network traffic both through theoretical analysis and through simulations.

Sluice: Secure Dissemination of Code Updates in Sensor Networks

“…Pairwise key schemes [16,24] attempt to mitigate the threat of compromised nodes by establishing shared keys that are held by only a small subset of network nodes. Unfortunately, this strategy is not sufficiently effective for network reprogramming protocols.…”

End to End Encryption Architecture for Voice over Internet Protocol

“…The encryption scheme will be used to encrypt the entire SIP Message packet except for the "TO" field in the header, the key distribution scheme [9] helps transmit the symmetric key securely which will be used as a session key for later on message exchange. The new proposed architecture helps us to achieve an end to end encryption thus overcoming the draw backs of today's hop-by-hop way of encryption in VoIP.…”

“…Every block is the routed through the internet cloud and it is suggested that all the 8 blocks of key be routed through different routes [9]. This decreases the probability of a key being compromised.…”

Scaling Laws of Key Predistribution Protocols in Wireless Sensor Networks

“…In the basic protocol [3], random keys are pre-distributed. In the KP protocol variant in [4], unique pairwise keys are distributed into pairs of sensors [3], q − composite [4], direct/cooperative [8], random keys probabilistic [9], deployment knowledge [11], P IKE [12], RKEP [13], conf iguration/intersection [15] nature of distributed keys unique pairwise keys random pairwise key [4], closest pairwise key [7], GKE [16] multi − space [5], random subset [6], grid based [6], random key structures location based [7], location aware [10], hexagonal grid [14], multivariate [17] [18] key setup basic protocol [3], q − composite [4], multivariate [17] [18], random multi − space [5], random subset [6], direct/cooperative [8], probabilistic [9], RKEP [13], key distribution method random pairwise key [4], closest pairwise key [7] optimization design conf iguration/intersection [15] quorum based grid based [6], P IKE [12] grid based location based [7], location aware [10], deployment knowledge [11], hexagonal grid [14], GKE [16] closest pairwise key/location based [7], location aware [10], aware deployment knowledge [11], hexagonal grid …”

“…grid based [6], closest pairwise key/location based [7], maximum number of hops cooperative [8], P IKE [12], RKEP [13], intersection [15] on one key path 3 location aware [10], GKE [16] basic protocol [3], q − composite [4], multi − space [5], ∞ random subset [6], probabilistic [9], deployment knowledge [11], multivariate [17] [18] chosen randomly. Resilience is enhanced at the cost of poor connectivity in large scale networks under memory constraints.…”