Autor segons l'article: Gil-Pons, R; Mauw, S; Trujillo-Rasua, R
Departament: Enginyeria Informàtica i Matemàtiques
Autor/s de la URV: Trujillo Rasua, Rolando
Paraules clau: Security Mafia fraud Distance fraud Distance bounding security mafia fraud distance fraud
Resum: Distance-bounding protocols are security protocols with a time measurement phase used to detect relay attacks, whose security is typically measured against mafia-fraud and distance-fraud attacks. A prominent subclass of distance-bounding protocols, known as lookup-based protocols, use simple lookup operations to diminish the impact of the computation time in the distance calculation. Independent results have found theoretical lower bounds [Formula presented] and [Formula presented], where n is the number of time measurement rounds, on the security of lookup-based protocols against mafia and distance-fraud attacks, respectively. However, it is still an open question whether there exists a protocol achieving both security bounds. This article closes this question in two ways. First, we prove that the two lower bounds are mutually exclusive, meaning that there does not exist a lookup-based protocol that provides optimal protection against both types of attacks. Second, we provide a lookup-based protocol that approximates those bounds by a small constant factor. Our experiments show that, restricted to a memory size that linearly grows with n, our protocol offers strictly better security than previous lookup-based protocols against both types of fraud.
Àrees temàtiques: Telecommunications Interdisciplinar Engineering, electrical & electronic Engenharias iv Engenharias iii Computer science, software, graphics, programming Computer science, software engineering Computer science, information systems Computer science, hardware & architecture Computer networks and communications Ciências biológicas i Ciências ambientais Ciência da computação
Accès a la llicència d'ús: https://creativecommons.org/licenses/by/3.0/es/
Adreça de correu electrònic de l'autor: rolando.trujillo@urv.cat
Identificador de l'autor: 0000-0002-8714-4626
Data d'alta del registre: 2024-01-15
Versió de l'article dipositat: info:eu-repo/semantics/publishedVersion
Enllaç font original: https://www.sciencedirect.com/science/article/pii/S0140366423002669
URL Document de llicència: http://repositori.urv.cat/ca/proteccio-de-dades/
Referència a l'article segons font original: Computer Communications. 210 69-78
Referència de l'ítem segons les normes APA: Gil-Pons, R; Mauw, S; Trujillo-Rasua, R (2023). On the optimal resistance against mafia and distance fraud in distance-bounding protocols. Computer Communications, 210(), 69-78. DOI: 10.1016/j.comcom.2023.07.033
DOI de l'article: 10.1016/j.comcom.2023.07.033
Entitat: Universitat Rovira i Virgili
Any de publicació de la revista: 2023
Tipus de publicació: Journal Publications
Repositori URV