Efficiently deciding equivalence for standard primitives and phases
From MaRDI portal
Publication:2167745
DOI10.1007/978-3-319-99073-6_24zbMath1496.68060OpenAlexW2887105535MaRDI QIDQ2167745
Stéphanie Delaune, Véronique Cortier, Antoine Dallon
Publication date: 25 August 2022
Full work available at URL: https://doi.org/10.1007/978-3-319-99073-6_24
Related Items (2)
Efficiently deciding equivalence for standard primitives and phases ⋮ A decidable class of security protocols for both reachability and equivalence properties
Cites Work
- Unnamed Item
- Deciding equivalence-based properties using constraint solving
- A rewriting-based inference system for the NRL protocol analyzer and its meta-logical properties
- Fast planning through planning graph analysis
- Checking trace equivalence: how to get rid of nonces?
- Efficiently deciding equivalence for standard primitives and phases
- Equivalence properties by typing in cryptographic branching protocols
- Automated verification of selected equivalences for security protocols
- Automated Verification of Equivalence Properties of Cryptographic Protocols
- Typing Messages for Free in Security Protocols: The Case of Equivalence Properties
- Verifying Privacy-Type Properties of Electronic Voting Protocols: A Taster
- Typing Messages for Free in Security Protocols
- Mobile values, new names, and secure communication
This page was built for publication: Efficiently deciding equivalence for standard primitives and phases