Modeling Enlargement Attacks Against UWB Distance Bounding Protocols

被引:9
|
作者
Compagno, Alberto [1 ]
Conti, Mauro [2 ]
D'Amico, Antonio Alberto [3 ]
Dini, Gianluca [3 ]
Perazzo, Pericle [3 ]
Taponecco, Lorenzo [3 ]
机构
[1] Univ Roma La Sapienza, Dept Comp Sci, Piazzale Aldo Moro 5, I-00185 Rome, Italy
[2] Univ Padua, Dept Math, I-35122 Padua, Italy
[3] Univ Pisa, Dept Informat Engn, I-56126 Pisa, Italy
基金
欧盟地平线“2020”;
关键词
Security; ranging; distance bounding; enlargement attacks; ultrawideband;
D O I
10.1109/TIFS.2016.2541613
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
Distance bounding protocols make it possible to determine a trusted upper bound on the distance between two devices. Their key property is to resist reduction attacks, i.e., attacks aimed at reducing the distance measured by the protocol. Recently, researchers have also focused on enlargement attacks, aimed at enlarging the measured distance. Providing security against such attacks is important for secure positioning techniques. The contribution of this paper is to provide a probabilistic model for the success of an enlargement attack against a distance bounding protocol realized with the IEEE 802.15.4a ultra-wideband standard. The model captures several variables, such as the propagation environment, the signal-to-noise ratio, and the time-of-arrival estimation algorithm. We focus on non-coherent receivers, which can be used in low-cost low-power applications. We validate our model by comparison with physical-layer simulations and goodness-of-fit tests. The results show that our probabilistic model is sufficiently realistic to replace physical-layer simulations. Our model can be used to evaluate the security of the ranging/positioning solutions that can be subject to enlargement attacks. We expect that it will significantly facilitate future research on secure ranging and secure positioning.
引用
收藏
页码:1565 / 1577
页数:13
相关论文
共 50 条
  • [1] Distance Hijacking Attacks on Distance Bounding Protocols
    Cremers, Cas
    Rasmussen, Kasper B.
    Schmidt, Benedikt
    Capkun, Srdjan
    2012 IEEE SYMPOSIUM ON SECURITY AND PRIVACY (SP), 2012, : 113 - 127
  • [2] Distance Bounding Protocols on TH-UWB Radios
    Benfarah, Ahmed
    Miscopein, Benoit
    Gorce, Jean-Marie
    Lauradoux, Cedric
    Roux, Bernard
    2010 IEEE GLOBAL TELECOMMUNICATIONS CONFERENCE GLOBECOM 2010, 2010,
  • [3] Distance bounding protocols: Authentication logic analysis and collusion attacks
    Meadows, Catherine
    Poovendran, Radha
    Pavlovic, Dusko
    Chang, LiWu
    Syverson, Paul
    SECURE LOCALIZATION AND TIME SYNCHRONIZATION FOR WIRELESS SENSOR AND AD HOC NETWORKS, 2007, 30 : 279 - +
  • [4] Lightweight Distance Bounding Protocol against Relay Attacks
    Kim, Jin Seok
    Cho, Kookrae
    Yum, Dae Hyun
    Hong, Sung Je
    Lee, Pil Joong
    IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, 2012, E95D (04): : 1155 - 1158
  • [5] Performing and mitigating force and terrorist fraud attacks against two RFID distance-bounding protocols
    Rad, Azadeh Imani
    Alagheband, Mahdi R.
    Far, Saeed Banaeian
    JOURNAL OF INFORMATION SECURITY AND APPLICATIONS, 2018, 42 : 87 - 94
  • [6] Building ToF Resiliency Into UWB-Based Secure Distance Bounding Protocols
    Nkrowl, Raphael E.
    Boshoffl, Dutliff
    Silval, Bruno J.
    Liu, Zhe
    Hanekel, Gerhard P.
    2024 IEEE CONFERENCE ON COMMUNICATIONS AND NETWORK SECURITY, CNS 2024, 2024,
  • [7] On the optimal resistance against mafia and distance fraud in distance-bounding protocols
    Gil-Pons, Reynaldo
    Mauw, Sjouke
    Trujillo-Rasua, Rolando
    COMPUTER COMMUNICATIONS, 2023, 210 : 69 - 78
  • [8] On Modeling Terrorist Frauds Addressing Collusion in Distance Bounding Protocols
    Vaudenay, Serge
    PROVABLE SECURITY, 7TH INTERNATIONAL CONFERENCE, PROVSEC 2013, 2013, 8209 : 1 - 20
  • [9] Mutual Distance Bounding Protocols
    Avoine, Gildas
    Kim, Chong Hee
    IEEE TRANSACTIONS ON MOBILE COMPUTING, 2013, 12 (05) : 830 - 839
  • [10] Group Distance Bounding Protocols
    Capkun, Srdjan
    El Defrawy, Karim
    Tsudik, Gene
    TRUST AND TRUSTWORTHY COMPUTING, TRUST 2011, 2011, 6740 : 302 - 312