All the existing distance bounding protocols based on binary challenges, without final signature, provide an adversary success probability equal to (3/4)^n where n is the number of rounds in the protocol. In this paper, we introduce a new protocol based on binary mixed challenges that converges toward the expected and optimal (1/2)^n bound. We prove its security in case of both noisy and non-noisy channels.
Category / Keywords: cryptographic protocols / RFID, authentication, distance bounding protocol, relay attack. Publication Info: Full version of the paper published at IEEE Trans. on Wireless Communications 10(5): 1618-1626 (2011). Date: received 26 Jun 2009, last revised 23 Jan 2012 Contact author: gildas avoine at uclouvain be Available format(s): PDF | BibTeX Citation Version: 20120123:161003 (All versions of this report) Short URL: ia.cr/2009/310