Unilateral Distance Bounding Protocol with Bidirectional Challenges

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

doi:10.1587/transinf.E96.D.134

Unilateral Distance Bounding Protocol with Bidirectional Challenges

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

Full Text Views

0

Share
Cite this

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 .

Publication: IEICE TRANSACTIONS on Information Vol.E96-D No.1 pp.134-137

Publication Date: 2013/01/01

Publicized

Online ISSN: 1745-1361

DOI: 10.1587/transinf.E96.D.134

Type of Manuscript: LETTER

Category: Information Network

Cite this

Copy

Myung-Ho PARK, Ki-Gon NAM, Jin Seok KIM, Dae Hyun YUM, Pil Joong LEE, "Unilateral Distance Bounding Protocol with Bidirectional Challenges" in IEICE TRANSACTIONS on Information, vol. E96-D, no. 1, pp. 134-137, January 2013, doi: 10.1587/transinf.E96.D.134.
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 . We propose a unilateral distance bounding protocol without a final confirmation message, which reduces the adversary success probability to .
URL: https://globals.ieice.org/en_transactions/information/10.1587/transinf.E96.D.134/_p

Copy

@ARTICLE{e96-d_1_134,
author={Myung-Ho PARK, Ki-Gon NAM, Jin Seok KIM, Dae Hyun YUM, Pil Joong LEE, },
journal={IEICE TRANSACTIONS on Information},
title={Unilateral Distance Bounding Protocol with Bidirectional Challenges},
year={2013},
volume={E96-D},
number={1},
pages={134-137},
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 . We propose a unilateral distance bounding protocol without a final confirmation message, which reduces the adversary success probability to .},
keywords={},
doi={10.1587/transinf.E96.D.134},
ISSN={1745-1361},
month={January},}

Copy

TY - JOUR
TI - Unilateral Distance Bounding Protocol with Bidirectional Challenges
T2 - IEICE TRANSACTIONS on Information
SP - 134
EP - 137
AU - Myung-Ho PARK
AU - Ki-Gon NAM
AU - Jin Seok KIM
AU - Dae Hyun YUM
AU - Pil Joong LEE
PY - 2013
DO - 10.1587/transinf.E96.D.134
JO - IEICE TRANSACTIONS on Information
SN - 1745-1361
VL - E96-D
IS - 1
JA - IEICE TRANSACTIONS on Information
Y1 - January 2013
AB - 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 .
ER -