Scalable RFID Systems: A Privacy-Preserving Protocol with Constant-Time Identification

Abstract

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.

A New Scalable RFID Delegation Protocol

“…-Learning phase: A chooses two fresh tags (T 0 , T 1 ), and R. A makes queries on T 0 , T 1 -Guess phase: If ψ , = ψ 0 , A guesses b = 0 and decides…”

“…Consumer products identification, inventory control and contact less credit-card are the applications where RFID devices are deployed [1,2]. However, the widespread application of RFID systems to supply-chain management may expose challenging security issues either to corporations or to individuals [3,4].…”

F-HB+: A Scalable Authentication Protocol for Low-Cost RFID Systems

“…But it is difficult to validate that the output of a PRF possesses the collision-free property. Two further protocols in this class (Song, 2009;Alomair et al, 2010) require the help of the reader to update pseudonyms and send the updated pseudonyms to tags, which does not relieve the burden on the tag and adds to the risk of desynchronization. The desynchronization threats in the above protocols can be alleviated by using more than one pseudonym for a secret key.…”

“…The advantage of this method is that it supports dynamic scalability, so that new tag entries can be easily added without affecting the operation of the protocol. The third category of scalable protocols are hash-table based protocols (Henrici and Muller, 2004;Dimitriou, 2005;Tsudik, 2006;Lim and Kwon, 2006;Le et al, 2007;Song, 2009;Alomair et al, 2010;Cao & O'Neill, 2011). These protocols require only constant-time, , running time to identify a tag.…”

An Improved Lightweight RFID Mutual-authentication Protocol

“…The attacker can analyze the reply information of the tag by constantly asking the tags, and then all the key information stored in the tag can be deduced completely; The proposed authentication scheme proposed in the literature [10] cannot provide backward privacy security; The proposed scheme in the literature [11] can not resist brute force attacks, because R1 and R2 use cleartext, so an attacker can easily access the R1 and R2, using the exhaustive method can derive the stored key information from the tag; The literature [12] proposed cross bit operation according to the knowledge of genetic algorithms Cro (X, Y) , with the combination of XOR and Rot algorithm CURAP is proposed, but CURAP is too complex in the operation, and do not make use of their own label information stored, at the same time, after each certification ended, the need to update the content too much, which will to increase the amount of calculation and the increase of storage space, and the analysis shows that the protocol security is insufficient. According to the existing research results, this paper combines CRC and Cro algorithm proposed an improved lightweight RFID mutual authentication protocol.…”