An RFID Distance Bounding Protocol Based on Cryptographic Puzzles Providing Strong Privacy and Computational Efficiency 


Vol. 19,  No. 1, pp. 9-18, Feb.  2012
10.3745/KIPSTC.2012.19.1.9


PDF
  Abstract

In 2010, Pedro et al. proposed RFID distance bounding protocol based on WSBC cryptographic puzzle. This paper points out that Pedro et al.`s protocol not only is vulnerable to tag privacy invasion attack and location tracking attack because an attacker can easily obtain the secret key(ID) of a legal tag from the intercepted messages between the reader and the tag, but also requires heavy computation by performing symmetric key operations of the resource limited passive tag and many communication rounds between the reader and the tag. Moreover, to resolve the security weakness and the computation/communication efficiency problems, this paper also present a new RFID distance bounding protocol based on WSBC cryptographic puzzle that can provide strong security and high efficiency. As a result, the proposed protocol not only provides computational and communicational efficiency because it requires secure one-way hash function for the passive tag and it reduces communication rounds, but also provides strong security because both tag and reader use secure one-way hash function to protect their exchanging messages.

  Statistics


  Cite this article

[IEEE Style]

H. S. Ahn, E. J. Yoon, I. G. Nam, "An RFID Distance Bounding Protocol Based on Cryptographic Puzzles Providing Strong Privacy and Computational Efficiency," The KIPS Transactions:PartC, vol. 19, no. 1, pp. 9-18, 2012. DOI: 10.3745/KIPSTC.2012.19.1.9.

[ACM Style]

Hae Soon Ahn, Eun Jun Yoon, and In Gil Nam. 2012. An RFID Distance Bounding Protocol Based on Cryptographic Puzzles Providing Strong Privacy and Computational Efficiency. The KIPS Transactions:PartC, 19, 1, (2012), 9-18. DOI: 10.3745/KIPSTC.2012.19.1.9.