Back to ProVerif
Vincent Cheval and Bruno Blanchet. Proving More Observational Equivalences with ProVerif. In David Basin and John Mitchell, editors, 2nd Conference on Principles of Security and Trust (POST 2013), volume 7796 of Lecture Notes in Computer Science, pages 226-246, Rome, Italy, March 2013. Springer. Tool feature


© Springer-Verlag.

Get the paper

.pdf, 394 Kb


LNCS series home page.

This paper at Springer:


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.


  AUTHOR = {Vincent Cheval and Bruno Blanchet},
  TITLE = {Proving More Observational Equivalences with {P}ro{V}erif},
  BOOKTITLE = {2nd Conference on Principles of Security and Trust (POST 2013)},
  PAGES = {226--246},
  YEAR = 2013,
  EDITOR = {David Basin and John Mitchell},
  VOLUME = 7796,
  SERIES = {Lecture Notes in Computer Science},
  ADDRESS = {Rome, Italy},
  PUBLISHER = {Springer}