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 …

We use symbolic formal models to study the composition of public key-based protocols with
public key infrastructures (PKIs). We put forth a minimal set of requirements which a PKI …

Typing and Compositionality for Stateful Security Protocols — Welcome to DTU Research
Database Skip to main navigation Skip to search Skip to main content Welcome to DTU …

This paper deals with a problem that arises in vertical composition of protocols, ie, when a
channel protocol is used to encrypt and transport arbitrary data from an application protocol …

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

This paper gives a modular verification methodology in which, given parametric
specifications of a key establishment protocol P and a protocol Q providing private channel …

Ensuring security is a fundamental problem in modern distributed systems. For that purpose,
system designers use security protocols, eg, to transfer confidential data or to authenticate a …

The main purpose of Password-Authenticated Key Exchange (PAKE) is to allow secure
authenticated communication over insecure networks between two or more parties who only …

The security goals of a protocol are often studied with the protocol running in isolation.
However, in reality, several protocols are running in parallel or are otherwise interacting with …