Distance Bounding Protocol for Mutual Authentication

被引：23

作者：

Yum, Dae Hyun ^{[1
]}

Kim, Jin Seok ^{[1
]}

Hong, Sung Je ^{[1
]}

Lee, Pil Joong ^{[1
]}

机构：

[1] POSTECH, Dept Elect & Elect Engn, Pohang 790784, Kyungbuk, South Korea

来源：

IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS | 2011年 / 10卷 / 02期

关键词：

Security; mutual authentication; mafia fraud attack; relay attack; distance bounding protocol; CHALLENGES;

D O I：

10.1109/TWC.2010.120610.100491

中图分类号：

TM [电工技术]; TN [电子技术、通信技术];

学科分类号：

0808 ; 0809 ;

摘要：

A distance bounding protocol enables one party to determine a practical upper bound on the distance to another party. It is an effective countermeasure against mafia fraud attacks (a.k.a. relay attacks) which do not alter messages between users but only relay messages. The main idea of distance bounding protocols is to repeat fast bit exchanges. One party sends a challenge bit and another party answers with a response bit and vice versa. By measuring the round-trip time between the challenge and the response, an upper bound on the distance between users can be calculated. If messages are relayed, the round-trip time increases and thus mafia fraud attacks can be detected. We introduce an efficient distance bounding protocol for mutual authentication. It enjoys a reduced false acceptance rate under mafia fraud attacks and does not require an extra confirmation message after the fast bit exchange phase.

引用

页码：592 / 601

页数：10

共 21 条

[1]

Ahson S. A., 2008, RFID Handbook: Applications, Technology, Security, and Privacy

[2]

Avoine G, 2009, LECT NOTES COMPUT SC, V5735, P250, DOI 10.1007/978-3-642-04474-8_21

[3]

Bicakci K, 2005, LECT NOTES COMPUT SC, V3813, P80

[4]

Brands S., 1993, LECT NOTES COMPUTER, P344, DOI [DOI 10.1007/3-540-48285-7_30, 10.1007/3-540-48285-7_30]

[5]

Capkun S., 2003, ACM WORKSHOP SECURIT, P21

[6]

Clulow J, 2006, LECT NOTES COMPUT SC, V4357, P83

[7]

Conway J.H., 1976, On Numbers and Games

[8]

Daemen Joan, 2020, Information Security and Cryptography, V2nd

[9]

DESMEDT Y, 1988, LECT NOTES COMPUT SC, V293, P21

[10] Confidence in smart token proximity: Relay attacks revisited [J].

Hancke, G. P. ;

Mayes, K. E. ;

Markantonakis, K. .

COMPUTERS & SECURITY, 2009, 28 (07) :615-627

← 1 2 3 →