We present composition theorems for security protocols, to compose a key exchange
protocol and a symmetric-key protocol that uses the exchanged key. Our results rely on the …

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 …

Isolated Execution Environments (IEEs), such as ARM TrustZone and Intel SGX, offer the
possibility to execute sensitive code in isolation from other malicious programs, running on …

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 …

Security properties of cryptographic protocols are typically expressed as reachability or
equivalence properties. Secrecy and authentication are examples of reachability properties …

Security protocols that provide privacy and anonymity guarantees are growing increasingly
prevalent in the online world. The highly intricate nature of these protocols makes them …

Recently, several composition results have been established, showing that two
cryptographic protocols proven secure against a Dolev-Yao attacker continue to afford the …

This paper firstly introduces a novel security definition for BLAC-like schemes (BLAC
represents TTP-free BLacklistable Anonymous Credentials) in symbolic model using applied …