Random key predistribution schemes for sensor networks

By Haowen Chan, Adrian Perrig, Dawn Song. 2003 Symposium on Security and Privacy, 2003., 2003

3,304 citations recorded by the source corpus.

Key establishment in sensor networks is a challenging problem because asymmetric key cryptosystems are unsuitable for use in resource constrained sensor nodes, and also because the nodes could be physically compromised by an adversary. We present three new mechanisms for key establishment using the framework of pre-distributing a random set of keys to each node. First, in the q-composite keys scheme, we trade off the unlikeliness of a large-scale network attack in order to significantly strengthen random key predistribution's strength against smaller-scale attacks. Second, in the multipath-reinforcement scheme, we show how to strengthen the security between any two nodes by leveraging the security of other links. Finally, we present the random-pairwise keys scheme, which perfectly preserves the secrecy of the rest of the network when any node is captured, and also enables node-to-node authentication and quorum-based revocation.

Subfields: Computer Networks and Communications, Computer Vision and Pattern Recognition

View Paper: https://www.semanticscholar.org/paper/45f7f88969bae1e4ccba8d5e299a807c5db4b9b4

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 Computer Vision and Pattern Recognition

Citations in the corpus

A pairwise key pre-distribution scheme for wireless sensor networks (2003, methodology): “Based on this scheme, Chan, Perrig, and Song [Chan et al. 2003] proposed a generalized “q-composite” scheme which improves the resilience of the network (for the same amount of key storage) and requires an attacker to compromise many more nodes in order to compromise any additional communication.”
Security of the Internet of Things: perspectives and challenges (2014, methodology): “For a long time, because of the high energy- consumption of the public key, wireless sensor network key distribution scheme has been designed with symmetric key algorithms, such as centralized key distribution scheme SPINS [65], the famous random pre-distribution key scheme [69], q-composite and a s”
Localization for mobile sensor networks (2004, background): “Alternative key establishment mechanisms such as random key predistribution [14, 9] can establish keys using symmetric cryptography.”
Key infection: smart trust for smart dust (2004, methodology): “An alternative method has been proposed by Eschenauer and Gligor [6], and extended by Chan, Perrig, and Song [3].”
A pairwise key predistribution scheme for wireless sensor networks (2005, methodology): “1.2 Other Related Work The Eschenauer Gligor scheme [Eschenauer and Gligor 2002] and the Chan Perrig Song scheme [Chan et al. 2003] have been reviewed earlier in this section.”
Security and Cooperation in Wireless Networks (2007, methodology): “The q-composite random key pre-distribution scheme and multipath key reinforcement was proposed by Chan, Perrig, and Song as improvements on the basic scheme in [97].”
Secure mobile subscription of sensor-encrypted data (2011, methodology): “[6] then proposed a scheme using the same procedure [13] but the key between two nodes is available if and only if the intersection of the key sets contains a number of keys.”
SecureDAV: a secure data aggregation and verification protocol for sensor networks (2004, background): “There are several algorithms in literature that discuss key predistribution [4], [5], [6], [7] and management [12], [13], [3].”
DEEJAM: Defeating Energy-Efficient Jamming in IEEE 802.15.4-based Wireless Networks (2007, background): “We assume a mechanism exists for pairwise secret key agreement, whether pre-or post-deployment [20], [21].”
DTLS based security and two-way authentication for the Internet of Things (2013, neutral): “[12], establish connections with a node’s neighbors with a certain probability p < 1.”
Security in wireless sensor networks: issues and challenges (2006, neutral): “[41] Data and information spoofing, Attacks in”
Internet of things security: A top-down survey (2018, methodology): “Some enhancements [27, 42] of the basic RKP scheme have been proposed; namely: Q-Composite scheme [27] enhances the resiliency of RKP by introducing additional requirements in order to establish session keys between nodes, basically two nodes i and j can establish a session key only if they share…”
Hiding in the Crowd: A Massively Distributed Algorithm for Private Averaging with Malicious Adversaries (2018, methodology): “This procedure is the basis of a popular key predistribution scheme used to create secure peer-to-peer communication channels in distributed sensor networks (Chan et al., 2003).”
Using Directional Antennas to Prevent Wormhole Attacks (2004, background): “Several efficient mechanisms have been proposed for establishing secure link keys in ad hoc networks [6, 3, 22].”
Establishing pairwise keys for secure communication in ad hoc networks: a probabilistic approach (2003, background): “The probabilistic keying scheme in our protocol is similar to schemes that have been used by other researchers [10, 5].”
A Routing-Driven Elliptic Curve Cryptography based Key Management Scheme for Heterogeneous Sensor Networks (2014, neutral): “H.-H. Chen is with the Department of Engineering Science, National Cheng Kung Univ., Taiwan (e-mail: hshwchen@ieee.org).”