Back to ProVerif
Bruno Blanchet, Martín Abadi, and Cédric Fournet. Automated Verification of Selected Equivalences for Security Protocols. In 20th IEEE Symposium on Logic in Computer Science (LICS 2005), pages 331-340, Chicago, IL, June 2005. IEEE Computer Society. Tool feature

Get the paper

.ps.gz, 104 Kb, .pdf, 168 Kb


Software, scripts, and long version.

Slides of the talk.


In the analysis of security protocols, methods and tools for reasoning about protocol behaviors have been quite effective. We aim to expand the scope of those methods and tools. We focus on proving equivalences P ~ Q in which P and Q are two processes that differ only in the choice of some terms. These equivalences arise often in applications. We show how to treat them as predicates on the behaviors of a process that represents P and Q at the same time. We develop our techniques in the context of the applied pi calculus and implement them in the tool ProVerif.


  AUTHOR = {Bruno Blanchet and Mart{\'\i}n Abadi and C{\'e}dric Fournet},
  TITLE = {Automated {V}erification of {S}elected {E}quivalences for {S}ecurity {P}rotocols},
  BOOKTITLE = {20th IEEE Symposium on Logic in Computer Science (LICS 2005)},
  PAGES = {331--340},
  YEAR = 2005,
  ADDRESS = {Chicago, IL},
  PUBLISHER = {IEEE Computer Society}