DeepSec: deciding equivalence properties for security protocols -- improved theory and practice
From MaRDI portal
Publication:6566464
DOI10.46298/theoretics.24.4MaRDI QIDQ6566464
Itsaka Rakotonirina, Steve Kremer, Vincent Cheval
Publication date: 3 July 2024
Published in: TheoretiCS (Search for Journal in Brave)
Cites Work
- Unnamed Item
- Decidability of equivalence of symbolic derivations
- Computing knowledge in security protocols under convergent equational theories
- Deciding knowledge in security protocols under equational theories
- A calculus of mobile processes. I
- A calculus for cryptographic protocols: The spi calculus
- A complexity analysis of bisimilarity for value-passing processes
- Protocol insecurity with a finite number of sessions and composed keys is NP-complete.
- Private authentication
- The Hitchhiker's guide to decidability and complexity of equivalence properties in security protocols
- When are three voters enough for privacy properties?
- Tools and algorithms for the construction and analysis of systems. 20th international conference, TACAS 2014, held as part of the European joint conferences on theory and practice of software, ETAPS 2014, Grenoble, France, April 5--13, 2014. Proceedings
- Automated verification of selected equivalences for security protocols
- YAPA
- The Applied Pi Calculus
- SPEC: An Equivalence Checker for Security Protocols
- From Security Protocols to Pushdown Automata
- Automated Verification of Equivalence Properties of Cryptographic Protocols
- Proving More Observational Equivalences with ProVerif
- Partial Order Reduction for Security Protocols
- Term Rewriting and Applications
- Computer Aided Verification
- Automating Security Analysis: Symbolic Equivalence of Constraint Systems
This page was built for publication: DeepSec: deciding equivalence properties for security protocols -- improved theory and practice
