Issue No.03 - May/June (2011 vol.8)
Anil Kurmus , IBM, Zurich
Refik Molva , EURECOM, Sophia Antipolis
Erik-Oliver Blass , EURECOM, Sophia Antipolis
Abdullatif Shikfa , EURECOM, Sophia Antipolis
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/TDSC.2010.37
In this paper, we present the design of the lightweight F_f family of privacy-preserving authentication protocols for RFID-systems. F_f results from a systematic design based on a new algebraic framework focusing on the security and privacy of RFID authentication protocols. F_f offers user-adjustable, strong authentication, and privacy against known algebraic attacks and recently popular SAT-solving attacks. In contrast to related work, F_f achieves these security properties without requiring an expensive cryptographic hash function. F_f 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 back to the reader. In this paper, the authentication and privacy of F_f is evaluated using analytical and experimental methods.
Lightweight RFID security, authentication, privacy, algebraic attacks, SAT-solving, LPN.
Anil Kurmus, Refik Molva, Erik-Oliver Blass, Abdullatif Shikfa, "The F_f-Family of Protocols for RFID-Privacy and Authentication", IEEE Transactions on Dependable and Secure Computing, vol.8, no. 3, pp. 466-480, May/June 2011, doi:10.1109/TDSC.2010.37