Proving Unlinkability using ProVerif through Desynchronized Bi-Processes - INRIA - Institut National de Recherche en Informatique et en Automatique Access content directly
Conference Papers Year : 2023

Proving Unlinkability using ProVerif through Desynchronized Bi-Processes

David Baelde
  • Function : Author
  • PersonId : 963016
Alexandre Debant
  • Function : Author
  • PersonId : 1028184
Stéphanie Delaune

Abstract

Unlinkability is a privacy property of crucial importance for several systems such as mobile phones or RFID chips. Analysing this security property is very complex, and highly error-prone. Therefore, formal verification with machine support is desirable. Unfortunately, existing techniques are not sufficient to directly apply verification tools to automatically prove unlinkability. In this paper, we overcome this limitation by defining a simple transformation that will exploit some specific features of ProVerif. This transformation, together with some generic axioms, allows the tool to successfully conclude on several case studies. We have implemented our approach, effectively obtaining direct proofs of unlinkability on several protocols that were, until now, out of reach of automatic verification tools.
Fichier principal
Vignette du fichier
main-csf.pdf (317.6 Ko) Télécharger le fichier
tool-and-examples.zip (53.91 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-03674979 , version 1 (25-05-2022)
hal-03674979 , version 2 (30-01-2023)

Identifiers

  • HAL Id : hal-03674979 , version 2

Cite

David Baelde, Alexandre Debant, Stéphanie Delaune. Proving Unlinkability using ProVerif through Desynchronized Bi-Processes. IEEE Computer Security Foundations Symposium, Jul 2023, Dubrovnik, Croatia. ⟨hal-03674979v2⟩
338 View
243 Download

Share

Gmail Facebook X LinkedIn More