Establishing pairwise keys in distributed sensor networks
By Donggang Liu, Peng Ning. Conference on Computer and Communications Security, 2003
1,870 citations recorded by the source corpus.
Subfields: Computer Networks and Communications
View Paper: https://www.semanticscholar.org/paper/b073cae2a337a6879e4ddddc8299b4bf53ba4780
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
- Adrian Perrig
- Jean-Pierre Hubaux
- Peng Ning
- Sencun Zhu
- Donggang Liu
- Jaydip Sen
- Sushil Jajodia
- Bülent Yener
Citations in the corpus
- 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.”
- 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…”
- An interleaved hop-by-hop authentication scheme for filtering of injected false data in sensor networks (2004, methodology): “Other work on sensor network security include studies on key management [5, 6, 7, 15, 19].”
- Securing wireless sensor networks: a survey (2008, positive): “Liu, Ning, and Du [51] established a group-based key pre-distribution framework that may incorporate previous schemes.”
- Wireless Sensor Network Security: A Survey (2006, background): “Further enhancements are proposed in [16], [47] with additional analysis and enhancements provided by [33].”
- Key infection: smart trust for smart dust (2004, background): “Recently , Du et al. [5], and Liu and Ning [11] [12] leverage Blom's [1] and the Blundo et al. [2] key establishment protocols to achieve high resilience to node capture.”
- Internet of Things (IoT) Cybersecurity Research: A Review of Current Research Topics (2019, methodology): “The SPINS security framework protocol is widely used in secure routing technologies and includes the secure network encryption protocol and micro timed efficient streaming loss-tolerant authentication protocol [59].”
- PDA: Privacy-Preserving Data Aggregation in Wireless Sensor Networks (2007, background): “Work presented in [13], [14] shows how to set up secret keys between sensor nodes to guarantee secure communications.”
- Combinatorial Design of Key Distribution Mechanisms for Wireless Sensor Networks (2004, methodology): “In [19], polynomial pool-based key pre-distribution is used for pairwise key establishment.”
- A survey on peer-to-peer key management for mobile ad hoc networks (2007, background): “Other schemes [Liu and Ning 2003b; Du et al. 2004; Huang et al. 2004] use deployment information to improve on the probabilistic key predistribution methods.”
- 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].”
- Key management systems for sensor networks in the context of the Internet of Things (2011, methodology): “This optimization improves their resilience, but sacrifices their key connectivity [38].”
- 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.”
- SDAP: a secure hop-by-Hop data aggregation protocol for sensor networks (2006, background): “We also assume every sensor node has an individual secret key shared with the BS. Further, there is a unique pairwise key shared between each pair of neighboring nodes [ 14 , 15, 16].”
- LEAP: efficient security mechanisms for large-scale distributed sensor networks (2003, methodology): “Du et al. [Du et al. 2003], Liu and Ning [ Liu and Ning 2003a ] combined the technique of probabilistic key predeployment with the Blom’s [Blom 1985] or the Blundo’s [Blundo et al. 1993] key management schemes for establishing pairwise keys in sensor networks.”
- Designing secure sensor networks (2004, background): “Recently, researchers proposed a class of random key predistribution techniques that address the problem of key establishment [4–7] However, further research is necessary to improve these algorithms in terms of scalability, resilience to node compromise, memory requirements, and communication…”
- Location-based compromise-tolerant security mechanisms for wireless sensor networks (2006, background): “For example, most of the probabilistic key pre-distribution schemes such as [7]–[10] require a secure “puzzle-solving” method to set up a shared key between two neighboring nodes.”
- 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].”
- Sensor network security: a survey (2009, methodology): “This desirable property makes it necessary for the adversary to attack a significant proportion of the network in order to breach the network when the security designers elaborately select the λ. Liu and Ning [35] develop a similar method.”