RFID Distance Bounding Multistate Enhancement

Avoine, Gildas;Floerkemeier, Christian;Martin, Benjamin
(2009) Progress in Cryptology - INDOCRYPT 2009. 10th International Conference on Cryptology in India — Location: New Delhi, India (13.December.2009)

Files

distance.pdf
  • Restricted Access
  • Adobe PDF
  • 336.44 KB
Request a copy

Details

Authors
  • Avoine, GildasUCL EPL/INGI
    Author
  • Floerkemeier, ChristianMassachusetts Institute of Technology Auto-ID Labs Cambridge, MA 02139, USA
    Author
  • Martin, BenjaminUCL EPL/INGI
    Author
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.
Affiliations

Citations

  • APA
  • Chicago
  • FWB

Avoine, G., Floerkemeier, C., & Martin, B. (2009). RFID Distance Bounding Multistate Enhancement. In Roy, B.; Sendrier, N.; (ed.), Progress in Cryptology - INDOCRYPT 2009. 10th International Conference on Cryptology in India (p. p. 290-307). Springer verlag. https://doi.org/10.1007/978-3-642-10628-6_20