Paper 2011/167
Identifying Large-Scale RFID Tags Using Non-Cryptographic Approach
Yalin Chen, Jue-Sam Chou, Cheng-Lun Wu, and Chi-Fong Lin
Abstract
In this paper, we propose a new approach to identify a tag of a RFID system in constant time while keeping untraceability to the tag. Our scheme does not use any cryptographic primitives. Instead, we use a line in a plane to represent a tag. The points on the line, which are infinite and different each other, can be used as tag identification. We also explore the scalability of the proposed scheme. The result of experiments showed that a tag of the RFID system over 1,000,000 tags, embedded 3000 gates, can store 559 dynamic identity proofs.
Note: We correct a mistake. The update overhead of Alomair's scheme is O(1) rather than O(C).
Metadata
- Available format(s)
-
PDF
- Publication info
- Published elsewhere. Unknown where it was published
- Keywords
- radio frequency identificationRFIDidentification protocolprivacyuntraceabilitylocation privacyscalability
- Contact author(s)
- yalin78900 @ gmail com
- History
- 2011-04-11: revised
- 2011-04-04: received
- See all versions
- Short URL
- https://ia.cr/2011/167
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2011/167,
author = {Yalin Chen and Jue-Sam Chou and Cheng-Lun Wu and Chi-Fong Lin},
title = {Identifying Large-Scale {RFID} Tags Using Non-Cryptographic Approach},
howpublished = {Cryptology {ePrint} Archive, Paper 2011/167},
year = {2011},
url = {https://eprint.iacr.org/2011/167}
}
