Standard cryptographic authentication is designed to prove identity—confirming that a claimant possesses a specific secret key. However, as Gildas Avoine and Ioana Boureanu point out in From Relay Attacks to Distance-Bounding Protocols, identity does not guarantee location. This "proximity gap" allows for relay attacks, where an adversary intercepts valid credentials from a remote victim and retransmits them to a local verifier.
To close this gap, researchers have developed Distance Bounding Protocols (DBP). These protocols shift the security foundation from computational hardness to the laws of physics—specifically, the invariant speed of light.
The Vulnerability of Implicit Proximity
Most short-range technologies, such as NFC, RFID, and Bluetooth Low Energy (BLE), rely on the "proximity-as-trust" model. They assume that if a signal is strong enough to be received, the device must be physically present.
Gerhard Petrus Hancke and Lishoy Francis demonstrated the fragility of this assumption in Practical Relay Attack on Contactless Transactions by Using NFC Mobile Phones. By using two off-the-shelf phones—one acting as a "proxy-reader" near the victim and another as a "proxy-token" at a payment terminal—they successfully performed fraudulent transactions over distances of 35 meters. Because the application layer only sees valid encrypted packets, it cannot distinguish between a local user and a relayed signal.
Timing as a Physical Root of Trust
The core intuition of distance bounding is to measure the Round-Trip Time (RTT) of a signal at the physical layer. If a verifier sends a challenge and receives a response, the total time elapsed ($\Delta t$) places a hard upper bound on the distance ($d$) between the two entities, governed by the speed of light ($c$):
$$d \leq \frac{c \cdot \Delta t}{2}$$
For a protocol to be secure against relay attacks, the challenge-response phase must be extremely rapid—often involving single-bit exchanges to minimize processing delay. As explored by Pedro Peris‐Lopez and Aikaterini Mitrokotsa in Shedding Light on RFID Distance Bounding Protocols and Terrorist Fraud Attacks, these protocols must defend against two primary threats:
- Mafia Fraud: An external attacker relays signals between an honest prover and an honest verifier.
- Terrorist Fraud: A dishonest prover collaborates with an attacker to convince a distant verifier of their proximity without revealing their long-term secret key.
Protocols like Hitomi and the Swiss-Knife protocol use cryptographic pre-computations to ensure that the rapid-fire timing phase requires no complex calculation, making the RTT measurement as pure a reflection of physical distance as possible.
Beyond Payments: Broadening the Scope
While initially focused on RFID and NFC, distance bounding has become a critical primitive across several domains:
- Trusted Execution Environments: In ProximiTEE, Aritra Dhar and Ivan Puddu use distance bounding to verify that an Intel SGX enclave is physically co-located with a trusted hardware peripheral, preventing attackers from provisioning secrets to enclaves running on remote, compromised servers.
- Public Health: During the COVID-19 pandemic, digital contact tracing systems faced "false exposure" attacks. Benny Pinkas in Hashomer and Tianhao Wang in PURE analyzed how relaying ephemeral Bluetooth identifiers could be used to trigger mass quarantines, highlighting the need for temporal and spatial verification in proximity-based notifications.
- Infrastructure and Grids: Abubakar Sadiq Sani proposed R-Chain, which applies relay resilience to smart grids, ensuring that control commands are physically originating from authorized local nodes rather than remote injectors.
The Relativistic Frontier
The most rigorous application of this idea is found in Relativistic Zero-Knowledge Proofs. In Experimental relativistic zero-knowledge proofs, Pouriya Alikhani and Nicolas Brunner demonstrate how spatial separation and nanosecond-scale timing can enforce security. By requiring two provers to answer questions so quickly that they cannot communicate with each other (even at the speed of light), the system creates a security guarantee that does not depend on mathematical assumptions like the difficulty of factoring, but on the causal structure of spacetime itself.