Pages that link to "Item:Q5505567"
From MaRDI portal
The following pages link to A Formal Language for Cryptographic Pseudocode (Q5505567):
Displaying 8 items.
- Certifying assembly with formal security proofs: the case of BBS (Q436406) (← links)
- CryptHOL: game-based proofs in higher-order logic (Q2175214) (← links)
- Formal security proofs with minimal fuss: implicit computational complexity at work (Q2343128) (← links)
- Probabilistic Functions and Cryptographic Oracles in Higher Order Logic (Q2802495) (← links)
- Beyond Provable Security Verifiable IND-CCA Security of OAEP (Q3073706) (← links)
- A Formalization of Polytime Functions (Q3088001) (← links)
- The Computational SLR: A Logic for Reasoning about Computational Indistinguishability (Q3637209) (← links)
- A Calculus for Game-Based Security Proofs (Q4933210) (← links)
