Skip to Main content Skip to Navigation
Conference papers

Proving More Observational Equivalences with ProVerif

Abstract : This paper presents an extension of the automatic protocol verifier ProVerif in order to prove more observational equivalences. ProVerif can prove observational equivalence between processes that have the same structure but differ by the messages they contain. In order to extend the class of equivalences that ProVerif handles, we extend the language of terms by defining more functions (destructors) by rewrite rules. In particular, we allow rewrite rules with inequalities as side-conditions, so that we can express tests ''if then else'' inside terms. Finally, we provide an automatic procedure that translates a process into an equivalent process that performs as many actions as possible inside terms, to allow ProVerif to prove the desired equivalence. These extensions have been implemented in ProVerif and allow us to automatically prove anonymity in the private authentication protocol by Abadi and Fournet.
Document type :
Conference papers
Complete list of metadata
Contributor : Ben Smyth Connect in order to contact the contributor
Submitted on : Wednesday, September 18, 2013 - 5:37:09 PM
Last modification on : Friday, January 21, 2022 - 3:15:20 AM

Links full text



Vincent Cheval, Bruno Blanchet. Proving More Observational Equivalences with ProVerif. POST 2013 - 2nd Conference on Principles of Security and Trust, Mar 2013, Rome, Italy. pp.226-246, ⟨10.1007/978-3-642-36830-1_12⟩. ⟨hal-00863377⟩



Les métriques sont temporairement indisponibles