The DOI matches its Crossref record; 25 of the 25 references it cites were found in a registry or an index.
SECTOR: secure tracking of node encounters in multi-hop wireless networks
Open accessAbstract
In this paper we present SECTOR, a set of mechanisms for the secure verification of the time of encounters between nodes in multi-hop wireless networks. This information can be used notably to prevent wormhole attacks (without requiring any clock synchronization), to secure routing protocols based on last encounters (with only loose clock synchronization), and to control the topology of the network. SECTOR is based primarily on distance-bounding techniques, on one-way hash chains and on Merkle hash trees. We analyze the communication, computation and storage complexity of the proposed mechanisms and we show that, due to their efficiency and simplicity, they are compliant with the limited resources of most mobile devices.
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
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
Packet leashes: a defense against wormhole attacks in wireless networks
Hu, Y.-C., Perrig, A., & Johnson, D. B. (2004) · IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428) · doi:10.1109/infcom.2003.1209219 · Cited by 1,513
Performance analysis of the CONFIDANT protocol
Buchegger, S., & Le Boudec, J.-Y. (2002) · Proceedings of the 3rd ACM international symposium on Mobile ad hoc networking & computing · doi:10.1145/513800.513828 · Cited by 1,495
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
A secure routing protocol for ad hoc networks
Sanzgiri, K., Dahill, B., Levine, B. N., Shields, C., & Belding-Royer, E. M. (2003) · 10th IEEE International Conference on Network Protocols, 2002. Proceedings. · doi:10.1109/icnp.2002.1181388 · Cited by 1,410
Ariadne: a secure on-demand routing protocol for ad hoc networks
Hu, Y.-C., Perrig, A., & Johnson, D. B. (2002) · Proceedings of the 8th annual international conference on Mobile computing and networking · doi:10.1145/570645.570648 · Cited by 1,298
Secure Routing in Mobile Ad hoc Networks
(2022) · doi:10.22271/ed.book.2027 · Cited by 1,227
IEEE Symposium on Security and Privacy
(2023) · IT Professional · doi:10.1109/mitp.2023.3246667 · Cited by 1,167
Buchegger, S., & Boudec, J. L. (2002) · Infoscience (Ecole Polytechnique Fédérale de Lausanne) · Cited by 1,026
The TESLA Broadcast Authentication Protocol
Perrig, A., Canetti, R., Tygar, J. D., & Song, D. X. (2018) · Figshare · doi:10.1184/r1/6073610 · Cited by 842
SEAD: secure efficient distance vector routing for mobile wireless ad hoc networks
Hu, Y.-C., Johnson, D. B., & Perrig, A. (2003) · Ad Hoc Networks · doi:10.1016/s1570-8705(03)00019-2 · Cited by 830
Brands, S., & Chaum, D. (2007) · Lecture Notes in Computer Science · doi:10.1007/3-540-48285-7_30 · Cited by 804
SEAD: secure efficient distance vector routing for mobile wireless ad hoc networks
Hu, Y.-C., Johnson, D. B., & Perrig, A. (2003) · Proceedings Fourth IEEE Workshop on Mobile Computing Systems and Applications · doi:10.1109/mcsa.2002.1017480 · Cited by 636
Talking to Strangers: Authentication in Ad-Hoc Wireless Networks.
Balfanz, D., Smetters, D. K., Stewart, P. A., & Wong, H. C. (2002) · Cited by 633
Secure verification of location claims
Sastry, N., Shankar, U., & Wagner, D. (2003) · Proceedings of the 2nd ACM workshop on Wireless security · doi:10.1145/941311.941313 · Cited by 604
Time synchronization in ad hoc networks
Römer, K. (2001) · ACM International Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc) · doi:10.1145/501436.501440 · Cited by 471
Toward self-organized mobile ad hoc networks: the terminodes project
Hubaux, J.-P., Gross, T., Le Boudec, J.-Y., & Vetterli, M. (2001) · IEEE Communications Magazine · doi:10.1109/35.894385 · Cited by 301
Self-citationMobility helps security in ad hoc networks
Čapkun, S., Hubaux, J.-P., & Buttyán, L. (2003) · Proceedings of the 4th ACM international symposium on Mobile ad hoc networking & computing · doi:10.1145/778415.778422 · Cited by 257
Self-citationSecurity for Ubiquitous Computing
Stajano, F. (2005) · Lecture notes in computer science · doi:10.1007/11496618_2 · Cited by 252
Almost Optimal Hash Sequence Traversal
Coppersmith, D., & Jakobsson, M. (2003) · Lecture Notes in Computer Science · doi:10.1007/3-540-36504-4_8 · Cited by 158
Efficient Security Mechanisms for Routing Protocolsa.
Hu, Y., Perrig, A., & Johnson, D. B. (2003) · Network and Distributed System Security Symposium · Cited by 140
Fractal Merkle Tree Representation and Traversal
Jakobsson, M., Leighton, T., Micali, S. M., & Szydlo, M. (2003) · Lecture notes in computer science · doi:10.1007/3-540-36563-x_21 · Cited by 105
Reducing the cost of security in link-state routing
Hauser, R. C., Przygienda, T., & Tsudik, G. (2002) · doi:10.1109/ndss.1997.579226 · Cited by 105
Efficient Protocols for Signing Routing Messages.
Zhang, K. (1998) · Cited by 99
Multi-Party Electronic Payments for Mobile Communications
Peirce, M. (2000) · Arrow@dit (Dublin Institute of Technology) · Cited by 10
Cited by
The security and privacy of smart vehicles
Hubaux, J. P., Capkun, S., & Luo, J. (2004) · IEEE Security & Privacy Magazine · doi:10.1109/msp.2004.26 · Cited by 793
Self-citationA Survey of Attacks and Countermeasures in Mobile Ad Hoc Networks
Wu, B., Chen, J., Wu, J., & Cardei, M. (2007) · Signals and Communication Technology · doi:10.1007/978-0-387-33112-6_5 · Cited by 588
Secure positioning of wireless devices with application to sensor networks
Capkun, S., & Hubaux, J.-P. (2005) · Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies. · doi:10.1109/infcom.2005.1498470 · Cited by 479
Self-citationAn RFID Distance Bounding Protocol
Hancke, G. P., & Kuhn, M. G. (2006) · First International Conference on Security and Privacy for Emerging Areas in Communications Networks (SECURECOMM'05) · doi:10.1109/securecomm.2005.56 · Cited by 478
SeRLoc: secure range-independent localization for wireless sensor networks
Lazos, L., & Poovendran, R. (2004) · Proceedings of the 3rd ACM workshop on Wireless security · doi:10.1145/1023646.1023650 · Cited by 423
Metadata
- Authors
- Čapkun, S., Buttyán, L., & Hubaux, J.-P.
- Venue
- Proceedings of the 1st ACM workshop on Security of ad hoc and sensor networks
- Publisher
- ACM
- Published
- 2003-10-31
- Pages
- 21-32
- OpenAlex
- W2167930752
- Cited by
- 411
- References
- 25
- FWCI
- 7.19
- Type
- conference paper
- Language
- en
- Open access
- green
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.