BlanchetAbadiFournetJLAP07

Back to ProVerif

Bruno Blanchet, Martín Abadi, and Cédric Fournet. Automated Verification of Selected Equivalences for Security Protocols. Journal of Logic and Algebraic Programming, 75(1):3-51, February-March 2008. Tool feature

Copyright

Get the paper

.ps.gz, 316 Kb, .pdf, 466 Kb

Links

Official version at http://dx.doi.org/10.1016/j.jlap.2007.06.002.

ProVerif scripts at http://proverif.inria.fr/obsequi/.

Abstract

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.

Bibtex


@ARTICLE{BlanchetAbadiFournetJLAP07,
  AUTHOR = {Bruno Blanchet and Mart{\'\i}n Abadi and C{\'e}dric Fournet},
  TITLE = {Automated Verification of Selected Equivalences for Security Protocols},
  JOURNAL = {Journal of Logic and Algebraic Programming},
  YEAR = 2008,
  VOLUME = 75,
  NUMBER = 1,
  PAGES = {3--51},
  MONTH = FEB # {--} # MAR
}