Author_Institution :
Inf. Security Group, Univ. Catholique de Louvain, Louvain-la-Neuve, Belgium
Abstract :
A distance bounding protocol enables one entity to determine an upper bound on the physical distance to the other entity as well as to authenticate the other entity. It measures the round-trip time of exchanged messages that normally consist of n rounds of a single-bit challenge and a single-bit response. Let FARM and FARD be the false acceptance rate against mafia fraud attack and distance fraud attack, respectively. Brands and Chaum designed the first distance bounding protocol that has (FARM, FARD) = ((½)n, (½)n). Recently Yum et al. proposed a flexible distance bounding protocol, in IEEE Communications Letters, asserting that its false acceptance rate (FARM, FARD) can be chosen from ((½)n , (½)n) to ((¼)n , (3/4)n). However, we introduce a new attack that achieves a higher false accep tance rate, where (FARM, FARD) varies from ((½)n , (½)n) to ((½)n, (½)n/2).
Keywords :
cryptographic protocols; fraud; message authentication; YKHL distance bounding protocol; adjustable false acceptance rate; authentication; distance fraud attack; mafia fraud attack; message exchange; round-trip time; security analysis; single-bit challenge; single-bit response; Computer science; Cryptography; Message authentication; Protocols; Radiofrequency identification; Time measurement; Security; authentication; distance bounding protocol; distance fraud attack; mafia fraud attack;
