Name
Abstract | ||
|---|---|---|
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. |
Year | DOI | Venue |
|---|---|---|
2011 | 10.1109/TWC.2010.120610.100491 | IEEE Transactions on Wireless Communications |
Keywords | Field | DocType |
effective countermeasure,mafia fraud attack,fast bit exchange phase,challenge bit,relay attack,message exchange,fast bit exchange,fraud,relay attacks,authorisation,mutual authentication,round-trip time increase,cryptographic protocols,telecommunication security,party answer,round-trip time,response bit,mafia fraud attacks,security,distance bounding protocol,efficient distance,protocols,authentication | Mutual authentication,Relay attack,Authentication,Cryptographic protocol,Upper and lower bounds,Computer security,Computer network,Distance-bounding protocol,Relay,Mathematics,Bounding overwatch | Journal |
Volume | Issue | ISSN |
10 | 2 | 1536-1276 |
Citations | PageRank | References |
14 | 0.81 | 10 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Dae Hyun Yum | 1 | 315 | 24.95 |
| Jin Seok Kim | 2 | 56 | 6.25 |
| Sung Je Hong | 3 | 267 | 28.92 |
| Pil Joong Lee | 4 | 1039 | 103.09 |