Advertisement

RFID Distance Bounding Protocol with Mixed Challenges to Prevent Relay Attacks

  • Chong Hee Kim
  • Gildas Avoine
Part of the Lecture Notes in Computer Science book series (LNCS, volume 5888)

Abstract

RFID systems suffer from different location-based attacks such as distance fraud, mafia fraud and terrorist fraud attacks. Among them mafia fraud attack is the most serious since this attack can be mounted without the notice of both the reader and the tag. An adversary performs a kind of man-in-the-middle attack between the reader and the tag. It is very difficult to prevent this attack since the adversary does not change any data between the reader and the tag. Recently distance bounding protocols measuring the round-trip time between the reader and the tag have been researched to prevent this attack.

All the existing distance bounding protocols based on binary challenges, without final signature, provide an adversary success probability equal to (3/4) n where n is the number of rounds in the protocol. In this paper, we introduce a new protocol based on binary mixed challenges that converges toward the expected and optimal (1/2) n bound. We prove its security in case of both noisy and non-noisy channels.

Keywords

RFID authentication distance bounding protocol relay attack 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Brands, S., Chaum, D.: Distance-Bounding Protocols. In: Helleseth, T. (ed.) EUROCRYPT 1993. LNCS, vol. 765, pp. 344–359. Springer, Heidelberg (1994)Google Scholar
  2. 2.
    Desmedt, Y.: Major security problems with the Unforgeable Feige)-Fiat-Shamir proofs of identiy and how to overcome them. In: SecuriCom 1988, pp. 15–17 (1988)Google Scholar
  3. 3.
    Hancke, G., Kuhn, M.: An RFID distance bounding protocol. In: The 1st International Conference on Security and Privacy for Emergin Areas in Communications Networks (SECURECOMM 2005), pp. 67–73. IEEE Computer Society, Los Alamitos (2005)CrossRefGoogle Scholar
  4. 4.
    Munilla, J., Ortiz, A., Peinado, A.: Distance bounding protocols with void-challenges for RFID. In: Workshop on RFID Security - RFIDSec 2006 (2006)Google Scholar
  5. 5.
    Munilla, J., Peinado, A.: Distance bounding protocols for RFID enhanced by using void-challenges and analysis in noisy channels. Wireless communications and mobile computing. Published online, an earlier version appears in [4], January 17 (2008) Google Scholar
  6. 6.
    Singelée, D., Preneel, B.: Distance bounding in noisy environments. In: Stajano, F., Meadows, C., Capkun, S., Moore, T. (eds.) ESAS 2007. LNCS, vol. 4572, pp. 101–115. Springer, Heidelberg (2007)CrossRefGoogle Scholar
  7. 7.
    Tu, Y.-J., Piramuthu, S.: RFID distance bounding protocols. In: The 1st International EURASIP Workshop in RFID Technology, Vienna, Austria (2007)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2009

Authors and Affiliations

  • Chong Hee Kim
    • 1
  • Gildas Avoine
    • 1
  1. 1.Université catholique de LouvainLouvain-la-NeuveBelgium

Personalised recommendations