1Faculty of Electrical Engineering, Shahid Rajaee Teacher Training University, Tehran, Iran
2Faculty of Computer Engineering, Shahid Rajaee Teacher Training University, Tehran, Iran
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.