The DOI matches its Crossref record; 34 of the 34 references it cites were found in a registry or an index.
Distributed Detection of Node Replication Attacks in Sensor Networks
Abstract
The low-cost, off-the-shelf hardware components in unshielded sensor-network nodes leave them vulnerable to compromise. With little effort, an adversary may capture nodes, analyze and replicate them, and surreptitiously insert these replicas at strategic locations within the network. Such attacks may have severe consequences; they may allow the adversary to corrupt network data or even disconnect significant parts of the network. Previous node replication detection schemes depend primarily on centralized mechanisms with single points of failure, or on neighborhood voting protocols that fail to detect distributed replications. To address these fundamental limitations, we propose two new algorithms based on emergent properties (Gligor (2004)), i.e., properties that arise only through the collective action of multiple nodes. Randomized multicast distributes node location information to randomly-selected witnesses, exploiting the birthday paradox to detect replicated nodes, while line-selected multicast uses the topology of the network to detect replication. Both algorithms provide globally-aware, distributed node-replica detection, and line-selected multicast displays particularly strong performance characteristics. We show that emergent algorithms represent a promising new approach to sensor network security; moreover, our results naturally extend to other classes of networks in which nodes can be captured, replicated and re-inserted by an adversary.
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
Adhi Harmoko, S., M.Komp, Jacquard, J. M., Zuse, K., & Eniac (2005) · Cited by 18,035
GPSR: greedy perimeter stateless routing for wireless networks
Karp, B., & Kung, H. T. (2000) · Proceedings of the 6th annual international conference on Mobile computing and networking · doi:10.1145/345910.345953 · Cited by 7,050
On the security of public key protocols
Dolev, D., & Yao, A. (1983) · IEEE Transactions on Information Theory · doi:10.1109/tit.1983.1056650 · Cited by 5,833
Douceur, J. R. (2002) · Lecture Notes in Computer Science · doi:10.1007/3-540-45748-8_24 · Cited by 4,419
GPS-less low-cost outdoor localization for very small devices
Bulusu, N., Heidemann, J., & Estrin, D. (2000) · IEEE Personal Communications · doi:10.1109/98.878533 · Cited by 3,592
A key-management scheme for distributed sensor networks
Eschenauer, L., & Gligor, V. D. (2002) · Proceedings of the 9th ACM conference on Computer and communications security · doi:10.1145/586110.586117 · Cited by 3,541
Self-citationRandom 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
Self-citationNext century challenges: scalable coordination in sensor networks
Estrin, D., Govindan, R., Heidemann, J., & Kumar, S. (1999) · Proceedings of the 5th annual ACM/IEEE international conference on Mobile computing and networking · doi:10.1145/313451.313556 · Cited by 2,703
SPINS: security protocols for sensor networks
Perrig, A., Szewczyk, R., Wen, V., Culler, D., & Tygar, J. D. (2001) · Proceedings of the 7th annual international conference on Mobile computing and networking · doi:10.1145/381677.381696 · Cited by 2,532
Self-citationFine-grained network time synchronization using reference broadcasts
Elson, J., Girod, L., & Estrin, D. (2002) · ACM SIGOPS Operating Systems Review · doi:10.1145/844128.844143 · Cited by 2,396
A Digital Signature Based on a Conventional Encryption Function
Merkle, R. C. (1988) · Lecture Notes in Computer Science · doi:10.1007/3-540-48184-2_32 · Cited by 1,998
Convex position estimation in wireless sensor networks
Doherty, L., pister, K. S. J., & El Ghaoui, L. (2002) · Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213) · doi:10.1109/infcom.2001.916662 · Cited by 1,632
A key-management scheme for distributed sensor networks
Eschenauer, L., & Gligor, V. D. (2002) · Proceedings of the 9th ACM conference on Computer and communications security - CCS '02 · doi:10.1145/586115.586117 · Cited by 1,442
Self-citationProtocols 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
The sybil attack in sensor networks: analysis & defenses
Newsome, J., Shi, E., Song, D., & Perrig, A. (2004) · Proceedings of the 3rd international symposium on Information processing in sensor networks · doi:10.1145/984622.984660 · Cited by 1,305
Self-citationRumor routing algorthim for sensor networks
Braginsky, D., & Estrin, D. L. (2002) · doi:10.1145/570738.570742 · Cited by 1,295
Fine-grained network time synchronization using reference broadcasts
Elson, J., Girod, L., & Estrin, D. (2002) · Proceedings of the 5th symposium on Operating systems design and implementation - OSDI '02 · doi:10.1145/1060289.1060304 · Cited by 1,165
Revocation and Tracing Schemes for Stateless Receivers
Naor, D., Naor, M., & Lotspiech, J. (2001) · Lecture Notes in Computer Science · doi:10.1007/3-540-44647-8_3 · Cited by 1,118
Rumor Routing Algorithm For Sensor Networks
Braginsky, D., & Estrin, D. L. (2002) · Cited by 905
Fiat, A., & Naor, M. (2007) · Lecture Notes in Computer Science · doi:10.1007/3-540-48329-2_40 · Cited by 728
A public-key infrastructure for key distribution in TinyOS based on elliptic curve cryptography
Malan, D. J., Welsh, M., & Smith, M. D. (2005) · 2004 First Annual IEEE Communications Society Conference on Sensor and Ad Hoc Communications and Networks, 2004. IEEE SECON 2004. · doi:10.1109/sahcn.2004.1381904 · Cited by 712
SWATT: software-based attestation for embedded devices
Seshadri, A., Perrig, A., van Doorn, L., & Khosla, P. (2004) · IEEE Symposium on Security and Privacy, 2004. Proceedings. 2004 · doi:10.1109/secpri.2004.1301329 · Cited by 704
Self-citationFortney, J. P. (2020) · Discrete Mathematics for Computer Science · doi:10.1201/9781003091479-1 · Cited by 428
Building a high-performance, programmable secure coprocessor
Smith, S. W., & Weingart, S. (1999) · Computer Networks · doi:10.1016/s1389-1286(98)00019-x · Cited by 336
Newsome, J., & Song, D. (2003) · Proceedings of the 1st international conference on Embedded networked sensor systems · doi:10.1145/958491.958501 · Cited by 308
Building the IBM 4758 secure coprocessor
Dyer, J. G., Lindemann, M., Perez, R., Sailer, R., van Doorn, L., & Smith, S. W. (2001) · Computer · doi:10.1109/2.955100 · Cited by 282
Solomon, H. (1978) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9781611970418 · Cited by 245
Liu, D., & Ning, P. (2002) · NCSU Libraries Repository (North Carolina State University Libraries) · Cited by 242
Physical Security Devices for Computer Subsystems: A Survey of Attacks and Defenses
Weingart, S. H. (2000) · Lecture Notes in Computer Science · doi:10.1007/3-540-44499-8_24 · Cited by 195
A compact and fast hybrid signature scheme for multicast packet authentication
Rohatgi, P. (1999) · Proceedings of the 6th ACM conference on Computer and communications security · doi:10.1145/319709.319722 · Cited by 178
Estimating Aggregates on a Peer-to-Peer Network
Bawa, M., García-Molina, H., Gionis, A., et al. (2003) · Cited by 175
Long-Lived Broadcast Encryption
Garay, J. A., Staddon, J., & Wool, A. (2000) · Lecture notes in computer science · doi:10.1007/3-540-44598-6_21 · Cited by 136
Detection of Denial-of-Message Attacks on Sensor Network Broadcasts
McCune, J., Shi, E., Perrig, A., et al. (2005) · Proceedings - IEEE Symposium on Security and Privacy/Proceedings of the ... IEEE Symposium on Security and Privacy · doi:10.1109/sp.2005.7 · Cited by 128
Self-citationSpace requirements for broadcast encryption
Blundo, C., & Cresti, A. (1995) · Lecture notes in computer science · doi:10.1007/bfb0053444 · Cited by 114
Cited by
Neshenko, N., Bou-Harb, E., Crichigno, J., Kaddoum, G., & Ghani, N. (2019) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2019.2910750 · Cited by 827
SybilGuard: defending against sybil attacks via social networks
Yu, H., Kaminsky, M., Gibbons, P. B., & Flaxman, A. (2006) · ACM SIGCOMM Computer Communication Review · doi:10.1145/1151659.1159945 · Cited by 725
Security of the Internet of Things: Vulnerabilities, Attacks, and Countermeasures
Butun, I., Osterberg, P., & Song, H. (2020) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2019.2953364 · Cited by 707
Sensor network security: a survey
Chen, X., Makki, K., Yen, K., & Pissinou, N. (2009) · IEEE Communications Surveys & Tutorials · doi:10.1109/surv.2009.090205 · Cited by 599
SybilLimit: A Near-Optimal Social Network Defense against Sybil Attacks
Yu, H., Gibbons, P. B., Kaminsky, M., & Xiao, F. (2008) · 2008 IEEE Symposium on Security and Privacy (sp 2008) · doi:10.1109/sp.2008.13 · Cited by 563
Metadata
- Authors
- Parno, B., Perrig, A., & Gligor, V.
- Venue
- 2005 IEEE Symposium on Security and Privacy (S&P'05)
- Publisher
- IEEE
- Published
- 2005-05-24
- Pages
- 49-63
- ISSN
- 1081-6011 (ISSN-L)
- OpenAlex
- W1940397557
- Cited by
- 675
- References
- 34
- FWCI
- 21.17
- 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.