CoChat

Detecting relay attacks with timing-based protocols

Open access
Reid, Jason, Nieto, Juan M. Gonzalez, Tang, Tee, Senadji, Bouchra · 2007 · Proceedings of the 2nd ACM symposium on Information, computer and communications security
Cited by 217

The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.

Abstract

Distance-bounding protocols have been proposed as a means of detecting relay attacks, also known as mafia fraud. In this paper we present the first symmetric key based distance-bounding protocol that is also resistant to so-called terrorist fraud, a variant of mafia fraud. Distance-bounding protocols require a communication channel that can exchange single bits with extremely low latency. This unconventional communication requirement has prompted Hancke and Kuhn to assert in a recent publication that ultra wide band (UWB) radio is necessary to achieve a useful distance-bounding resolution for RF security devices (contactless smart cards, RFID tags and the like). We analyse this assertion and present an alternative, novel communication approach that leverages the phenomena of side channel leakage to deliver a low latency channel. Our proposal is capable of detecting sophisticated relay attacks without resorting to the considerable expense and complexity of UWB radio. We present experimental results to support our arguments.

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.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1145/1229285.1229314

Cites

1 of 1 references verified0 citation errors · 0 not checkable

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.

A few free checks a day · papers already verified open instantly · results are public

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

Show all 1 references

Cited by

See all 217

Metadata

Authors
Reid, J., Nieto, J. M. G., Tang, T., & Senadji, B.
Venue
Proceedings of the 2nd ACM symposium on Information, computer and communications security
Publisher
ACM
Published
2007-03-20
Pages
204-213
OpenAlex
W2063068653
Cited by
217
References
1
FWCI
11.84
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

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: Detecting relay attacks with timing-based protocols. https://app.cochat.ai/papers/10.1145/1229285.1229314
The paper
Reid, J., Nieto, J. M. G., Tang, T., & Senadji, B. (2007). Detecting relay attacks with timing-based protocols. Proceedings of the 2nd ACM symposium on Information, computer and communications security. https://doi.org/10.1145/1229285.1229314

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.