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 …

As cryptographic proofs have become essentially unverifiable, cryptographers have argued
in favor of develo** techniques that help tame the complexity of their proofs. Game-based …

We present a new mechanized prover for secrecy properties of security protocols. In contrast
to most previous provers, our tool does not rely on the Dolev-Yao model, but on the …

We present the first idealized cryptographic library that can be used like the Dolev-Yao
model for automated proofs of cryptographic protocols that use nested cryptographic …

We consider compositional properties of reactive systems that are secure in a cryptographic
sense. We follow the well-known simulatability approach of modern cryptography, ie, the …

Since the 1980s, two approaches have been developed for analyzing security protocols.
One of the approaches relies on a computational model that considers issues of complexity …

We define reactive simulatability for general asynchronous systems. Roughly, simulatability
means that a real system implements an ideal system (specification) in a way that preserves …

Recently we showed how to justify a Dolev-Yao type model of cryptography as used in
virtually all automated protocol provers under active attacks and in arbitrary protocol …

Key-dependent message (KDM) security was introduced by Black, Rogaway and Shrimpton
to address the case where key cycles occur among encryptions, eg, a key is encrypted with …

We present a new mechanized prover for showing correspondence assertions for
cryptographic protocols in the computational model. Correspondence assertions are useful …