[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. 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.
Disciplines :
Sciences informatiques
Auteur, co-auteur :
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)
Co-auteurs externes :
no
Langue du document :
Anglais
Titre :
A Class of Precomputation-based Distance-bounding Protocols
Date de publication/diffusion :
2016
Nom de la manifestation :
2016 IEEE European Symposium on Security and Privacy
Lieu de la manifestation :
Saarbrücken, Allemagne
Date de la manifestation :
from 21-03-2016 to 24-03-2016
Manifestation à portée :
International
Titre de l'ouvrage principal :
Proceedings of the 1st IEEE European Symposium on Security and Privacy
ISBN/EAN :
978-1-5090-1751-5
Peer reviewed :
Peer reviewed
Focus Area :
Security, Reliability and Trust
Projet FnR :
FNR10188265 - Symbolic Verification Of Distance-bounding And Multiparty Authentication Protocols, 2015 (01/06/2015-31/05/2019) - Jorge Luis Toro Pozo
