On Communication Models When Verifying Equivalence Properties
From MaRDI portal
Recommendations
- A survey of symbolic methods for establishing equivalence-based properties in cryptographic protocols
- On the relationships between models in protocol verification
- About models of security protocols
- Verification methods for the computationally complete symbolic attacker based on indistinguishability
- Towards unconditional soundness: computationally complete symbolic attacker
Cites work
- A calculus for cryptographic protocols: The spi calculus
- 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
- Deciding equivalence-based properties using constraint solving
- Mobile values, new names, and secure communication
- Private authentication
- Verifying privacy-type properties of electronic voting protocols: a taster
Cited in
(3)
This page was built for publication: On Communication Models When Verifying Equivalence Properties
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3304813)