A pairwise key predistribution scheme for wireless sensor networks

By Wenliang Du, Jing Deng, Yunghsiang Sam Han, Pramod K. Varshney, Jonathan Katz, Aram Khalili. TSEC, 2005

1,122 citations recorded by the source corpus.

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 nontrivial. 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. Predistribution 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.In this paper, we provide a framework in which to study the security of key predistribution schemes, propose a new key predistribution 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.

Subfields: Computer Networks and Communications, Electrical and Electronic Engineering

View Paper: https://www.semanticscholar.org/paper/e2e212688d21edb52857e04df74dcfd51e99bf67

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Computer Networks and Communications

In Electrical and Electronic Engineering

Citations in the corpus

Sensor network security: a survey (2009, methodology): “The key difference between [34] and [35] is that the scheme in [35] is based on a set of bivariate t-degree polynomials while scheme in [34] is based on Blom’s method [67].”
A key management scheme for wireless sensor networks using deployment knowledge (2004, methodology): “The Eschenauer-Gligor scheme is further improved by Chan, Perrig, and Song [10], by Du, Deng, Han, and Varshney [11], and by Liu and Ning [12].”
Combinatorial Design of Key Distribution Mechanisms for Wireless Sensor Networks (2004, background): “Their proposal requires larger key-chains and smaller key-pools than the original proposal of Eschenauer et al. In [4], common keys in the key-chains are used to establish multiple logical paths over which costly threshold key sharing scheme is used to agree on a new secret.”
Secure mobile subscription of sensor-encrypted data (2011, neutral): “Subsequently, there are many key pre-distribution schemes proposed, e.g., [11, 16, 12 , 15, 18].”
A survey of multimedia streaming in wireless sensor networks (2008, background): “Many schemes have been proposed in the literature, to perform key assignments and set-up, ranging from deterministic to randomized schemes [57]–[62].”
A Survey of Internet of Things (IoT) Authentication Schemes (2019, methodology): “[109] N Encryption/Symmetric X(NodeID, Indices of space, and Seed) 3 D/H I +Resistance to node capture attack −Energy cost is not efficient.”
Security, privacy and trust in Internet of Things: The road ahead (2015, background): “Hence, the KMS protocols which might be suitable for some IoT scenarios are the Blom [21] and the polynomial schema [22], whose computational overhead is quite low in comparison to a Public Key Cryptography (PKC) operations (i.”
Security of the Internet of Things: Vulnerabilities, Attacks, and Countermeasures (2019, background): “More interested readers would refer to [11], [95], [96], [97] for further detailed”
A survey on peer-to-peer key management for mobile ad hoc networks (2007, background): “The key is perfectly secret with respect to a coalition of t other parties [Du et al. 2005].”
Key infection: smart trust for smart dust (2004, background): “[5], and Liu and Ning [11, 12] leverage Blom’s [1] and the Blundo et al.”
Wireless sensor network key management survey and taxonomy (2010, methodology): “Du et al. (2005a) proposed a pairwise key pre-distribution scheme for wireless sensor networks based on the Blom’s matricbased key scheme and random key pre-distribution scheme.”
Concealed Data Aggregation for Reverse Multicast Traffic in Sensor Networks: Encryption, Key Distribution, and Routing Adaptation (2006, background): “Note that key predistribution schemes currently proposed in the literature [16], [31], [14], [23] do not suit our requirements since they mainly focus on pairwise keying or group keying models.”
Key management systems for sensor networks in the context of the Internet of Things (2011, methodology): “However, it increases the computational overhead ( g a must be generated from s a ) and decreases the resilience (any public vector g can be calculated from s a and a Þ [36].”