For Full-Text PDF, please login, if you are a member of IEICE,|
or go to Pay Per View on menu list, if you are a nonmember of IEICE.
Unilateral Distance Bounding Protocol with Bidirectional Challenges
Myung-Ho PARK Ki-Gon NAM Jin Seok KIM Dae Hyun YUM Pil Joong LEE
IEICE TRANSACTIONS on Information and Systems
Publication Date: 2013/01/01
Online ISSN: 1745-1361
Print ISSN: 0916-8532
Type of Manuscript: LETTER
Category: Information Network
mafia fraud attack, distance bounding, authentication, security,
Full Text: PDF(82KB)>>
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 .