The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
An RFID Distance Bounding Protocol
Abstract
Radio-frequency identification tokens, such as contactless smartcards, are vulnerable to relay attacks if they are used for proximity authentication. Attackers can circumvent the limited range of the radio channel using transponders that forward exchanged signals over larger distances. Cryptographic distance-bounding protocols that measure accurately the round-trip delay of the radio signal provide a possible countermeasure. They infer an upper bound for the distance between the reader and the token from the fact that no information can propagate faster than at the speed of light. We propose a new distance-bounding protocol based on ultra-wideband pulse communication. Aimed at being implementable using only simple, asynchronous, low-power hardware in the token, it is particularly well suited for use in passive low-cost tokens, noisy environments and high-speed applications.
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
RADAR: an in-building RF-based user location and tracking system
Bahl, P., & Padmanabhan, V. N. (2002) · Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064) · doi:10.1109/infcom.2000.832252 · Cited by 8,380
Cited by
RFID security and privacy: a research survey
Juels, A. (2006) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2005.861395 · Cited by 1,911
On the requirements for successful GPS spoofing attacks
Tippenhauer, N. O., Pöpper, C., Rasmussen, K. B., & Capkun, S. (2011) · Proceedings of the 18th ACM conference on Computer and communications security · doi:10.1145/2046707.2046719 · Cited by 506
Relay Attacks on Passive Keyless Entry and Start Systems in Modern Cars
Francillon, A., Danev, B., & Čapkun, S. (2011) · Repository for Publications and Research Data (ETH Zurich) · doi:10.3929/ethz-a-006708714 · Cited by 343
NFC Devices: Security and Privacy
Madlmayr, G., Langer, J., Kantner, C., & Scharinger, J. (2008) · 2008 Third International Conference on Availability, Reliability and Security · doi:10.1109/ares.2008.105 · Cited by 208
Stajano, F. (2011) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-25867-1_6 · Cited by 106
Metadata
- Authors
- Hancke, G. P., & Kuhn, M. G.
- Venue
- First International Conference on Security and Privacy for Emerging Areas in Communications Networks (SECURECOMM'05)
- Publisher
- IEEE
- Published
- 2006-03-22
- Pages
- 67-73
- OpenAlex
- W2127785555
- Cited by
- 478
- References
- 1
- FWCI
- 41.92
- 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.