Automated Security Proofs with Sequences of Games
From MaRDI portal
Recommendations
Cited in
(21)- Automated proof of Bell-LaPadula security properties
- CryptHOL: game-based proofs in higher-order logic
- Formal security proofs with minimal fuss: implicit computational complexity at work
- Automated proofs of block cipher modes of operation
- Formal modeling of random oracle programmability and verification of signature unforgeability using task-PIOAs
- Certified security proofs of cryptographic protocols in the computational model: an application to intrusion resilience
- Another look at automated theorem-proving. II
- Formal Proof of Provable Security by Game-Playing in a Proof Assistant
- Inductive Proofs of Computational Secrecy
- Security Analysis of Standard Authentication and Key Agreement Protocols Utilising Timestamps
- Certifying assembly with formal security proofs: the case of BBS
- A Calculus for Game-Based Security Proofs
- Automated proofs for asymmetric encryption
- Formal certification of code-based cryptographic proofs
- Automated proofs for asymmetric encryption
- A survey of symbolic methods in computational analysis of cryptographic systems
- Another look at automated theorem-proving
- Information Security
- Automated unbounded analysis of cryptographic constructions in the generic group model
- Programming language techniques for cryptographic proofs
- Machine-checked security proofs of cryptographic signature schemes
This page was built for publication: Automated Security Proofs with Sequences of Games
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5756645)
