Optimal security limits of RFID distance bounding protocols

Orhun, Kara and Kardaş, Süleyman and Bingöl, Muhammed Ali and Avoine, Gildas (2010) Optimal security limits of RFID distance bounding protocols. In: 6th Workshop on RFID Security (RFIDSec10), Istanbul, Turkey

[thumbnail of This is a RoMEO green publisher -- author can archive post-print (ie final draft post-refereeing)] PDF (This is a RoMEO green publisher -- author can archive post-print (ie final draft post-refereeing))

Download (477kB)


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-PCD) 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.
Item Type: Papers in Conference Proceedings
Uncontrolled Keywords: RFID, distance bounding protocol, security, mafia fraud, distance fraud
Subjects: T Technology > T Technology (General)
Q Science > Q Science (General)
Q Science > QA Mathematics
Divisions: Faculty of Engineering and Natural Sciences > Academic programs > Computer Science & Eng.
Faculty of Engineering and Natural Sciences
Depositing User: Süleyman Kardaş
Date Deposited: 25 Nov 2010 21:07
Last Modified: 26 Apr 2022 08:58
URI: https://research.sabanciuniv.edu/id/eprint/15328

Actions (login required)

View Item
View Item