The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
On the Distribution and Revocation of Cryptographic Keys in Sensor Networks
Abstract
Key management has two important aspects: key distribution, which describes how to disseminate secret information to the principals so that secure communications can be initiated, and key revocation, which describes how to remove secrets that may have been compromised. Key management in sensor networks face constraints of large scale, lack of a priori information about deployment topology, and limitations of sensor node hardware. While key distribution has been studied extensively in recent works, the problem of key and node revocation in sensor networks has received relatively little attention. Yet, revocation protocols that function correctly in the presence of active adversaries pretending to be legitimate protocol participants via compromised sensor nodes are essential. In their absence, an adversary could take control of the sensor network's operation by using compromised nodes which retain their network connectivity for extended periods of time. In this paper, we present an overview of key-distribution methods in sensor networks and their salient features to provide context for understanding key and node revocation. Then, we define basic properties that distributed sensor-node revocation protocols must satisfy and present a protocol for distributed node revocation that satisfies these properties under general assumptions and a standard attacker model.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
Protocols for Public Key Cryptosystems
Merkle, R. C. (1980) · 1980 IEEE Symposium on Security and Privacy · doi:10.1109/sp.1980.10006 · Cited by 1,418
Cited by
Secure Control: Towards Survivable Cyber-Physical Systems
Cardenas, A. A., Amin, S., & Sastry, S. (2008) · 2008 The 28th International Conference on Distributed Computing Systems Workshops · doi:10.1109/icdcs.workshops.2008.40 · Cited by 911
Game theory meets network security and privacy
Manshaei, M. H., Zhu, Q., Alpcan, T., Bacşar, T., & Hubaux, J.-P. (2013) · ACM Computing Surveys · doi:10.1145/2480741.2480742 · Cited by 808
Securing wireless sensor networks: a survey
Zhou, Y., Fang, Y., & Zhang, Y. (2008) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2008.4625802 · Cited by 424
A Survey on Wireless Sensor Network Security
Sen, J. (2010) · arXiv (Cornell University) · doi:10.48550/arxiv.1011.1529 · Cited by 273
Metadata
- Authors
- Chan, H., Gligor, V. D., Perrig, A., & Muralidharan, G.
- Venue
- IEEE Transactions on Dependable and Secure Computing
- Published
- 2005-03
- Volume
- 2
- Issue
- 3
- Pages
- 233-247
- ISSN
- 1545-5971 (ISSN-L)
- OpenAlex
- W2130929645
- Cited by
- 179
- References
- 1
- FWCI
- 18.45
- Type
- journal article
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: On the Distribution and Revocation of Cryptographic Keys in Sensor Networks. https://app.cochat.ai/papers/10.1109/tdsc.2005.37
- The paper
- Chan, H., Gligor, V. D., Perrig, A., & Muralidharan, G. (2005). On the Distribution and Revocation of Cryptographic Keys in Sensor Networks. IEEE Transactions on Dependable and Secure Computing. https://doi.org/10.1109/tdsc.2005.37
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.