Abstract
Cryptographic distance-bounding protocols verify the proximity of two parties by timing a challenge-response exchange. Such protocols rely on the underlying communication channel for accurate and fraud-resistant round-trip-time measurements, therefore the channel's exact timing properties and low-level implementation details become security critical. We practically implement 'late-commit' attacks, against two commercial radio receivers used in RFID and sensor networks, that exploit the latency in the modulation and decoding stages. These allow the attacker to extend the distance to the verifier by several kilometers. We also discuss how 'overclocking' a receiver can make a prover respond early. We practically implement this attack against an ISO 14443A RFID token and manage to get a response 10 μs earlier than normal. We conclude that conventional RF channels can be problematic for secure distance-bounding implementations and discuss the merits and weaknesses of special distance-bounding channels that have been proposed for RFID applications. Copyright 2008 ACM.
Original language | English |
---|---|
Title of host publication | WiSec'08: Proceedings of the 1st ACM Conference on Wireless Network Security |
Pages | 194-202 |
DOIs | |
Publication status | Published - 2008 |
Externally published | Yes |
Event | WiSec'08: 1st ACM Conference on Wireless Network Security - Alexandria, VA, United States Duration: 31 Mar 2008 → 2 Apr 2008 |
Conference
Conference | WiSec'08: 1st ACM Conference on Wireless Network Security |
---|---|
Country/Territory | United States |
City | Alexandria, VA |
Period | 31/03/08 → 2/04/08 |
Research Keywords
- Data modulation
- Distance-bounding protocols
- Location-based authentication
- Low-latency communication
- Radio channels
- RFID
- Round-trip time measurement
- Speed of light
- Wireless communication