Unilateral Distance Bounding Protocol with Bidirectional Challenges

Myung-Ho PARK  Ki-Gon NAM  Jin Seok KIM  Dae Hyun YUM  Pil Joong LEE  

Publication
IEICE TRANSACTIONS on Information and Systems   Vol.E96-D   No.1   pp.134-137
Publication Date: 2013/01/01
Online ISSN: 1745-1361
DOI: 10.1587/transinf.E96.D.134
Print ISSN: 0916-8532
Type of Manuscript: LETTER
Category: Information Network
Keyword: 
mafia fraud attack,  distance bounding,  authentication,  security,  

Full Text: PDF(82KB)>>
Buy this Article




Summary: 
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 . We propose a unilateral distance bounding protocol without a final confirmation message, which reduces the adversary success probability to .