Secure and efficient lightweight RFID authentication protocol based on fast tag indexing

Abstract

SUMMARYDuring the radio-frequency identification authentication process, it is of great significance to quickly find out the target tag from all tags stored in the database, because it affects the authentication performance to a great extent. Most of the existing schemes use the Hash or pseudorandom number generator operation to locate the target tag, but if the number of tags is extremely large, vast Hash or pseudorandom number generator operations may take much time and lower the authentication efficiency. To locate the target tag quickly, the RAP and LADP protocols adopt the simple value comparison method, and the back-end server can easily find the target tag by directly comparing the received index-pseudonym value with those stored in the database. This method does improve the authentication performance, but it results that these schemes suffer from the tag tracking attack. Motivated by these concerns, we propose a novel tag indexing method called the two-layer tag indexing mechanism, and at the same time, we give a lightweight radio-frequency identification authentication protocol based on it. Analyses show that our scheme can effectively resist the tag tracking attack and is almost as efficient as the RAP and LADP protocols in indexing tags.

On the security of an RFID‐based parking lot management system

“…supplants the reader and sends 16 − 1 does as follows: supplants the reader and sends 16 − 1 does as follows:…”

“…The complexity of the proposed attack is eavesdropping one session of the protocol, impersonating the reader to the tag 2 times and doing 2 16 evaluations of the given attack. The complexity of the proposed attack is eavesdropping one session of the protocol, impersonating the reader to the tag 2 times and doing 2 16 evaluations of the given attack.…”

“…Because Chen and Chong's scheme has used 16-bit messages based on EPC C1-G2 standard, the attacker can obtain the parameters easily by a lookup table in 2 16 tries. Because Chen and Chong's scheme has used 16-bit messages based on EPC C1-G2 standard, the attacker can obtain the parameters easily by a lookup table in 2 16 tries.…”

“…Although this protocol is vulnerable, it was used as the basic theory for grouping proof authentication protocols. Kazahaya protocol is vulnerable and an adversary easily can disclose secret parameters by 2 16 tries, because the length of registers is 16-bit. [18][19][20][21] For instance, Ko et al proposed an Elliptic Curves Cryptorgraphy-based grouping proof to increase inpatient medication safety.…”

“…[11][12][13] Requirements of cost and energy consumption in large-scale systems lead usually low-cost passive tags are used in the most RFID-based parking lot management systems. [14][15][16] Recently, Chen and Chong proposed a new grouping proof scheme to prevent from car theft in parking lot management systems. 13 When in an authentication process 2 or more tags are participated, it is called Grouping Proof.…”