Skip to Main content Skip to Navigation

So near and yet so far - Symbolic verification of distance-bounding protocols

Abstract : The rise of new technologies, and in particular Near Field Communication (NFC) tags, offers new applications such as contactless payments, key-less entry systems, transport ticketing. .. Due to their security concerns, new security protocols, called distance-bounding protocols, have been developed to ensure physical proximity of the devices during a session. In order to prevent flaws and attacks, these protocols require formal verification. In this paper, we propose a new symbolic model allowing us to take into account the location of the agents and to model the fact that transmitting a message takes time. We propose two reduction results to render automatic verification possible relying on the existing verification tool ProVerif. Then, we perform a comprehensive case studies analysis (more than 25 protocols) relying on our new framework and its integration in ProVerif. We obtain new proofs of security for some protocols and detect attacks on some others.
Document type :
Complete list of metadata
Contributor : Alexandre Debant Connect in order to contact the contributor
Submitted on : Friday, November 26, 2021 - 1:26:11 PM
Last modification on : Monday, January 10, 2022 - 3:10:02 PM


  • HAL Id : hal-02965322, version 2


Alexandre Debant, Stéphanie Delaune, Cyrille Wiedling. So near and yet so far - Symbolic verification of distance-bounding protocols. [Research Report] Univ Rennes, CNRS, IRISA, France. 2020. ⟨hal-02965322v2⟩



Les métriques sont temporairement indisponibles