An RFID Search Protocol Secured Against Relay Attack Based on Distance Bounding Approach

作者：Jannati Hoda^*; Falahati Abolfazl

来源：Wireless Personal Communications, 2015, 85(3): 711-726.

DOI：10.1007/s11277-015-2804-5

• Distance bounding protocol
• Impersonation attack
• Mafia fraud attack
• Relay attack
• RFID search protocol

RFID search protocols are suggested for the past decade to efficiently find a specific tag among a large number of tags by a reader. For instance, in a pharmacy, according to a physician prescribed data, a pharmacy staff finds a specific drug package (with an attached RFID tag) by a reader employing an RFID search protocol. This paper reveals the existing RFID search protocols are vulnerable to a relay attack. In such a relay attack, an attacker is able to introduce its desirable tag instead of the specific tag which is searched by the reader and is not in the reader's vicinity. Furthermore, in order to overcome this weakness, a new RFID search protocol using a distance bounding approach is proposed. In the proposed RFID search protocol, the reader not only authenticates the discovered tag but also establishes an upper bound for the physical distance between the discovered tag and itself. This implies the presence of the searched tag in the reader's vicinity. The analytical results for the proposed protocol show that, with the proper selection of the system parameters, the proposed search protocol provides a desirable security level against the relay attack.

• 出版日期2015-12