Unilateral Distance Bounding Protocol with Bidirectional Challenges

Abstract

A distance bounding protocol provides an upper bound on the distance between communicating parties by measuring the round-trip time between challenges and responses. It is an effective countermeasure against mafia fraud attacks (a.k.a. relay attacks). The adversary success probability of previous distance bounding protocols without a final confirmation message such as digital signature or message authentication code is at least (3/8)(n) = (1/2.67)(n). We propose a unilateral distance bounding protocol without a final confirmation message, which reduces the adversary success probability to (5/16)(n) = (1/3.2)(n).