A general and efficient distance bounding protocol with multi-objective optimisation for RFID applications over a noisy channel

被引:0
作者
Shafiee, Ebrahim [1 ]
Falahati, Abolfazl [1 ]
机构
[1] Iran Univ Sci & Technol, Dept Elect Engn, DCCS Lab, Tehran 1684613114, Iran
关键词
radiofrequency identification; RFID; distance bounding protocol; relay attacks; multi-objective optimisation; fraud attacks; communication security; noisy wireless channel;
D O I
10.1504/IJAHUC.2021.119854
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
It is common to employ the distance bounding (DB) protocols to prevent relay attacks over RFID communication systems. It is impossible to utilise only one specific version of a DB protocol as a general resolution for secure identification and optimal performance due to the diversity and development of the RFID platforms such as ad hoc and IoT. Therefore, a general DB (GDB) protocol employing a multi-objective optimisation algorithm is proposed to find the appropriate GDB protocol's parameter values, increase security and reduce costs. On the other hand, reducing the false-accept probability against possible attacks increases security, and decreasing the protocol false-reject probability, runtime and memory reduces costs. The final desired optimal protocol is obtained from Pareto optimal solutions using the linear non-dimensionalisation scaling method and the LINMAP decision-making process. Introducing the figure of merit (FOM) criterion, analytical analysis, and simulation results indicate significant improvements in the protocol efficiency.
引用
收藏
页码:248 / 262
页数:15
相关论文
共 24 条
  • [1] Quantum Distance Bounding
    Abidin, Aysajan
    [J]. PROCEEDINGS OF THE 2019 CONFERENCE ON SECURITY AND PRIVACY IN WIRELESS AND MOBILE NETWORKS (WISEC '19), 2019, : 233 - 238
  • [2] Cyber Attacks on Precision Time Protocol Networks-A Case Study
    Alghamdi, Waleed
    Schukat, Michael
    [J]. ELECTRONICS, 2020, 9 (09) : 1 - 25
  • [3] An efficient Differential Evolution based algorithm for solving multi-objective optimization problems
    Ali, Musrrat.
    Siarry, Patrick
    Pant, Millie.
    [J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2012, 217 (02) : 404 - 416
  • [4] Avoine G., 2008, CRYPTOLOGY, V406, P1
  • [5] Security of Distance-Bounding: A Survey
    Avoine, Gildas
    Bingol, Muhammed Ali
    Boureanu, Ioana
    Capkun, Srdjan
    Hancke, Gerhard
    Kardas, Suleyman
    Kim, Chong Hee
    Lauradoux, Cedric
    Martin, Benjamin
    Munilla, Jorge
    Peinado, Alberto
    Rasmussen, Kasper Bonne
    Singelee, Dave
    Tchamkerten, Aslan
    Trujillo-Rasua, Rolando
    Vaudenay, Serge
    [J]. ACM COMPUTING SURVEYS, 2019, 51 (05)
  • [6] Avoine G, 2009, LECT NOTES COMPUT SC, V5735, P250, DOI 10.1007/978-3-642-04474-8_21
  • [7] Practical and provably secure distance-bounding
    Boureanu, Ioana
    Mitrokotsa, Aikaterini
    Vaudenay, Serge
    [J]. JOURNAL OF COMPUTER SECURITY, 2015, 23 (02) : 229 - 257
  • [8] Brands S., 1993, Work-shop Theory Appl. Cryptographic Techn., P344
  • [9] Survey of Distance Bounding Protocols and Threats
    Brelurut, Agnes
    Gerault, David
    Lafourcade, Pascal
    [J]. FOUNDATIONS AND PRACTICE OF SECURITY (FPS 2015), 2016, 9482 : 29 - 49
  • [10] Prefetching and caching schemes for IoT data in hierarchical edge computing architecture
    Chen, Tzu-Jung
    Sheu, Jang-Ping
    Kuo, Yung Ching
    [J]. INTERNATIONAL JOURNAL OF AD HOC AND UBIQUITOUS COMPUTING, 2020, 33 (02) : 109 - 121