Paper 2008/476

The Ff-Family of Protocols for RFID-Privacy and Authentication

Erik-Oliver Blass, Anil Kurmus, Refik Molva, Guevara Noubir, and Abdullatif Shikfa

Abstract

In this paper, we present the design of the lightweight Ff family of privacy-preserving authentication protocols for RFID-systems. Ff is based on a new algebraic framework for reasoning about and analyzing this kind of authentication protocols. Ff offers user-adjustable, strong authenticity and privacy against known algebraic and also recent SAT-solving attacks. In contrast to related work, achieves these two security properties without requiring an expensive cryptographic hash function. is designed for a challenge-response protocol, where the tag sends random nonces and the results of HMAC-like computations of one of the nonces together with its secret key. In this paper, the authenticity and privacy of is evaluated using analytical and experimental methods.

Metadata
Available format(s)
PDF PS
Publication info
Published elsewhere. Unknown where it was published
Keywords
RFIDauthenticationprivacy
Contact author(s)
erik-oliver blass @ eurecom fr
History
2008-11-18: received
Short URL
https://ia.cr/2008/476
License
Creative Commons Attribution
CC BY

BibTeX

@misc{cryptoeprint:2008/476,
      author = {Erik-Oliver Blass and Anil Kurmus and Refik Molva and Guevara Noubir and Abdullatif Shikfa},
      title = {The $F_f$-Family of Protocols for {RFID}-Privacy and Authentication},
      howpublished = {Cryptology {ePrint} Archive, Paper 2008/476},
      year = {2008},
      url = {https://eprint.iacr.org/2008/476}
}
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.