A scalable and provably secure hash-based RFID protocol

By Gildas Avoine, Philippe Oechslin. Third IEEE International Conference on Pervasive Computing and Communications Workshops, 2005

371 citations recorded by the source corpus.

Subfields: Artificial Intelligence, Computer Networks and Communications, Media Technology

View Paper: https://www.semanticscholar.org/paper/56710c6be111b9e78111b67f26c74216c76b3219

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Artificial Intelligence

1. Thomas Peyrin
2. Jian Guo
3. Gene Tsudik
4. Mohammad Ilyas
5. David A. Molnar
6. David A. Wagner
7. Ari Juels
8. Axel York Poschmann

In Computer Networks and Communications

1. Ari Juels
2. Gene Tsudik
3. Tassos Dimitriou
4. Mohammad Ilyas
5. Syed A. Ahson
6. Jean-Pierre Hubaux
7. David A. Wagner
8. Serge Vaudenay

In Media Technology

1. Ari Juels
2. Gene Tsudik
3. Tassos Dimitriou
4. Mohammad Ilyas
5. Syed A. Ahson
6. David A. Molnar
7. David A. Wagner
8. Jean-Pierre Hubaux

Citations in the corpus

• A Lightweight RFID Protocol to protect against Traceability and Cloning attacks (2005, background): “Although in [5] a time-space memory tradeoff is presented that reduces the scalability problem, perhaps more important from a security point of view is that an attacker can still query the tag then replay the tag’s response to authenticate itself to a valid reader.”
• YA-TRAP: yet another trivial RFID authentication protocol (2006, methodology): “While we use [2] as one point of comparison, a recent protocol by Avoine and Oechslin [3] is similar in spirit (but very different in technical details) from YA-TRAP.”
• RFID Handbook: Applications, Technology, Security, and Privacy (2008, methodology): “■Hash Function Hash-based schemes [3, 10–16] use a hash function as a cryptographic function.”
• A Scalable, Delegatable Pseudonym Protocol Enabling Ownership Transfer of RFID Tags (2005, background): “Scheme TReader SReader TTC STC # Msg Comm Delegation? OSK [8] O(N) O(N) NA NA 1 O(1) No AO [1] O(N) O(N) NA NA 1 O(1) No”
• The PHOTON Family of Lightweight Hash Functions (2011, background): “These two security aspects have already been considerably studied and, interestingly, in most of the privacy-preserving RFID protocols proposed [6, 34, 44] a hash function is required.”
• RFID security and privacy: a research survey (2006, background): “Avoine, Dysli, and Oechslin (ADO) [12], [14] observe that the problem of symmetric-key search for readers in privacypreserving RFID systems is nearly identical with that of breaking keys.”