A pairwise key pre-distribution scheme for wireless sensor networks

By Wenliang Du, Jing Deng, Yunghsiang Sam Han, Pramod K. Varshney. Conference on Computer and Communications Security, 2003

1,250 citations recorded by the source corpus.

Subfields: Computer Networks and Communications

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

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

Citations in the corpus

TinySec: a link layer security architecture for wireless sensor networks (2004, background): “Key distribution becomes challenging, but recent research is beginning to address this issue [14, 16, 19, 28].”
NanoECC: Testing the Limits of Elliptic Curve Cryptography in Sensor Networks (2008, background): “, [5,16,17,18,19,20,21,22,23,24]) have focused on efficient key management of symmetric encryption schemes.”
Multilevel μTESLA: Broadcast authentication for distributed sensor networks (2004, methodology): “proposed another approach based on Blom’s key predistribution scheme [Du et al. 2003].”
LEAP: efficient security mechanisms for large-scale distributed sensor networks (2003, background): “We stress that this scheme has a unique security property that is not posse ssed by other pairwise key establishment schemes [6, 7, 9, 30, 20].”
SDAP: a secure hop-by-Hop data aggregation protocol for sensor networks (2006, background): “Furthermore, there is a unique pairwise key shared between each pair of neighboring nodes [Eschenauer and Gligor 2002; Du et al. 2003a; Liu and Ning 2003; Zhu et al. 2003; Zhang et al. 2005].”
Combinatorial Design of Key Distribution Mechanisms for Wireless Sensor Networks (2004, methodology): “in [9] use Blom’s scheme with multiple spaces to increase resilience.”
PIKE: peer intermediaries for key establishment in sensor networks (2005, methodology): “Examples include schemes proposed by Eschenauer and Gligor [7], Chan et al. [5], Du et al. [6], and Liu and Ning [15].”
Countermeasures Against Traffic Analysis Attacks in Wireless Sensor Networks (2005, methodology): “Nodes can set up pair-wise keys using existing protocols [8, 3, 7, 15, 26].”
Security and Cooperation in Wireless Networks (2007, methodology): “The scheme described in [122] is based on matrices, whereas the scheme proposed in [260] is based on polynomials.”
Key distribution mechanisms for wireless sensor networks : a survey (2005, methodology): “…1985], B[Blundo et al. 1992], C[Eschenauer and Gligor 2002], D[Lai et al. 2002], E[Chan et al. 2003], F[Pietro et al. 2003], G[Liu and Ning 2003c], H[Du et al. 2003], I[Liu and Ning 2003b], J[Zhu et al. 2003], K[Du et al. 2004], L[Dutertre et al. 2004], M[Lee and Stinson 2004b], N[Hwang et al.…”
MiniSec: A Secure Sensor Network Communication Architecture (2007, methodology): “There are numerous candidate solutions, such as Random Key Predistribution [5–7, 14, 19], Key Infection [2], and LEAP [23].”
Designing secure sensor networks (2004, background): “Standard cryptographic techniques can protect the secrecy and authenticity of communication links from outsider attacks such as eavesdrop-ping, packet replay attacks, and modification or spoofing of packets.”
A pairwise key predistribution scheme for wireless sensor networks (2005, methodology): “A similar approach to the one described in this paper was independently developed by Liu and Ning [2003], which was published at the same time as the conference version of this paper [Du et al. 2003].”