RFID security without extensive cryptography
The DOI matches its Crossref record; 14 of the 14 references it cites were found in a registry or an index.
Abstract
A Radio Frequency Identification Device (RFID) allows effective identification of a large number of tagged objects without physical or visual contact. RFID systems are a promising technology for supply chain management and inventory control. As individual item tagging becomes a reality, privacy concerns over RFID use come to the fore. The shared radio medium allow eavesdropping and unauthorized tag reading which poses threats to individual's privacy. Moreover, due to the mode of use of RFIDs, new threats emerge. For example, an intruder may be able to track the movement of an individual by repeatedly querying an RFID attached to the item that this individual carries. The limited size and cost considerations do not allow to implement conventional cryptographic systems on RFIDs. In this paper we propose an efficient RFID tag identification algorithm that incorporates reader-authentication. Our algorithm is secure against the anticipated threats to RFID systems. Our algorithm does not require computationally expensive cryptographic mechanisms, it relies on rather simple matrix multiplication. To further enhance the utility of our algorithm we propose a scheme that allows for the algorithm to carry out secure identification of multiple tags simultaneously.
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.
Integrity signals
Registry
Cites
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.
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
Lecture Notes in Computer Science 1205
(1999) · Industrial Robot: An International Journal · doi:10.1108/ir.1999.04926fae.001 · Cited by 38,662
Cryptography and Network Security: Principles and Practice
Stallings, W. (1998) · Cited by 4,392
Rfid Handbook: Fundamentals and Applications in Contactless Smart Cards and Identification
Finkenzeller, K. (2003) · Thammasat University Digital Collections · Cited by 2,150
RFID Handbook: Fundamentals and Applications in Contactless Smart Cards and Identification
Finkenzeller, K. (2003) · Wiley eBooks · doi:10.1002/0470868023 · Cited by 1,952
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 · cited 1×
“A few RFID security schemes [1, 4, 9, 11, 12] employ tagside cryptographic encryption, random numbers or cryptographic hash.”
MethodThe 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 · cited 4×
“Juels et al [8] consider erasing the information from the tag after it has been scanned.”
BackgroundInfluentialStrong 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 · cited 1×
“A few RFID security schemes [1, 4, 9, 11, 12] employ tagside cryptographic encryption, random numbers or cryptographic hash.”
MethodPrivacy 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 · cited 5×
“For example, libraries can use RFID tags to track books [9]; toll booths can automatically collect toll by inspecting a tag attached to the windshield of a car.”
BackgroundMethodInfluentialHenrici, 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 · cited 1×
“A few RFID security schemes [1, 4, 9, 11, 12] employ tagside cryptographic encryption, random numbers or cryptographic hash.”
MethodUniversal Re-encryption for Mixnets
Golle, P., Jakobsson, M., Juels, A., & Syverson, P. (2004) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-24660-2_14 · Cited by 412 · cited 2×
“Golle et al [3] propose an elegant security infrastructure.”
BackgroundMinimalist Cryptography for Low-Cost RFID Tags
Juels, A. (2003) · Cited by 358
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 · cited 3×
“[7] Ari Juels and Ravikanth Pappu.”
BackgroundInfluentialMinimalist Cryptography for Low-Cost RFID Tags (Extended Abstract)
Juels, A. (2005) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-30598-9_11 · Cited by 194
Soft blocking: flexible blocker tags on the cheap
Juels, A., & Brainard, J. (2004) · ACM Workshop on Privacy in the Electronic Society (WPES) · doi:10.1145/1029179.1029181 · Cited by 116 · cited 3×
“Juels and Brainard [6] propose a similar soft blocker tag scheme.”
BackgroundInfluential
Cited by
Ferrag, M. A., Maglaras, L., Argyriou, A., Kosmanos, D., & Janicke, H. (2018) · Journal of Network and Computer Applications · doi:10.1016/j.jnca.2017.10.017 · Cited by 274
Low-Energy Security: Limits and Opportunities in the Internet of Things
Trappe, W., Howard, R., & Moore, R. S. (2015) · IEEE Security & Privacy · doi:10.1109/msp.2015.7 · Cited by 246
RFID authentication protocol for low-cost tags
Song, B., & Mitchell, C. J. (2008) · Proceedings of the first ACM conference on Wireless network security · doi:10.1145/1352533.1352556 · Cited by 243
Metadata
- Authors
- Karthikeyan, S., & Nesterenko, M.
- Venue
- Proceedings of the 3rd ACM workshop on Security of ad hoc and sensor networks
- Publisher
- ACM
- Published
- 2005-11-07
- Pages
- 63-67
- OpenAlex
- W2048148451
- Cited by
- 174
- References
- 14
- FWCI
- 21.48
- 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.