Automating Security Analysis: Symbolic Equivalence of Constraint Systems
From MaRDI portal
Publication:5747780
DOI10.1007/978-3-642-14203-1_35zbMath1291.94068OpenAlexW1535988411MaRDI QIDQ5747780
Vincent Cheval, Stéphanie Delaune, Hubert Comon-Lundh
Publication date: 14 September 2010
Published in: Automated Reasoning (Search for Journal in Brave)
Full work available at URL: https://kar.kent.ac.uk/46730/1/CCD-ijcar10.pdf
Related Items
Stateful applied pi calculus: observational equivalence and labelled bisimilarity ⋮ POR for security protocol equivalences. Beyond action-determinism ⋮ Decidability of equivalence of symbolic derivations ⋮ Beyond Subterm-Convergent Equational Theories in Automated Verification of Stateful Protocols ⋮ On Communication Models When Verifying Equivalence Properties ⋮ A survey of symbolic methods for establishing equivalence-based properties in cryptographic protocols ⋮ A procedure for deciding symbolic equivalence between sets of constraint systems ⋮ Automating Security Analysis: Symbolic Equivalence of Constraint Systems ⋮ Automated Verification of Equivalence Properties of Cryptographic Protocols
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Decidability of equivalence of symbolic derivations
- Deciding knowledge in security protocols under equational theories
- Protocol insecurity with a finite number of sessions and composed keys is NP-complete.
- Automated verification of selected equivalences for security protocols
- Modal Logics for Cryptographic Processes
- Deciding security properties for cryptographic protocols. application to key cycles
- The NRL Protocol Analyzer: An Overview
- Challenges in the Automated Verification of Security Protocols
- YAPA: A Generic Tool for Computing Intruder Knowledge
- Mobile values, new names, and secure communication
- Automating Security Analysis: Symbolic Equivalence of Constraint Systems
This page was built for publication: Automating Security Analysis: Symbolic Equivalence of Constraint Systems
