Efficient RFID Search Protocols Using Counters

In an RFID search protocol, a reader uses a designated query instead of an unspecified query commonly used in RFID authentication protocols. Due to this fundamental difference, techniques used in RFID authentication protocols may not be suitable for RFID search protocols. Tan et al.'s protocol, however, is based on techniques used in previous works such as using random values. In this paper, we propose two RFID search protocols, one based on static ID and the other based on dynamic ID, both which does not require additional measures to satisfy security requirements of RFID protocols. We achieve this by using counters.

[1]  Dongho Won,et al.  Challenge-Response Based RFID Authentication Protocol for Distributed Database Environment , 2005, SPC.

[2]  Bo Sheng,et al.  Severless Search and Authentication Protocols for RFID , 2007, Fifth Annual IEEE International Conference on Pervasive Computing and Communications (PerCom'07).

[3]  Tassos Dimitriou,et al.  A Lightweight RFID Protocol to protect against Traceability and Cloning attacks , 2005, First International Conference on Security and Privacy for Emerging Areas in Communications Networks (SECURECOMM'05).

[4]  Paul Müller,et al.  Hash-based enhancement of location privacy for radio-frequency identification devices using varying identifiers , 2004, IEEE Annual Conference on Pervasive Computing and Communications Workshops, 2004. Proceedings of the Second.

[5]  Hiroto Yasuura,et al.  Unlinkable Identification for Large-scale RFID Systems , 2006 .

[6]  Dong Hoon Lee,et al.  Efficient Authentication for Low-Cost RFID Systems , 2005, ICCSA.