RFID Distance Bounding Multistate Enhancement

  • Authors:
  • Gildas Avoine;Christian Floerkemeier;Benjamin Martin

  • Affiliations:
  • Information Security Group, Université catholique de Louvain, Louvain-la-Neuve, Belgium B-1348;Auto-ID Labs, Massachusetts Institute of Technology, Cambridge, USA 02139;Information Security Group, Université catholique de Louvain, Louvain-la-Neuve, Belgium B-1348

  • Venue:
  • INDOCRYPT '09 Proceedings of the 10th International Conference on Cryptology in India: Progress in Cryptology
  • Year:
  • 2009

Quantified Score

Hi-index 0.00

Visualization

Abstract

Distance bounding protocols aim at avoiding relay attacks during an authentication process. Such protocols are especially important in RFID, where mounting a relay attack between a low-capability prover and a remote verifier is a realistic threat. Several distance bounding protocols suitable for RFID have been recently suggested, all of which aim to reduce the adversary's success probability and the number of rounds executed within the protocol. Peinado et al. introduced an efficient distance bounding protocol that uses the concept of void challenges. We present in this paper a generic technique called MUltiState Enhancement that is based on a more efficient use of void challenges. MUSE significantly improves the performances of the already-published distance bounding protocols and extends the void challenges to p-symbols.