Details

Autor(en) / Beteiligte

• Kim, Chong Hee
• Avoine, Gildas
• Koeune, François
• Standaert, François-Xavier
• Pereira, Olivier

Titel

The Swiss-Knife RFID Distance Bounding Protocol

Ist Teil von

• Information Security and Cryptology – ICISC 2008, p.98-115

Ort / Verlag

Berlin, Heidelberg: Springer Berlin Heidelberg

Link zum Volltext

Quelle

Alma/SFX Local Collection

Beschreibungen/Notizen

• Relay attacks are one of the most challenging threats RFID will have to face in the close future. They consist in making the verifier believe that the prover is in its close vicinity by surreptitiously forwarding the signal between the verifier and an out-of-field prover. Distance bounding protocols represent a promising way to thwart relay attacks, by measuring the round trip time of short authenticated messages. Several such protocols have been designed during the last years but none of them combine all the features one may expect in a RFID system. We introduce in this paper the first solution that compounds in a single protocol all these desirable features. We prove, with respect to the previous protocols, that our proposal is the best one in terms of security, privacy, tag computational overhead, and fault tolerance. We also point out a weakness in Tu and Piramuthu’s protocol, which was considered up to now as one of the most efficient distance bounding protocol.