A key-management scheme for distributed sensor networks

By Laurent Eschenauer, Virgil D. Gligor. Conference on Computer and Communications Security, 2002

915 citations recorded by the source corpus.

Subfields: Artificial Intelligence, Computer Networks and Communications

View Paper: https://www.semanticscholar.org/paper/13a623aa360e2afc30510946bf27a88616090a17

How researchers see this paper

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

In Artificial Intelligence

In Computer Networks and Communications

Citations in the corpus

LEAP+: Efficient security mechanisms for large-scale distributed sensor networks (2006, methodology): “We stress that this scheme has a unique security property that is not possessed by other pairwise key establishment schemes [9, 15, 16, 47, 28].”
Internet of things security: A top-down survey (2018, methodology): “The ﬁrst probabilistic key distribution scheme for WSNs is the scheme called Random key pre-distribution (RKP) proposed by Eschenauer et al. [45].”
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”
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.”
Random key-assignment for secure Wireless Sensor Networks (2003, neutral): “Note that sending a message consumes more energy than receiving a message [22], and this is a parameter of interest in designing a key establishment protocol.”
Demystifying IoT Security: An Exhaustive Survey on IoT Vulnerabilities and a First Empirical Look on Internet-Scale IoT Exploitations (2019, methodology): “Further, Zhao [55] analyzed the resiliency to node-capture attacks of random key predistribution IoT schemes, namely, the q-composite extension of the scheme proposed by Eschenauer and Gligor [171], and provided several design guidelines for secure sensor networks by employing such scheme.”
Key management systems for sensor networks in the context of the Internet of Things (2011, background): “The basic scheme behind this framework is quite simple [35].”
Security in wireless sensor networks (2004, neutral): “Researchers recently developed random-key predistribution protocols [ 3 ] in which a large pool of symmetric keys is chosen and a random subset of the pool is distributed to each sensor node.”
A key management scheme for wireless sensor networks using deployment knowledge (2004, methodology): “The Eschenauer-Gligor scheme [9] have been described earlier in this section.”
LEAP: efficient security mechanisms for large-scale distributed sensor networks (2003, methodology): “LEAP also includes an e.cient protocol for inter-node tra.c authentication based on the use of one-way key chains.”
Security in wireless sensor networks: issues and challenges (2006, background): “[41], [42], [29] and [30] propose key pre-distribution schemes, which target to improve the resilience of the network.”
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].”
Internet of things: Vision, applications and research challenges (2012, background): “The aforementioned solutions are all focused on lower layer security issues, i.e., on the adoption of encryption techniques and ad hoc key distribution schemes [119– 121].”
TinyECC: A Configurable Library for Elliptic Curve Cryptography in Wireless Sensor Networks (2008, background): “Introduction Recent technological advances have made it possible to develop wireless sensor networks consisting of a large number of low-cost, low-power, and multi-functional sensor nodes that communicate over short distances through *This work is supported by the National Science Foundation…”
Reputation-based framework for high integrity sensor networks (2004, neutral): “• Reputation representation R ij = Beta(α j , β j ) • Reputation updates α jnew = α j + r; β jnew = β j + s • Reputation integration (r, s)”
Enhancing Source-Location Privacy in Sensor Network Routing (2005, neutral): “[1–3].”
Securing wireless sensor networks: a survey (2008, background): “There are other schemes that simply replace the polynomial model with other RKP schemes such as RKP [25] in [44] and MSKP [30] and RPK [27] in [45].”