A distance hijacking attack on the CRCS distance bounding protocol
Cas J. F. Cremers · Repository for Publications and Research Data (ETH Zurich) · 2011
In [2], Rasmussen and Capkun present a practical distance verification mechanism and use it to construct the first practical distance bounding protocol.In this paper we show that the protocol is vulnerable to what we call a distance hijacking attack, in which a malicious prover Q can convince the verifier V that he is at the same distance as some honest prover P , even though Q is further from V than P , by inserting his own identity into a run of the distance bounding protocol between P and V .