Flaws on RFID grouping-proofs. Guidelines for future sound protocols

  • Authors:

  • Pedro Peris-Lopez;Agustin Orfila;Julio C. Hernandez-Castro;Jan C. A. van der Lubbe

  • Affiliations:

  • Information Security and Privacy Lab, Faculty of Electrical Engineering, Mathematics, and Computer Science, Delft University of Technology, P.O. Box 5031, 2600 GA, Delft, The Netherlands;Information Security and Privacy Lab, Faculty of Electrical Engineering, Mathematics, and Computer Science, Delft University of Technology, P.O. Box 5031, 2600 GA, Delft, The Netherlands and Depar ...;School of Computing, Buckingham Building, Lion Terrace, Portsmouth PO1 3HE, UK;Information Security and Privacy Lab, Faculty of Electrical Engineering, Mathematics, and Computer Science, Delft University of Technology, P.O. Box 5031, 2600 GA, Delft, The Netherlands

  • Venue:
  • Journal of Network and Computer Applications
  • Year:
  • 2011

Quantified Score

Hi-index 0.00

Visualization

Abstract

During the last years many RFID authentication protocols have been proposed with major or minor success (van Deursen and Radomirovic, 2008). Juels (2004) introduced a different and novel problem that aims to evidence that two tags have been simultaneously scanned. He called this kind of evidence a yoking-proof that is supposed to be verifiable offline. Then, some authors suggested the generalization of the proof for a larger number of tags. In this paper, we review the literature published in this research topic and show the security flaws of the proposed protocols, named RFID grouping-proofs generally. More precisely, we cryptanalyze five of the most recent schemes and we also show how our techniques can be applied to older proposals. We provide some guidelines that should be followed to design secure protocols and preclude past errors. Finally, we present a yoking-proof for low-cost RFID tags, named Kazahaya, that conforms to the proposed guidelines.