Randomized pseudo-random function tree walking algorithm for secure radio-frequency identification

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. 1