The DOI matches its Crossref record; 12 of the 12 references it cites were found in a registry or an index.
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
Cites
The blocker tag: selective blocking of RFID tags for consumer privacy
Juels, A., Rivest, R. L., & Szydlo, M. (2003) · Proceedings of the 10th ACM conference on Computer and communications security · doi:10.1145/948109.948126 · Cited by 807
Strong Authentication for RFID Systems Using the AES Algorithm
Feldhofer, M., Dominikus, S., & Wolkerstorfer, J. (2004) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-28632-5_26 · Cited by 715
A cryptanalytic time-memory trade-off
Hellman, M. (1980) · IEEE Transactions on Information Theory · doi:10.1109/tit.1980.1056220 · Cited by 701
Privacy and security in library RFID: issues, practices, and architectures
Molnar, D., & Wagner, D. (2004) · Proceedings of the 11th ACM conference on Computer and communications security · doi:10.1145/1030083.1030112 · Cited by 681
RFID Systems and Security and Privacy Implications
Sarma, S. E., Weis, S. A., & Engels, D. W. (2003) · Lecture Notes in Computer Science · doi:10.1007/3-540-36400-5_33 · Cited by 547
Henrici, D., & Muller, P. (2004) · IEEE Annual Conference on Pervasive Computing and Communications Workshops, 2004. Proceedings of the Second · doi:10.1109/percomw.2004.1276922 · Cited by 508
Making a Faster Cryptanalytic Time-Memory Trade-Off
Oechslin, P. (2003) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-45146-4_36 · Cited by 494
Self-citationMinimalist Cryptography for Low-Cost RFID Tags
Juels, A. (2003) · Cited by 357
Squealing Euros: Privacy Protection in RFID-Enabled Banknotes
Juels, A., & Pappu, R. (2003) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-45126-6_8 · Cited by 347
RFID Traceability: A Multilayer Problem
Avoine, G., & Oechslin, P. (2005) · Lecture Notes in Computer Science · doi:10.1007/11507840_14 · Cited by 220
Self-citation
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 Comprehensive Study of Security of Internet-of-Things
Mosenia, A., & Jha, N. K. (2017) · IEEE Transactions on Emerging Topics in Computing · doi:10.1109/tetc.2016.2606384 · Cited by 806
The PHOTON Family of Lightweight Hash Functions
Guo, J., Peyrin, T., & Poschmann, A. (2011) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-22792-9_13 · Cited by 558
A Lightweight RFID Protocol to protect against Traceability and Cloning attacks
Dimitriou, T. (2006) · First International Conference on Security and Privacy for Emerging Areas in Communications Networks (SECURECOMM'05) · doi:10.1109/securecomm.2005.4 · Cited by 409
Cardinality Estimation for Large-Scale RFID Systems
Qian, C., Ngan, H., Liu, Y., & Ni, L. M. (2011) · IEEE Transactions on Parallel and Distributed Systems · doi:10.1109/tpds.2011.36 · Cited by 292
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
- 12
- 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
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.