The DOI matches its Crossref record.
A Scalable and Provably Secure Hash-Based RFID Protocol
Open accessAbstract
The biggest challenge for RFID technology is to provide benefits without threatening the privacy of consumers. Many solutions have been suggested but almost as many ways have been found to break them. An approach by Ohkubo, Suzuki and Kinoshita using an internal refreshment mechanism seems to protect privacy well but is not scalable. We introduce a specific time-memory trade-off that removes the scalability issue of this scheme. Additionally we prove that the system truly offer's privacy and even forward privacy. Our third contribution is an extension of the scheme which offers a secure communication channel between RFID tags and their owner using building blocks that are already available on the tag. Finally we give a typical example of use of our system and show its feasibility by calculating all the parameters.
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
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
A Scalable, Delegatable Pseudonym Protocol Enabling Ownership Transfer of RFID Tags
Molnar, D., Soppera, A., & Wagner, D. (2006) · Lecture Notes in Computer Science · doi:10.1007/11693383_19 · Cited by 270
Metadata
- Authors
- Avoine, G., & Oechslin, P.
- Venue
- Third IEEE International Conference on Pervasive Computing and Communications Workshops
- Publisher
- IEEE
- Published
- 2005-04-01
- Pages
- 110-114
- OpenAlex
- W2148579805
- Cited by
- 333
- References
- 0
- FWCI
- 71.39
- 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: A Scalable and Provably Secure Hash-Based RFID Protocol. https://app.cochat.ai/papers/10.1109/percomw.2005.12
- The paper
- Avoine, G., & Oechslin, P. (2005). A Scalable and Provably Secure Hash-Based RFID Protocol. Third IEEE International Conference on Pervasive Computing and Communications Workshops. https://doi.org/10.1109/percomw.2005.12
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.
