DeepSec: deciding equivalence properties for security protocols -- improved theory and practice
From MaRDI portal
Publication:6566464
Cites work
- A calculus for cryptographic protocols: The spi calculus
- A calculus of mobile processes. I
- A complexity analysis of bisimilarity for value-passing processes
- Automated verification of equivalence properties of cryptographic protocols
- Automated verification of selected equivalences for security protocols
- Automating security analysis: symbolic equivalence of constraint systems
- Computer Aided Verification
- Computing knowledge in security protocols under convergent equational theories
- Decidability of equivalence of symbolic derivations
- Deciding knowledge in security protocols under equational theories
- FAST: an efficient decision procedure for deduction and static equivalence
- From security protocols to pushdown automata
- Partial order reduction for security protocols
- Private authentication
- Protocol insecurity with a finite number of sessions and composed keys is NP-complete.
- Proving more observational equivalences with ProVerif
- SPEC: an equivalence checker for security protocols
- Term Rewriting and Applications
- The Applied Pi Calculus
- The Hitchhiker's guide to decidability and complexity of equivalence properties in security 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
- When are three voters enough for privacy properties?
- YAPA: a generic tool for computing intruder knowledge
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)
