Communication networks like the Internet form a large distributed system where a huge
number of components run in parallel, such as security protocols and distributed web …

We prove a parallel compositionality result for protocols with a shared mutable state, ie,
stateful protocols. For protocols satisfying certain compositionality conditions our result …

In the setting of concurrent self composition, a single protocol is executed many times
concurrently in a network. In this paper, we prove lower bounds and impossibility results for …

Security protocols are small distributed programs that are designed to ensure security over
untrusted networks such as the Internet. They are notoriously dificult to design and flaws can …

We provide in this AFP entry several relative soundness results for security protocols. In
particular, we prove typing and compositionality results for stateful protocols (ie, protocols …

A recent development in formal security protocol analysis is the Protocol Composition Logic
(PCL). We identify a number of problems with this logic as well as with extensions of the …

In the setting of concurrent self composition, a single protocol is executed many times
concurrently by a single set of parties. In this paper, we prove that there exist many …

Many authentication and key exchange protocols are built using an accepted set of standard
concepts such as Diffie–Hellman key exchange, nonces to avoid replay, certificates from an …

The application of formal methods to security protocol analysis has been extensively
researched during the last 25 years. Several formalisms and (semi-) automatic tools for the …

We investigate the question of whether security of protocols in the information-theoretic
setting (where the adversary is computationally unbounded) implies security under …