Download:
|
by Sencun Zhu, Shouhuai Xu, Sanjeev Setia, Sushil Jajodia
http://mason.gmu.edu/~szhu1/./pke.ps
Add To MetaCart
Abstract:
A prerequisite for 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 a 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 operations. We show that a pairwise key established between two nodes using our protocol is secure against a collusive attack by up to a certain number of compromised nodes. Our protocol can be parameterized to meet the appropriate levels of performance, security and storage for the application under consideration. 1
Citations
|
1001
|
How to Share a Secret
– Shamir
- 1979
|
|
697
|
Using encryption for authentication in large networks of computers
– Needham, Schroeder
- 1978
|
|
480
|
How to construct random functions
– Goldreich, Goldwasser, et al.
- 1986
|
|
354
|
Mitigating routing misbehavior in mobile ad hoc networks
– Marti, Guili, et al.
- 2001
|
|
320
|
SPINS: Security protocols for sensor networks
– Perrig, Szewczyk, et al.
- 2001
|
|
236
|
A key-management scheme for distributed sensor networks
– Eschenauer, Gligor
- 2002
|
|
233
|
Random key predistribution schemes for sensor networks
– Chan, Perrig, et al.
- 2003
|
|
134
|
Split multipath routing with maximally disjoint paths in ad hoc networks
– Lee, Gerla
|
|
109
|
Multicast security: A taxonomy and some efficient constructions
– Canetti, Garay, et al.
- 1999
|
|
96
|
The Byzantine generals strike again
– Dolev
- 1982
|
|
96
|
The Kerberos Network Authentication Service V5
– Kohl, Neuman
- 1993
|
|
95
|
E cient and Timely Mutual Authentication
– Otway, Rees
- 1987
|
|
92
|
Families of finite sets in which no set is covered by the union of r others
– Erdos, Frankel, et al.
- 1985
|
|
81
|
An on-demand secure routing protocol resilient to byzantine failures
– Awerbuch, Holmer, et al.
- 2002
|
|
47
|
Increasing availability and security of an authentication service
– Gong
- 1993
|
|
19
|
Generalized Linear Threshold Scheme
– Kothari
- 1985
|
|
18
|
Temporally-ordered routing algorithm
– Park, Corson
- 1998
|
|
17
|
Perfectly secure message transmission revisited
– Desmedt, Wang
- 2002
|
|
8
|
Some New Bounds for Cover-Free Families
– Stinson, Wei, et al.
- 2000
|
|
7
|
Key Storage in Secure Networks
– Mitchell, Piper
- 1988
|
|
6
|
The Dynamic Souce Routing Protocol for Mobile Ad Hoc Networks
– Johnson, Maltz, et al.
- 2002
|
|
4
|
MP-DSR: A QoS-Aware Multi-Path Dynamic Source Routing Protocol for Wireless Ad-Hoc Networks
– Chan
- 2001
|
|
2
|
Secure communincation in minimal connectivity models
– Franklin, Wright
|
