Security Analysis of YKHL Distance Bounding Protocol with Adjustable False Acceptance Rate

• Published in: IEEE communications letters 2011-10, Vol.15 (10), p.1078-1080
• Main Author: Kim, Chong Hee
• Format: Article
• Language: English
• Subjects: Acceptance; Adjustable; Applied sciences; authentication; Computer science; Cryptography; distance bounding protocol; distance fraud attack; Exact sciences and technology; Exchanging; Fraud; Information, signal and communications theory; mafia fraud attack; Message authentication; Messages; Protocols; Radiofrequency identification; Security; Signal and communications theory; Studies; Telecommunications and information theory; Time measurement; Upper bounds
• ISSN: 1089-7798; 1558-2558
• DOI: 10.1109/LCOMM.2011.080811.111299

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 FAR M and FAR D 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 (FAR M , FAR D ) = ((½) n , (½) n ). Recently Yum et al. proposed a flexible distance bounding protocol, in IEEE Communications Letters, asserting that its false acceptance rate (FAR M , FAR D ) 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 (FAR M , FAR D ) varies from ((½) n , (½) n ) to ((½) n , (½) n / 2 ).