A pairwise key predistribution scheme for wireless sensor networks

Abstract

To achieve security in wireless sensor networks, it is important to be able to encrypt and authenticate messages sent between sensor nodes. Before doing so, keys for performing encryption and authentication must be agreed upon by the communicating parties. Due to resource constraints, however, achieving key agreement in wireless sensor networks is non-trivial. Many key agreement schemes used in general networks, such as Diffie-Hellman and other public-key based schemes, are not suitable for wireless sensor networks due to the limited computational abilities of the sensor nodes. Pre-distribution of secret keys for all pairs of nodes is not viable due to the large amount of memory this requires when the network size is large. To solve the key pre-distribution problem, two elegant key pre-distribution approaches have been proposed recently.In this paper, we provide a framework in which to study the security of key pre-distribution schemes, propose a new key pre-distribution scheme which substantially improves the resilience of the network compared to previous schemes, and give an in-depth analysis of our scheme in terms of network resilience and associated overhead. Our scheme exhibits a nice threshold property: when the number of compromised nodes is less than the threshold, the probability that communications between any additional nodes are compromised is close to zero. This desirable property lowers the initial payoff of smaller-scale network breaches to an adversary, and makes it necessary for the adversary to attack a large fraction of the network before it can achieve any significant gain.

Revisiting Key Predistribution Using Transversal Designs for a Grid-Based Deployment Scheme

“…These are the only solutions when t ¼ m, since m 00 wþ S 0 m AE Ç > w, for m 00 > m. So, the number of solutions when t ¼ m, is P mÀ1 l¼ 0 S 1 , where S 1 is as given. Hence for all values of t, 1 t T, there are P T t¼1 P tÀ1 t¼0 S 1 solutions satisfying (8). We give the example given in [19] to demonstrate the above theorem.…”

“…Key predistribution in sensor networks was first discussed in by Eschenauer and Gligor in [9]. Other key predistribution schemes were discussed in [5,8,[13][14][15]23]. For application of combinatorial designs in key predistribution, one may refer to [2,4,16,17,20].…”

Reliable Random Key Pre-Distribution Schemes for Wireless Sensor Networks

“…Various key distribution schemes have been studied for wireless sensor networks, considering the resource-constrained sensor nodes used in these networks [7]- [13]. Eschenauer and Gligor [5] proposed a random key pre-distribution scheme.…”

A resilient key predistribution scheme for multiphase wireless sensor networks

“…In the literature, the problem of key distribution in WSNs is addressed by several probabilistic key predistribution schemes such as [3,5,6,7]. One of the first key management schemes using this approach is Eschenauer and Gligor's basic scheme [3].…”

“…Besides, if λ nodes have been captured, whole system gets compromised. Du et al [6] further improved Blom's scheme and transformed it to a general probabilistic case that is Murat Ergun is supported by TÜBİTAK BİDEB scholarship. directly applicable to WSNs.…”