[en] 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. We formalize 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 present a novel family of protocols in this class that resists well to mafia fraud attacks.
Disciplines :
Computer science
Author, co-author :
Mauw, Sjouke ; University of Luxembourg > Faculty of Science, Technology and Communication (FSTC) > Computer Science and Communications Research Unit (CSC)
Toro Pozo, Jorge Luis ; University of Luxembourg > Faculty of Science, Technology and Communication (FSTC) > Computer Science and Communications Research Unit (CSC)
Trujillo Rasua, Rolando ; University of Luxembourg > Interdisciplinary Centre for Security, Reliability and Trust (SNT)
Language :
English
Title :
A class of precomputation-based distance-bounding protocols
Publication date :
16 March 2016
Number of pages :
2
Event name :
Grande Region Security and Reliability Day 2016
Event organizer :
LORIA-INRIA Nancy
Event place :
Nancy, France
Event date :
16-03-2016
Audience :
International
Focus Area :
Security, Reliability and Trust
FnR Project :
FNR10188265 - Symbolic Verification Of Distance-bounding And Multiparty Authentication Protocols, 2015 (01/06/2015-31/05/2019) - Jorge Luis Toro Pozo