Safely composing security protocols
From MaRDI portal
Publication:1028731
DOI10.1007/s10703-008-0059-4zbMath1165.68358OpenAlexW2027660602MaRDI QIDQ1028731
Véronique Cortier, Stéphanie Delaune
Publication date: 6 July 2009
Published in: Formal Methods in System Design (Search for Journal in Brave)
Full work available at URL: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.123.8582
Network design and communication in computer systems (68M10) Data encryption (aspects in computer science) (68P25) Theory of software (68N99)
Related Items (6)
Compositional System Security with Interface-Confined Adversaries ⋮ The Open-Source Fixed-Point Model Checker for Symbolic Analysis of Security Protocols ⋮ Modular verification of protocol equivalence in the presence of randomness ⋮ Stateful protocol composition ⋮ Composition of password-based protocols ⋮ Distributed temporal logic for the analysis of security protocol models
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Protocol insecurity with a finite number of sessions and composed keys is NP-complete.
- Security properties: two agents are sufficient
- A framework for compositional verification of security protocols
- Universally Composable Security with Global Setup
- An Efficient Unification Algorithm
- Using encryption for authentication in large networks of computers
- On the Security of PKCS #11
- Deciding Key Cycles for Security Protocols
- Advances in Cryptology - CRYPTO 2003
- Safely Composing Security Protocols
- Bounding Messages for Free in Security Protocols
- From One Session to Many: Dynamic Tags for Security Protocols
- Logic for Programming, Artificial Intelligence, and Reasoning
- Computer Aided Verification
This page was built for publication: Safely composing security protocols
