Summary: Automated Verification of Selected Equivalences for Security Protocols
CNRS, ´Ecole Normale Sup´erieure, Paris
University of California, Santa Cruz
Microsoft Research, Cambridge
In the analysis of security protocols, methods and tools
for reasoning about protocol behaviors have been quite ef-
fective. 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 cal-
culus and implement them in the tool ProVerif.
Many security properties can be expressed as predicates