Randomized Pseudo-random Function Tree Walking Algorithm for Secure Radio-Frequency Identification

Authors:
Leonid Bolotnyy;Gabriel Robins
Affiliations:
University of Virginia;University of Virginia
Venue:
AUTOID '05 Proceedings of the Fourth IEEE Workshop on Automatic Identification Advanced Technologies
Year:
2005

Citing 0
Cited 4

Fast and reliable estimation schemes in RFID systems

Proceedings of the 12th annual international conference on Mobile computing and networking
Multi-tag RFID systems

International Journal of Internet Protocol Technology
Tag identifiable probability study while reader collision occurs

WiCOM'09 Proceedings of the 5th International Conference on Wireless communications, networking and mobile computing
Review: Privacy versus scalability in radio frequency identification systems

Computer Communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

Privacy and security are two main concerns in Radio Frequency Identification (RFID) systems. We first extend the analysis of the Randomized Tree Walking Algorithm for RFID tag collision avoidance, which is secure against passive adversaries. Then, we devise a new Randomized Pseudo-Random Function (PRF) Tree Walking Algorithm, which is secure against active eavesdroppers and allows for the efficient interrogation of many tags. Our algorithm accommodates the addition and removal of tags from the system, and dynamically adapts to security and privacy policy changes.