Establishing pairwise keys for secure communication in ad hoc networks: a probabilistic approach
Sencun Zhu,Shouhuai Xu,Sanjeev Setia,Sushil Jajodia +3 more
- pp 326-335
Reads0
Chats0
TLDR
This paper presents a scalable and distributed protocol that enables two nodes to establish a pairwise shared key on the fly, without requiring the use of any on-line key distribution center.Abstract:
A prerequisite for a secure communication between two nodes in an ad hoc network is that the nodes share a key to bootstrap their trust relationship. In this paper, we present a scalable and distributed protocol that enables two nodes to establish a pairwise shared key on the fly, without requiring the use of any on-line key distribution center. The design of our protocol is based on a novel combination of two techniques - probabilistic key sharing and threshold secret sharing. Our protocol is scalable since every node only needs to possess a small number of keys, independent of the network size, and it is computationally efficient because it only relies on symmetric key cryptography based operations. We show that a pairwise key established between two nodes using our protocol is secure against a collusion attack by up to a certain number of compromised nodes. We also show through a set of simulations that our protocol can be parameterized to meet the desired levels of performance, security and storage for the application under consideration.read more
Citations
More filters
Proceedings ArticleDOI
LEAP: efficient security mechanisms for large-scale distributed sensor networks
TL;DR: The Localized Encryption and Authentication Protocol (LEAP) as discussed by the authors is a key management protocol for sensor networks that is designed to support in-network processing, while at the same time restricting the security impact of a node compromise to the immediate network neighborhood of the compromised node.
Journal ArticleDOI
LEAP+: Efficient security mechanisms for large-scale distributed sensor networks
TL;DR: The security of LEAP+ under various attack models is analyzed and it is shown that it is very effective in defending against many sophisticated attacks, such as HELLO flood attacks, node cloning attacks, and wormhole attacks.
Book
Information Theoretic Security
TL;DR: Information Theoretic Security surveys the research dating back to the 1970s which forms the basis of applying this technique in modern systems to achieve secrecy for a basic wire-tap channel model as well as for its extensions to multiuser networks.
Proceedings ArticleDOI
An interleaved hop-by-hop authentication scheme for filtering of injected false data in sensor networks
TL;DR: This paper presents an interleaved hop-by-hop authentication scheme that guarantees that the base station will detect any injected false data packets when no more than a certain number t nodes are compromised.
Journal ArticleDOI
Sensor network security: a survey
TL;DR: This paper identifies the threats and vulnerabilities to WSNs and summarize the defense methods based on the networking protocol layer analysis first, and gives a holistic overview of security issues.
References
More filters
Journal ArticleDOI
How to share a secret
TL;DR: This technique enables the construction of robust key management schemes for cryptographic systems that can function securely and reliably even when misfortunes destroy half the pieces and security breaches expose all but one of the remaining pieces.
Ad hoc On-Demand Distance Vector (AODV) Routing
TL;DR: A logging instrument contains a pulsed neutron source and a pair of radiation detectors spaced along the length of the instrument to provide an indication of formation porosity which is substantially independent of the formation salinity.
Proceedings ArticleDOI
A key-management scheme for distributed sensor networks
TL;DR: A key-management scheme designed to satisfy both operational and security requirements of DSNs is presented, which relies on probabilistic key sharing among the nodes of a random graph and uses simple protocols for shared-key discovery and path-key establishment, and for key revocation, re-keying, and incremental addition of nodes.
Proceedings ArticleDOI
Mitigating routing misbehavior in mobile ad hoc networks
TL;DR: Two techniques that improve throughput in an ad hoc network in the presence of nodes that agree to forward packets but fail to do so are described, using a watchdog that identifies misbehaving nodes and a pathrater that helps routing protocols avoid these nodes.
Proceedings ArticleDOI
Random key predistribution schemes for sensor networks
TL;DR: The random-pairwise keys scheme is presented, 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.