On Selecting the Nonce Length in Distance-Bounding Protocols

摘要: Distance-bounding protocols form a family of challenge–response authentication that have been introduced to thwart relay attacks. They enable verifier authenticate and establish an upper bound on the physical distance an untrusted prover.We provide detailed security analysis of such protocols. More precisely, we show secret key shared between verifier and prover can be leaked after number nonce repetitions. The leakage probability, while exponentially decreasing with length, is only weakly dependent length. Our main contribution high probability sessions required for attacker to discover secret, experimental analysis attack under noisy conditions. Both these show attack’s success mainly depends length used nonces rather than key. theoretical could by practitioners to appropriately select their parameters. While longer guard against this type of attack, possible countermeasure which successfully combats these attacks even when short are