Cryptographically sound and machine-assisted verification of security protocols
From MaRDI portal
Recommendations
- Deriving cryptographically sound implementations using composition and formally verified bisimulation
- Computer-assisted verification of a protocol for certified email
- Computer-assisted verification of a protocol for certified email
- Three systems for cryptographic protocol analysis
- scientific article; zbMATH DE number 1860614
Cited in
(25)- Verification of cryptographic protocols: tagging enforces termination
- Secure mechanical verification of mutually recursive procedures
- The reactive simulatability (RSIM) framework for asynchronous systems
- Unifying simulatability definitions in cryptographic systems under different timing assumptions
- Computer-assisted verification of a protocol for certified email
- Automatic verification of secrecy properties for linear logic specifications of cryptographic protocols
- Emerging issues and trends in formal methods in cryptographic protocol analysis: twelve years later
- A Testing Theory for a Higher-Order Cryptographic Language
- Validating Security Protocols under the General Attacker
- Finite Models in FOL-Based Crypto-Protocol Verification
- Deriving cryptographically sound implementations using composition and formally verified bisimulation
- Computer-assisted verification of a protocol for certified email
- scientific article; zbMATH DE number 7378548 (Why is no real title available?)
- scientific article; zbMATH DE number 7297874 (Why is no real title available?)
- scientific article; zbMATH DE number 7300321 (Why is no real title available?)
- Formalization in PVS of balancing properties necessary for proving security of the Dolev-Yao cascade protocol model
- Computer-Aided Security Proofs for the Working Cryptographer
- Automatic verification of cryptographic protocols with SETHEO
- Computationally sound, automated proofs for security protocols
- Probabilistic relational verification for cryptographic implementations
- On Simulatability Soundness and Mapping Soundness of Symbolic Cryptography
- Weakening the perfect encryption assumption in Dolev-Yao adversaries
- A cryptographically sound Dolev-Yao style security proof of the Otway-Rees protocol
- Cryptographically sound security proofs for basic and public-key Kerberos
- Soundness of Formal Encryption in the Presence of Key-Cycles
This page was built for publication: Cryptographically sound and machine-assisted verification of security protocols
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4418691)
