A Class of Precomputation-Based Distance-Bounding Protocols

Distance-bounding protocols serve to thwart various types of proximity-based attacks, such as relay attacks. A particular class of distance-bounding protocols measures round trip times of a series of one-bit challenge-response cycles, during which the proving party must have minimal computational overhead. This can be achieved by precomputing the responses to the various possible challenges. In this paper we study this class of precomputation-based distance-bounding protocols. By designing an abstract model for these protocols, we can study their generic properties, such as security lower bounds in relation to space complexity. Further, we develop a novel family of protocols in this class that resists well to mafia fraud attacks.

[1]  Gildas Avoine,et al.  Comparing distance bounding protocols: A critical mission supported by decision theory , 2015, Comput. Commun..

[2]  Mete Akgün,et al.  Non-uniform Stepping Approach to RFID Distance Bounding Problem , 2010, DPM/SETOP.

[3]  Gildas Avoine,et al.  The Swiss-Knife RFID Distance Bounding Protocol , 2008, ICISC.

[4]  Gerhard P. Hancke,et al.  Confidence in smart token proximity: Relay attacks revisited , 2009, Comput. Secur..

[5]  Laurent Bussard,et al.  Distance-Bounding Proof of Knowledge to Avoid Real-Time Attacks , 2005, SEC.

[6]  Cédric Lauradoux,et al.  A framework for analyzing RFID distance bounding protocols , 2011, J. Comput. Secur..

[7]  Markus G. Kuhn,et al.  So Near and Yet So Far: Distance-Bounding Attacks in Wireless Networks , 2006, ESAS.

[8]  Gildas Avoine,et al.  An Efficient Distance Bounding RFID Authentication Protocol: Balancing False-Acceptance Rate and Memory Requirement , 2009, ISC.

[9]  Markus G. Kuhn,et al.  Attacks on time-of-flight distance bounding channels , 2008, WiSec '08.

[10]  Markus G. Kuhn,et al.  An RFID Distance Bounding Protocol , 2005, First International Conference on Security and Privacy for Emerging Areas in Communications Networks (SECURECOMM'05).

[11]  Gildas Avoine,et al.  The Poulidor Distance-Bounding Protocol , 2010, RFIDSec.

[12]  Süleyman Kardas,et al.  A Novel RFID Distance Bounding Protocol Based on Physically Unclonable Functions , 2011, IACR Cryptol. ePrint Arch..

[13]  Yvo Desmedt,et al.  Identification Tokens - or: Solving the Chess Grandmaster Problem , 1990, CRYPTO.

[14]  Orhun Kara,et al.  Optimal Security Limits of RFID Distance Bounding Protocols , 2010, RFIDSec.

[15]  Samy Bengio,et al.  Special Uses and Abuses of the Fiat-Shamir Passport Protocol , 1987, CRYPTO.

[16]  Cédric Lauradoux,et al.  How secret-sharing can defeat terrorist fraud , 2011, WiSec '11.

[17]  Gildas Avoine,et al.  RFID Distance Bounding Protocols with Mixed Challenges , 2011, IEEE Transactions on Wireless Communications.

[18]  Gildas Avoine,et al.  RFID Distance Bounding Multistate Enhancement , 2009, INDOCRYPT.

[19]  Rolando Trujillo-Rasua.  Complexity of distance fraud attacks in graph-based distance bounding , 2013, MobiQuitous.

[20]  Srdjan Capkun,et al.  Location privacy of distance bounding protocols , 2008, CCS.

[21]  Jorge Munilla,et al.  Distance bounding protocols for RFID enhanced by using void-challenges and analysis in noisy channels , 2008, Wirel. Commun. Mob. Comput..

[22]  Srdjan Capkun,et al.  SECTOR: secure tracking of node encounters in multi-hop wireless networks , 2003, SASN '03.

[23]  Gildas Avoine,et al.  Distance Bounding Facing Both Mafia and Distance Frauds , 2014, IEEE Transactions on Wireless Communications.