Articles producció científica> Enginyeria Informàtica i Matemàtiques

On the optimal resistance against mafia and distance fraud in distance-bounding protocols

  • Datos identificativos

    Identificador: imarina:9329038
    Autores:
    Gil-Pons, RMauw, STrujillo-Rasua, R
    Resumen:
    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.
  • Otros:

    Autor según el artículo: Gil-Pons, R; Mauw, S; Trujillo-Rasua, R
    Departamento: Enginyeria Informàtica i Matemàtiques
    Autor/es de la URV: Trujillo Rasua, Rolando
    Palabras clave: Security Mafia fraud Distance fraud Distance bounding security mafia fraud distance fraud
    Resumen: 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.
    Áreas temáticas: 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
    Acceso a la licencia de uso: https://creativecommons.org/licenses/by/3.0/es/
    Direcció de correo del autor: rolando.trujillo@urv.cat
    Identificador del autor: 0000-0002-8714-4626
    Fecha de alta del registro: 2024-08-03
    Versión del articulo depositado: info:eu-repo/semantics/publishedVersion
    Enlace a la fuente original: https://www.sciencedirect.com/science/article/pii/S0140366423002669
    URL Documento de licencia: https://repositori.urv.cat/ca/proteccio-de-dades/
    Referencia al articulo segun fuente origial: Computer Communications. 210 69-78
    Referencia 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 del artículo: 10.1016/j.comcom.2023.07.033
    Entidad: Universitat Rovira i Virgili
    Año de publicación de la revista: 2023
    Tipo de publicación: Journal Publications
  • Palabras clave:

    Computer Networks and Communications,Computer Science, Hardware & Architecture,Computer Science, Information Systems,Computer Science, Software Engineering,Computer Science, Software, Graphics, Programming,Engineering, Electrical & Electronic,Telecommunications
    Security
    Mafia fraud
    Distance fraud
    Distance bounding
    security
    mafia fraud
    distance fraud
    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
  • Documentos:

  • Cerca a google

    Search to google scholar