The DOI matches its Crossref record; 4 of the 4 references it cites were found in a registry or an index.
A key-management scheme for distributed sensor networks
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.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Perfectly-Secure Key Distribution for Dynamic Conferences
Blundo, C., De Santis, A., Herzberg, A., Kutten, S., Vaccaro, U., & Yung, M. (1993) · Lecture Notes in Computer Science · doi:10.1007/3-540-48071-4_33 · Cited by 1,030
CONSTRAINTS AND APPROACHES FOR DISTRIBUTED SENSOR NETWORK SECURITY
Carman, D. W., Kruus, P. S., & Matt, B. J. (2000) · Cited by 620
Encryption Modes with Almost Free Message Integrity
Jutla, C. S. (2001) · Lecture notes in computer science · doi:10.1007/3-540-44987-6_32 · Cited by 253
Security for Ubiquitous Computing
Stajano, F. (2005) · Lecture notes in computer science · doi:10.1007/11496618_2 · Cited by 252
Cited by
The Internet of Things: A survey
Atzori, L., Iera, A., & Morabito, G. (2010) · Computer Networks · doi:10.1016/j.comnet.2010.05.010 · Cited by 15,613
Internet of things: Vision, applications and research challenges
Miorandi, D., Sicari, S., De Pellegrini, F., & Chlamtac, I. (2012) · Ad Hoc Networks · doi:10.1016/j.adhoc.2012.02.016 · Cited by 3,578
Random key predistribution schemes for sensor networks
Chan, H., Perrig, A., & Song, D. (2004) · Proceedings 19th International Conference on Data Engineering (Cat. No.03CH37405) · doi:10.1109/secpri.2003.1199337 · Cited by 2,826
Wireless sensor networks: A survey on the state of the art and the 802.15.4 and ZigBee standards
Baronti, P., Pillai, P., Chook, V. W. C., Chessa, S., Gotta, A., & Hu, Y. F. (2007) · Computer Communications · doi:10.1016/j.comcom.2006.12.020 · Cited by 1,430
A Survey on Security and Privacy Issues in Internet-of-Things
Yang, Y., Wu, L., Yin, G., Li, L., & Zhao, H. (2017) · IEEE Internet of Things Journal · doi:10.1109/jiot.2017.2694844 · Cited by 1,278
Metadata
- Authors
- Eschenauer, L., & Gligor, V. D.
- Venue
- Proceedings of the 9th ACM conference on Computer and communications security - CCS '02
- Publisher
- ACM Press
- Published
- 2002
- ISSN
- 1543-7221 (ISSN-L)
- OpenAlex
- W3211513184
- Cited by
- 1,442
- References
- 4
- FWCI
- 18.54
- Type
- conference paper
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.