Help Privacy Policy Disclaimer
  Advanced SearchBrowse




Conference Paper

Automated Verification of Selected Equivalences for Security Protocols


Blanchet,  Bruno
Static Analysis, MPI for Informatics, Max Planck Society;

External Resource
No external resources are shared
Fulltext (restricted access)
There are currently no full texts shared for your IP range.
Fulltext (public)
There are no public fulltexts stored in PuRe
Supplementary Material (public)
There is no public supplementary material available

Blanchet, B., Abadi, M., & Fournet, C. (2005). Automated Verification of Selected Equivalences for Security Protocols. In 20th IEEE Symposium on Logic in Computer Science (LICS 2005) (pp. 331-340). Los Alamitos, USA: IEEE.

Cite as: https://hdl.handle.net/11858/00-001M-0000-000F-2865-8
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 \approx 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.