The DOI matches its Crossref record.
RFID security without extensive cryptography
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
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
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
- 0
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: RFID security without extensive cryptography. https://app.cochat.ai/papers/10.1145/1102219.1102229
- The paper
- Karthikeyan, S., & Nesterenko, M. (2005). RFID security without extensive cryptography. Proceedings of the 3rd ACM workshop on Security of ad hoc and sensor networks. https://doi.org/10.1145/1102219.1102229
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.