RFID distance bounding protocol using m-ary challenges

摘要

In this paper, we propose a RFID distance bounding protocol. Recently, Kim and Avoine proposed distance bounding protocols with mixed challenges which are pre-determined or random. We generalized the first scheme of the Kim and Avoine''s work as a distance bounding protocol with m-ary challenges. Using m-ary challenges, it is possible to reduce the mafia fraud success probability from (3/4)ⁿ for m = 2 to (7/16)ⁿ for m = 4.