Establishing pairwise keys for secure communication in ad hoc networks: a probabilistic approach

By Sencun Zhu, Shouhuai Xu, Sanjeev Setia, Sushil Jajodia. 11th IEEE International Conference on Network Protocols, 2003. Proceedings., 2003

392 citations recorded by the source corpus.

Subfields: Artificial Intelligence, Computer Networks and Communications

View Paper: https://www.semanticscholar.org/paper/7875718fdb98859c30d83893e2c51672a0548971

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

Sensor network security: a survey (2009, methodology): “[37] present an approach for establishing a pairwise key that is exclusively known to a pair of nodes with overwhelming probability.”
LEAP: efficient security mechanisms for large-scale distributed sensor networks (2003, background): “Eschenauer and Gligor [9] present a key management scheme for sensor networks based on probabilistic key predeployment.Chan et al [6] extend this scheme and present three new mechanisms for key establishment based on the framework of probabilistic key predeployment.Zhu et al [ 29 ] present an approa”
A survey of security issues in mobile ad hoc and sensor networks (2005, background): “[108] have proposed to harden the basic probabilistic approach with the use of threshold secret sharing to establish a pair wise secret key known exclusively by corresponding nodes.”
An interleaved hop-by-hop authentication scheme for filtering of injected false data in sensor networks (2004, background): “Other work on sensor network security include studies on key management [4, 5, 6, 14, 19, 20].”
Key distribution mechanisms for wireless sensor networks : a survey (2005, methodology): “Localized encryption and authentication protocol (LEAP) [Zhu et al. 2003] proposes that each sensor node can establishes pair-wise keys with its immediate neighbor.”
LEAP+: Efficient security mechanisms for large-scale distributed sensor networks (2006, methodology): “There are two types of probabilistic key sharing schemes: those based on preloaded keys [Chan et al. 2003; Eschenauer and Gligor 2002; Zhu et al. 2003b] and those based on preloaded matrices or polynomials [Du et al. 2003; Liu and Ning 2003a].”
Combinatorial Design of Key Distribution Mechanisms for Wireless Sensor Networks (2004, background): “In [33], common keys in the key-chains are used to establish multiple logical paths over which threshold key sharing scheme is used to agree on a new secret.”