ProVerif with Lemmas, Induction, Fast Subsumption, and Much More - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2022

ProVerif with Lemmas, Induction, Fast Subsumption, and Much More

Abstract

This paper presents a major overhaul of one the most widely used symbolic security protocol verifiers, ProVerif. We provide two main contributions. First, we extend ProVerif with lemmas, axioms, proofs by induction, natural numbers, and temporal queries. These features not only extend the scope of ProVerif, but can also be used to improve its precision (that is, avoid false attacks) and make it terminate more often. Second, we rework and optimize many of the algorithms used in ProVerif (generation of clauses, resolution, subsumption,. . .), resulting in impressive speed-ups on large examples.
Fichier principal
Vignette du fichier
main.pdf (423.55 Ko) Télécharger le fichier

Dates and versions

hal-03366962 , version 1 (07-10-2021)

Identifiers

  • HAL Id : hal-03366962 , version 1

Cite

Bruno Blanchet, Vincent Cheval, Véronique Cortier. ProVerif with Lemmas, Induction, Fast Subsumption, and Much More. S&P 2022 - 43rd IEEE Symposium on Security and Privacy, May 2022, San Francisco, United States. ⟨hal-03366962⟩
381 View
378 Download

Share

Gmail Facebook X LinkedIn More