Optimal Security Limits of RFID Distance Bounding Protocols

Kara O., Kardas S., Bingol M. A., Avoine G.

6th Workshop on Radio Frequency Identification Security, İstanbul, Turkey, 8 - 09 June 2010, vol.6370, pp.220-223 identifier

  • Publication Type: Conference Paper / Full Text
  • Volume: 6370
  • City: İstanbul
  • Country: Turkey
  • Page Numbers: pp.220-223
  • Istanbul Technical University Affiliated: No


In this paper, we classify the RFID distance bounding protocols having bitwise fast phases and no final signature. We also give the theoretical security bounds for two specific classes, leaving the security bounds for the general case as an open problem. As for the classification, we introduce the notion of k-previous challenge dependent (k-POD) protocols where each response bit depends on the current and k-previous challenges and there is no final signature. We treat the case k = 0, which means each response bit depends only on the current challenge, as a special case and define such protocols as current challenge dependent (CCD) protocols. In general, we construct a trade-off curve between the security levels of mafia and distance frauds by introducing two generic attack algorithms. This leads to the conclusion that CCD protocols cannot attain the ideal security against distance fraud, i.e. 1/2, for each challenge-response bit, without totally losing the security against mafia fraud. We extend the generic attacks to 1-PCD protocols and obtain a trade-off curve for 1-PCD protocols pointing out that 1-PCD protocols can provide better security than CCD protocols. Thereby, we propose a natural extension of a CCD protocol to a 1-PCD protocol in order to improve its security. As a study case, we give two natural extensions of Hancke and Kuhn protocol to show how to enhance the security against either mafia fraud or distance fraud without extra cost.