Verifying Physical Proximity via Distance Bounding

64 concepts37 papers1 proposal

Many short-range wireless technologies—such as Near Field Communication (NFC), Bluetooth, and RFID—operate under an implicit assumption: if two devices can successfully exchange signals, they must be physically close to each other. This "proximity-as-trust" model serves as the foundational security guarantee for contactless payments, smart locks, and asset tracking Garg et al..

However, as Hancke et al. observe, this model fundamentally decouples the physical location of a credential from the reader's location. If an adversary can bridge the physical gap between a legitimate token and a remote reader, the system will authorize the transaction, completely unaware that the two entities are miles apart.

To solve this vulnerability, researchers developed distance-bounding protocols. Instead of relying on application-layer data or signal strength, distance bounding uses the fundamental laws of physics—specifically the speed of light—to verify physical proximity.

The Anatomy of a Relay Attack

To understand why traditional cryptographic security fails, consider how a relay attack operates. The attack does not require cracking encryption keys or altering transaction data; instead, it manipulates the communication channel itself.

An attacker deploys two cooperative devices: a proxy-reader placed near the victim's legitimate token (e.g., a credit card in a pocket) and a proxy-token placed near the legitimate terminal (e.g., a store payment reader). When the terminal issues a cryptographic challenge, the proxy-token captures it, transmits it over a long-range wireless link (like Bluetooth or cellular) to the proxy-reader, which replays it to the victim's token. The token's valid cryptographic response is tunneled back along the same path.

[Legitimate Terminal] <---> [Proxy-Token] . . . . (Long-Range Relay) . . . . [Proxy-Reader] <---> [Victim's Token]

Hancke et al. demonstrated that this can be executed using off-the-shelf, unmodified smartphones over distances of up to 35 meters. Furthermore, the threat is not limited to active digital devices. Sun showed that completely passive, battery-free resonant copper coils can extend NFC ranges to nearly half a meter, bypassing the physical constraints of short-range magnetic induction. This vulnerability spans across mobile wallets, smart cards Sun, contact tracing systems Chan et al., and cross-device wearable authentication Liu.

Why Simple Metrics Fail

A naive defense might involve measuring the Received Signal Strength Indication (RSSI) to ensure the device is close. However, as Gil et al. demonstrate, signal strength is an unreliable proxy for location because an attacker can easily manipulate it by adjusting transmission power or using directional antennas.

Similarly, relying on protocol-level proximity checks can backfire. Ronen et al. discovered that logic flaws in wireless protocol implementations can allow attackers to bypass signal-strength checks entirely, executing commands from hundreds of meters away.

The Core Mechanism: Bounding Distance via Time

To build a robust defense, systems must shift their security guarantees from purely cryptographic methods to those grounded in the laws of physics Pal et al..

Instead of asking what the device knows (cryptographic credentials), a distance-bounding protocol asks how fast it can respond. Because information cannot travel faster than the speed of light ($c \approx 3 \times 10^8 \text{ m/s}$), the time it takes for a signal to travel from a verifier to a prover and back dictates the maximum possible physical distance between them.

The protocol operates as a rapid-fire sequence of single-bit challenge-response rounds:

  1. Challenge: The verifier sends a single-bit challenge $C_i$ at time $t_1$.
  2. Response: The prover receives $C_i$ and immediately returns a single-bit response $R_i$ at time $t_2$.
  3. Measurement: The verifier records the arrival time $t_2$ and calculates the total Round-Trip Time ($\Delta t = t_2 - t_1$).

Using the physics equation for constant speed, the verifier establishes an upper bound on the physical distance $d$:

$$d \le \frac{c \cdot \Delta t}{2}$$

If an attacker attempts to relay these bits over a network, the unavoidable latency introduced by the relay hardware, propagation delay, and extra physical distance will push $\Delta t$ past a strict temporal threshold, causing the verification to fail Pal et al..

Overcoming Hardware and Network Realities

While elegant in theory, implementing distance bounding introduces significant engineering challenges. Standard application-layer software introduces unpredictable processing delays (jitter) that dwarf the flight time of light over short distances Hancke et al.. Therefore, distance bounding must be implemented at the physical layer using dedicated hardware or ultra-low-latency interfaces Hancke et al..

Even when implemented over hardware interfaces like USB, sophisticated attackers using ultra-low-latency data center interconnects might achieve relay speeds comparable to local processing jitter. To counter this, Dhar et al. propose aggregating timing measurements over multiple challenge-response rounds. This approach leverages the statistical "latency floor" inherent to network routing to reliably differentiate between direct local hardware communication and a high-speed network relay.

Expanding the Paradigm Beyond Proximity

The intuition of bounding distance via time has proven powerful enough to solve security problems far beyond contactless payments:

  • Hardware Enclave Attestation: Dhar et al. use distance bounding to ensure a secure software enclave (like Intel SGX) is physically co-located on a trusted local machine rather than being hosted on a compromised remote server via a network relay.
  • Verifiable Local Computation: Bursuc et al. apply distance-bounding mechanisms to verify software-based memory erasure. By enforcing strict RTT constraints, a verifier can guarantee that a resource-constrained IoT device is performing the memory-wiping computations locally, rather than outsourcing the task to a distant, more powerful adversary.
  • Multi-Layered Defense: Because hardware modifications can be costly, researchers have also explored secondary spatial verification layers. These include comparing geographic coordinates or cellular network identifiers Hancke et al., Jan et al., or using ambient environmental sensors, though Markantonakis et al. caution that ambient sensing often fails to meet the strict latency and security thresholds required for real-world transactions.

Key Foundational Work

Practical NFC Peer-to-Peer Relay Attack using Mobile Phones (2010) — contributed 12 concept elements to this direction.
Constructing Secure Localization Systems with Adjustable Granularity Using Commodity Hardware (2010) — contributed 2 concept elements to this direction.
Detecting Identity Spoofs in IEEE 802.11e Wireless Networks (2009) — contributed 2 concept elements to this direction.
History & citationVersion 1 · 2026-10-04

Current · Permanent link

View frozen version 1

Cite this direction

Latest version (a living page):

@misc{lacuna_relay_attack_vulnerability_c93624e3,
  title = {relay attack vulnerability},
  author = {{Lacuna}},
  howpublished = {Lacuna research direction},
  year = {2026},
  url = {https://lacuna.tiptreesystems.com/direction/relay-attack-vulnerability/rdr_c93624e3de8544baa5d9c1d23e16f92c},
  note = {Latest version of a living research direction; cite a version for a fixed text. Accessed 2026-11-20},
}

This exact version (version 1, frozen text):

@misc{lacuna_relay_attack_vulnerability_c93624e3_v1,
  title = {relay attack vulnerability},
  author = {{Lacuna}},
  howpublished = {Lacuna research direction},
  year = {2026},
  url = {https://lacuna.tiptreesystems.com/direction/relay-attack-vulnerability/rdr_c93624e3de8544baa5d9c1d23e16f92c/v/1},
  note = {Version 1, frozen 2026-10-04. Accessed 2026-11-20},
}
About

These directions overlap with this one through shared papers.

See something wrong? Report a mistake