# Complexity of distance fraud attacks in graph-based distance bounding

@article{TrujilloRasua2013ComplexityOD,
title={Complexity of distance fraud attacks in graph-based distance bounding},
author={Rolando Trujillo-Rasua},
journal={ArXiv},
year={2013},
volume={abs/1412.6016}
}
Distance bounding (DB) emerged as a countermeasure to the so-called relay attack, which affects several technologies such as RFID, NFC, Bluetooth, and Ad-hoc networks. A prominent family of DB protocols are those based on graphs, which were introduced in 2010 to resist both mafia and distance frauds. The security analysis in terms of distance fraud is performed by considering an adversary that, given a vertex labeled graph $$G = (V, E)$$ and a vertex $$v \in V$$, is able to find the most…
6 Citations

### Distance Bounding Facing Both Mafia and Distance Frauds

• Computer Science
IEEE Transactions on Wireless Communications
• 2014
A noise-resilient distance-bounding protocol that resists both mafia and distance fraud is introduced and the results demonstrate the significant advantage of the introduced lightweight design over previous proposals.

### A Class of Precomputation-Based Distance-Bounding Protocols

• Computer Science, Mathematics
2016 IEEE European Symposium on Security and Privacy (EuroS&P)
• 2016
A novel family of protocols in this class of precomputation-based distance-bounding protocols is developed that resists well to mafia fraud attacks.

### 1 Security of Distance-Bounding : A Survey

• History
• 2017
GILDAS AVOINE, INSA Rennes, IRISA, IUF, France MUHAMMED ALI BINGÖL, TÜBİTAK BİLGEM, and Sabanci University, Turkey IOANA BOUREANU, Imperial College London, United Kingdom SRDJAN ČAPKUN, ETH Zurich,

### Security of Distance-Bounding

• Computer Science
ACM Comput. Surv.
• 2019
This survey analyzes and compares in a unified manner many existing distance-bounding protocols with respect to several key security and complexity features.

## References

SHOWING 1-10 OF 27 REFERENCES

### RFID Distance Bounding Protocol with Mixed Challenges to Prevent Relay Attacks

• Computer Science
CANS
• 2009
A new protocol based on binary mixed challenges that converges toward the expected and optimal (1/2) n bound is introduced that proves its security in case of both noisy and non-noisy channels.

### The Poulidor Distance-Bounding Protocol

• Computer Science
RFIDSec
• 2010
This paper introduces the concept of distance-bounding protocols based on graphs while previous proposals rely on linear registers or binary trees and proposes an instance of the graph-based protocol that resists to both mafia and distance frauds without sacrificing memory.

### A Distance Bounding Protocol Using Error State and Punishment

• Computer Science
2011 First International Conference on Instrumentation, Measurement, Computer, Communication and Control
• 2011
A modification of distance bounding protocols using `error state' which stands for the number of response bit errors that have already occurred is considered, which sets a maximal error number to prevent adversary from malicious queries and applies a punishment mechanism for error responding.

### Keep Your Enemies Close: Distance Bounding Against Smartcard Relay Attacks

• Computer Science
USENIX Security Symposium
• 2007
A new defence based on a distance bounding protocol is described and implemented, which requires only modest alterations to current hardware and software and could provide cost-effective resistance to relay attacks, which are a genuine threat to deployed applications.

### Distance Bounding in Noisy Environments

• Computer Science
ESAS
• 2007
An improved distance bounding protocol for noisy channels that offers a substantial reduction in the number of communication rounds compared to the Hancke and Kuhn protocol and uses binary codes to correct bit errors occurring during the fast bit exchanges.

### Distance bounding protocols for RFID enhanced by using void-challenges and analysis in noisy channels

• Computer Science, Mathematics
Wirel. Commun. Mob. Comput.
• 2008
This paper considers a modification of RFID protocols using the most popular of this kind of protocols, the Hancke and Kuhn's protocol, to show the improvements achieved when different cases are analysed.

### An Efficient Distance Bounding RFID Authentication Protocol: Balancing False-Acceptance Rate and Memory Requirement

• Computer Science
ISC
• 2009
A low complexity authentication protocol that achieves a probability of false-acceptance essentially equal to the best possible false- acceptance probability in the presence of Mafia frauds is proposed.

### A framework for analyzing RFID distance bounding protocols

• Computer Science
J. Comput. Secur.
• 2011
A unified framework that aims to improve analysis and design of distance bounding protocols, which includes a thorough terminology about the frauds, adversary and prover, thus disambiguating many misleading terms.

### Attacks on time-of-flight distance bounding channels

• Computer Science
WiSec '08
• 2008
It is concluded that conventional RF channels can be problematic for secure distance- bounding implementations and the merits and weaknesses of special distance-bounding channels that have been proposed for RFID applications are discussed.

### Relay Attacks on RFID-Based Electronic Voting Systems

• Computer Science
• 2009
This work shows how the proposed Israeli e-voting scheme can be completely compromised using low-cost relay attacks, and describes a variety of attacks, ranging from simple denial of service to sophisticated election fraud.