Proving More Observational Equivalences with ProVerif - Archive ouverte HAL Access content directly
Conference Papers Year : 2013

Proving More Observational Equivalences with ProVerif

(1) , (2)
1
2
Bruno Blanchet

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.

Dates and versions

hal-00863377 , version 1 (18-09-2013)

Identifiers

Cite

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⟩
79 View
0 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More