Issue No. 08 - Aug. (2012 vol. 23)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/TPDS.2011.290
Basel Alomair , King Abdulaziz City for Science and Technology (KACST), Riyadh
Andrew Clark , University of Washington, Seattle
Jorge Cuellar , Corporate Research and Technologies, CT T DE IT1, CERT, Munich
Radha Poovendran , Unversity of Washington, Seattle
In RFID literature, most “privacy-preserving” protocols require the reader to search all tags in the system in order to identify a single tag. In another class of protocols, the search complexity is reduced to be logarithmic in the number of tags, but it comes with two major drawbacks: it requires a large communication overhead over the fragile wireless channel, and the compromise of a tag in the system reveals secret information about other, uncompromised, tags in the same system. In this work, we take a different approach to address time complexity of private identification in large-scale RFID systems. We utilize the special architecture of RFID systems to propose a symmetric-key privacy-preserving authentication protocol for RFID systems with constant-time identification. Instead of increasing communication overhead, the existence of a large storage device in RFID systems, the database, is utilized for improving the time efficiency of tag identification.
RFID, privacy, authentication, identification, scalability.
A. Clark, J. Cuellar, R. Poovendran and B. Alomair, "Scalable RFID Systems: A Privacy-Preserving Protocol with Constant-Time Identification," in IEEE Transactions on Parallel & Distributed Systems, vol. 23, no. , pp. 1536-1550, 2011.