Security Analysis of the Distance Bounding Protocol Proposed by Jannati and Falahati
نویسندگان
1 Faculty of Computer Engineering, Shahid Rajaee Teacher Training University, Tehran, Iran
2 Faculty of Electrical Engineering, Shahid Rajaee Teacher Training University, Tehran, Iran
3 Faculty of Electrical Engineering, Shahid Rajaee Teacher Training University, Tehran, Iran
doi
10.22061/jecei.2014.246چکیده
In this paper, the security of a distance bounding protocol is analyzed which has been recently proposed by Jannati and Falahati (so-called JF). We prove that an adversary can recover key bits of JF protocol with probability of “1” while the complexity of attack is “2n” runs of protocol. In addition, we propose an improved protocol and prove that the improved protocol is resistant to mafia fraud attack, distance fraud attack and key recovery attack.
