DeepSec: deciding equivalence properties for security protocols -- improved theory and practice
From MaRDI portal
Publication:6566464
DOI10.46298/THEORETICS.24.4MaRDI QIDQ6566464FDOQ6566464
Itsaka Rakotonirina, Steve Kremer, Vincent Cheval
Publication date: 3 July 2024
Published in: TheoretiCS (Search for Journal in Brave)
Cites Work
- YAPA
- Title not available (Why is that?)
- Computer Aided Verification
- SPEC: An Equivalence Checker for Security Protocols
- A calculus of mobile processes. I
- A calculus for cryptographic protocols: The spi calculus
- Automated Verification of Equivalence Properties of Cryptographic Protocols
- 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
- Private authentication
- Automated verification of selected equivalences for security protocols
- Decidability of equivalence of symbolic derivations
- Proving More Observational Equivalences with ProVerif
- Deciding knowledge in security protocols under equational theories
- Protocol insecurity with a finite number of sessions and composed keys is NP-complete.
- The Hitchhiker's guide to decidability and complexity of equivalence properties in security protocols
- Computing knowledge in security protocols under convergent equational theories
- Automating Security Analysis: Symbolic Equivalence of Constraint Systems
- From Security Protocols to Pushdown Automata
- Partial Order Reduction for Security Protocols
- Term Rewriting and Applications
- A complexity analysis of bisimilarity for value-passing processes
- The Applied Pi Calculus
- When are three voters enough for privacy properties?
This page was built for publication: DeepSec: deciding equivalence properties for security protocols -- improved theory and practice
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6566464)
