Security protocol verification has been a very active research area since the 1990s. This
paper surveys various approaches in this area, considering the verification in the symbolic …

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 …

Indistinguishability properties are essential in formal verification of cryptographic protocols.
They are needed to model anonymity properties, strong versions of confidentiality, and …

This paper presents an extension of the automatic protocol verifier ProVerif in order to prove
more observational equivalences. ProVerif can prove observational equivalence between …

Models and Proofs of Protocol Security: A Progress Report Page 1 Models and Proofs of
Protocol Security: A Progress Report Martın Abadi1,2, Bruno Blanchet3,4,5, and Hubert …

We consider the problem of automating open bisimulation checking for the spi calculus, an
extension of the pi-calculus with cryptographic primitives. The notion of open bisimulation …

Formal methods have proved their usefulness for analyzing the security of protocols. Most
existing results focus on trace properties like secrecy or authentication. There are however …

We consider security properties of cryptographic protocols that can be modeled using the
notion of trace equivalence. The notion of equivalence is crucial when specifying privacy …

Formal methods have proved their usefulness for analyzing the security of protocols. Most
existing results focus on trace properties like secrecy (expressed as a reachability property) …

Observational equivalence allows us to study important security properties such as
anonymity. Unfortunately, the difficulty of proving observational equivalence hinders …