Distance-bounding Identification

Distance bounding (DB) protocols allow a prover to convince a verifier that they are within a distance bound. We propose a new approach to formalizing the security of DB protocols that we call distance-bounding identification (DBID), and is inspired by the security definition of cryptographic identification protocols. Our model provides a natural way of modeling the strongest man-in-the-middle attack, making security of DB protocols in line with identification protocols. We compare our model with other existing models, and give a construction that is secure in the proposed model.