On Selecting the Nonce Length in Distance-Bounding Protocols | Zendy

Aikaterini Mitrokotsa | Zendy; Pedro PerisLopez | Zendy; Christos Dimitrakakis | Zendy; Serge Vaudenay | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

On Selecting the Nonce Length in Distance-Bounding Protocols

Author(s) -

Aikaterini Mitrokotsa,

Pedro PerisLopez,

Christos Dimitrakakis,

Serge Vaudenay

Publication year - 2013

Publication title -

the computer journal

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.319

H-Index - 64

eISSN - 1460-2067

pISSN - 0010-4620

DOI - 10.1093/comjnl/bxt033

Subject(s) - cryptographic nonce , gas meter prover , guard (computer science) , computer science , bounding overwatch , computer security , upper and lower bounds , countermeasure , key (lock) , authentication (law) , theoretical computer science , computer network , mathematics , encryption , artificial intelligence , mathematical analysis , geometry , engineering , mathematical proof , programming language , aerospace engineering

Distance-bounding protocols form a family of challenge–response authentication protocols that have been introduced to thwart relay attacks. They enable a verifier to authenticate and to establish an upper bound on the physical distance to an untrusted prover. We provide a detailed security analysis of a family of such protocols. More precisely, we show that the secret key shared between the verifi...

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research