Efficient RFID Search Protocols Providing Enhanced User Privacy 


Vol. 16,  No. 3, pp. 347-356, Jun.  2009
10.3745/KIPSTC.2009.16.3.347


PDF
  Abstract

In an RFID search protocol, a reader uses designated query to determine whether a specific tag is in the vicinity of the reader. This fundamental difference makes search protocol more vulnerable to replay attacks than authentication protocols. Due to this, techniques used in existing RFID authentication protocols may not be suitable for RFID search protocols. In this paper, we propose two RFID search protocols, one based on static ID and the other based on dynamic ID, which use counter to prevent replay attacks. Moreover, we propose a security model for RFID search protocols that includes forward/backward traceability, de-synchronization and forgery attack. Based on this model, we analyze security of our protocols and related works.

  Statistics


  Cite this article

[IEEE Style]

J. H. Lim, H. K. Oh, D. H. Nyang, M. K. Lee, S. J. Kim, "Efficient RFID Search Protocols Providing Enhanced User Privacy," The KIPS Transactions:PartC, vol. 16, no. 3, pp. 347-356, 2009. DOI: 10.3745/KIPSTC.2009.16.3.347.

[ACM Style]

Ji Hwan Lim, Hee Kuck Oh, Dae Hun Nyang, Mun Kyu Lee, and Sang Jin Kim. 2009. Efficient RFID Search Protocols Providing Enhanced User Privacy. The KIPS Transactions:PartC, 16, 3, (2009), 347-356. DOI: 10.3745/KIPSTC.2009.16.3.347.