Combining ProVerif and Automated Theorem Provers for Security Protocol Verification

Li, Di Long; Tiu, Alwen

doi:10.1007/978-3-030-29436-6_21

Search citation statements

Order By: Relevance

Paper Sections

Select...

Related Work1

Citation Types

Supporting

Mentioning

Contrasting

Year Published

2021

2024

Publication Types

Select...

Other3

Book1

Article1

Relationship

Self Cite0

Independent5

Authors

Journals

Cited by 6 publications

(1 citation statement)

References 26 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The development of ProVerif started more than 20 years ago, and several results have gradually improved the tool. Recently, a new approach [28] has been proposed to cover more complex equational theories (such as the one of XOR) in ProVerif, using an external solver to saturate the clauses modulo the theory. This approach applies to the secrecy property only.…”

Section: Related Workmentioning

confidence: 99%

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

Blanchet

Cheval

Cortier

2022

2022 IEEE Symposium on Security and Privacy (SP)

View full text Add to dashboard Cite

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.

show abstract

Section: Related Workmentioning

confidence: 99%