Analysis of a Distance Bounding Protocol for Verifying the Proximity of Two-Hop Neighbors

Distance bounding protocols are employed to protect ad hoc networks and wireless sensor networks against wormhole attacks. These protocols only provide proof of one-hop neighbor’s proximity but they do not verify the proximity of nodes beyond the next-hop neighbor which is required for building a secure network. Recently, Pagnin et al. proposed a new concept that extends traditional distance bounding protocols to two-hop distance bounding protocols. They claim that their protocol resists against dishonest provers which are located away up to two-hop. In this paper, we show that the two-hop distance bounding protocol proposed by Pagnin et al. is vulnerable to secret disclosure attack. Moreover, we analyze the performance of the protocol in a noisy environment and show that it provides higher rejection probability than distance bounding protocols