The DOI matches its Crossref record; 11 of the 11 references it cites were found in a registry or an index.
A Lightweight RFID Protocol to protect against Traceability and Cloning attacks
Abstract
RFID identification is a new technology that will become ubiquitous as RFID tags will be applied to every-day items in order to yield great productivity gains or “smart” applications for users. However, this pervasive use of RFID tags opens up the possibility for various attacks violating user privacy. In this work we present an RFID authentication protocol that enforces user privacy and protects against tag cloning. We designed our protocol with both tag-to-reader and reader-to-tag authentication in mind; unless both types of authentication are applied, any protocol can be shown to be prone to either cloning or privacy attacks. Our scheme is based on the use of a secret shared between tag and database that is refreshed to avoid tag tracing. However, this is done in such a way so that efficiency of identification is not sacrificed. Additionally, our protocol is very simple and it can be implemented easily with the use of standard cryptographic hash functions. In analyzing our protocol, we identify several attacks that can be applied to RFID protocols and we demonstrate the security of our scheme. Furthermore, we show how forward privacy is guaranteed; messages seen today will still be valid in the future, even after the tag has been compromised.
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
Handbook of Applied Cryptography
Menezes, A. J., van Oorschot, P. C., & Vanstone, S. A. (2018) · CRC Press eBooks · doi:10.1201/9781439821916 · Cited by 2,896
Keying Hash Functions for Message Authentication
Bellare, M., Canetti, R., & Krawczyk, H. (1996) · Lecture Notes in Computer Science · doi:10.1007/3-540-68697-5_1 · Cited by 1,580
Security and Privacy Aspects of Low-Cost Radio Frequency Identification Systems
Weis, S. A., Sarma, S. E., Rivest, R. L., & Engels, D. W. (2004) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-39881-3_18 · Cited by 1,382
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
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
Prudent engineering practice for cryptographic protocols
Abadi, M., & Needham, R. (1996) · IEEE Transactions on Software Engineering · doi:10.1109/32.481513 · Cited by 574
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
A Scalable and Provably Secure Hash-Based RFID Protocol
Avoine, G., & Oechslin, P. (2005) · Third IEEE International Conference on Pervasive Computing and Communications Workshops · doi:10.1109/percomw.2005.12 · Cited by 333
Selecting Cryptographic Key Sizes: Extended Abstract
Lenstra, A. K., & Verheul, E. R. (2000) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-46588-1_30 · Cited by 265
RFID Traceability: A Multilayer Problem
Avoine, G., & Oechslin, P. (2005) · Lecture Notes in Computer Science · doi:10.1007/11507840_14 · Cited by 220
Lightweight Authentication Protocols for Low-Cost RFID Tags
Vajda, I. (2003) · Cited by 190
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
Towards an Analysis of Security Issues, Challenges, and Open Problems in the Internet of Things
Hossain, M. M., Fotouhi, M., & Hasan, R. (2015) · 2015 IEEE World Congress on Services · doi:10.1109/services.2015.12 · Cited by 491
Vaudenay, S. (2007) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-76900-2_5 · Cited by 390
M2AP: A Minimalist Mutual-Authentication Protocol for Low-Cost RFID Tags
Peris-Lopez, P., Hernandez-Castro, J. C., Estevez-Tapiador, J. M., & Ribagorda, A. (2006) · Lecture Notes in Computer Science · doi:10.1007/11833529_93 · Cited by 329
Metadata
- Authors
- Dimitriou, T.
- Venue
- First International Conference on Security and Privacy for Emerging Areas in Communications Networks (SECURECOMM'05)
- Publisher
- IEEE
- Published
- 2006-03-22
- Pages
- 59-66
- OpenAlex
- W2115893326
- Cited by
- 409
- References
- 11
- FWCI
- 74.67
- 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.