Distance Bounding Facing Both Mafia and Distance Frauds

被引:12
作者
Trujillo-Rasua, Rolando [1 ]
Martin, Benjamin [2 ]
Avoine, Gildas [2 ,3 ]
机构
[1] Univ Luxembourg, Interdisciplinary Ctr Secur Reliabil & Trust, L-1615 Luxembourg, Luxembourg
[2] Catholic Univ Louvain, B-1348 Louvain, Belgium
[3] Inst Natl Sci Appl, Inst Res Informat Sci & Random Syst, F-35708 Rennes, France
关键词
Authentication; distance-bounding; relay attack; PROTOCOLS;
D O I
10.1109/TWC.2014.2323979
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
Contactless technologies such as radio-frequency identification, near field communication, and sensor networks are vulnerable to mafia and distance fraud. These types of fraud are aimed at successfully passing an authentication protocol by cheating on the actual distance between the prover and the verifier. Distance-bounding protocols have been designed to cope with these security issues, but none of them properly resist these two types of fraud without requiring additional memory and computation. The situation is even worse considering that just a few distance-bounding protocols are able to deal with the inherent background noise on the communication channels. This paper introduces a noise-resilient distance-bounding protocol that resists both mafia and distance fraud. The security of the protocol is analyzed against known attacks and illustrated by experimental results. The results demonstrate the significant advantage of the introduced lightweight design over previous proposals.
引用
收藏
页码:5690 / 5698
页数:9
相关论文
共 25 条
  • [1] [Anonymous], 2000, NUMBERS GAMES
  • [2] A framework for analyzing RFID distance bounding protocols
    Avoine, Gildas
    Bingol, Muhammed Ali
    Kardas, Suleyman
    Lauradoux, Cedric
    Martin, Benjamin
    [J]. JOURNAL OF COMPUTER SECURITY, 2011, 19 (02) : 289 - 317
  • [3] Avoine G, 2011, WISEC 11: PROCEEDINGS OF THE FOURTH ACM CONFERENCE ON WIRELESS NETWORK SECURITY, P145
  • [4] Avoine G, 2009, LECT NOTES COMPUT SC, V5922, P290, DOI 10.1007/978-3-642-10628-6_20
  • [5] Avoine G, 2009, LECT NOTES COMPUT SC, V5735, P250, DOI 10.1007/978-3-642-04474-8_21
  • [6] Bengio S., 1991, Journal of Cryptology, V4, P175, DOI 10.1007/BF00196726
  • [7] Brands S., 1993, LECT NOTES COMPUTER, P344, DOI [DOI 10.1007/3-540-48285-7_30, 10.1007/3-540-48285-7_30]
  • [8] Bussard L, 2005, INT FED INFO PROC, V181, P223
  • [9] DESMEDT Y, 1988, LECT NOTES COMPUT SC, V293, P21
  • [10] HOW TO PROVE YOURSELF - PRACTICAL SOLUTIONS TO IDENTIFICATION AND SIGNATURE PROBLEMS
    FIAT, A
    SHAMIR, A
    [J]. LECTURE NOTES IN COMPUTER SCIENCE, 1987, 263 : 186 - 194