ACM Home Page
Please provide us with feedback. Feedback
A key-management scheme for distributed sensor networks
Full text PdfPdf (582 KB)
Source Conference on Computer and Communications Security archive
Proceedings of the 9th ACM conference on Computer and communications security table of contents
Washington, DC, USA
SESSION: Key management and key exchange table of contents
Pages: 41 - 47  
Year of Publication: 2002
ISBN:1-58113-612-9
Authors
Laurent Eschenauer  University of Maryland, College Park, MD
Virgil D. Gligor  University of Maryland, College Park, MD
Sponsors
ACM: Association for Computing Machinery
SIGSAC: ACM Special Interest Group on Security, Audit, and Control
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 129,   Downloads (12 Months): 1138,   Citation Count: 209
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/586110.586117
What is a DOI?

ABSTRACT

Distributed Sensor Networks (DSNs) are ad-hoc mobile networks that include sensor nodes with limited computation and communication capabilities. DSNs are dynamic in the sense that they allow addition and deletion of sensor nodes after deployment to grow the network or replace failing and unreliable nodes. DSNs may be deployed in hostile areas where communication is monitored and nodes are subject to capture and surreptitious use by an adversary. Hence DSNs require cryptographic protection of communications, sensor-capture detection, key revocation and sensor disabling. In this paper, we present a key-management scheme designed to satisfy both operational and security requirements of DSNs. The scheme includes selective distribution and revocation of keys to sensor nodes as well as node re-keying without substantial computation and communication capabilities. It 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. The security and network connectivity characteristics supported by the key-management scheme are discussed and simulation experiments presented.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
 
2
 
3
D. W. Carman, P. S. Kruus and B. J. Matt,"Constraints and Approaches for Distributed Sensor Network Security," dated September 1, 2000. NAI Labs Technical Report #00-010, available at http://download.nai.com/products/media/nai/zip/nailabs-report-00-010-final.zip
 
4
5
 
6
 
7
IBM, IBM 4758 General Information Manual, available at http://www.ibm.com/security/cryptocards/
 
8
9
 
10
Leo Marks, Between Silk and Cyanide - A Codemaker's War, 1941--1945, A Touchstone Book, Simon & Schuster, Inc., 2000.
11
 
12
J. Spencer, The Strange Logic of Random Graphs, Algorithms and Combinatorics 22, Springer Verlag 2000, ISBN 3-540-41654-4.
 
13
F. Stajano, Security for Ubiquitous Computing, John Wiley and Sons, New York, Feb. 12, 2002, ISBN: 0-470-84493-0, 267 pp.
 
14

CITED BY  208

Collaborative Colleagues:
Laurent Eschenauer: colleagues
Virgil D. Gligor: colleagues