Pages that link to "Item:Q5199185"
From MaRDI portal
The following pages link to Computer-Aided Security Proofs for the Working Cryptographer (Q5199185):
Displaying 30 items.
- Automated proofs of block cipher modes of operation (Q287326) (← links)
- Monoidal computer. I: Basic computability by string diagrams (Q385721) (← links)
- Verified cryptographic code for everybody (Q832216) (← links)
- Short variable length domain extenders with beyond birthday bound security (Q1633453) (← links)
- Finding a middle ground for computer-aided cryptography (Q1662190) (← links)
- How to simulate it in Isabelle: towards formal proof for secure multi-party computation (Q1687724) (← links)
- Authenticated confidential channel establishment and the security of TLS-DHE (Q1698403) (← links)
- State separation for code-based game-playing proofs (Q1710673) (← links)
- Formalising \(\varSigma\)-protocols and commitment schemes using crypthol (Q2031427) (← links)
- MoSS: modular security specifications framework (Q2128988) (← links)
- CryptHOL: game-based proofs in higher-order logic (Q2175214) (← links)
- System-level non-interference of constant-time cryptography. II: Verified static analysis and stealth memory (Q2228439) (← links)
- Implicit computational complexity of subrecursive definitions and applications to cryptographic proofs (Q2331068) (← links)
- Formal security proofs with minimal fuss: implicit computational complexity at work (Q2343128) (← links)
- Proof producing synthesis of arithmetic and cryptographic hardware (Q2642982) (← links)
- Post-quantum verification of Fujisaki-Okamoto (Q2692346) (← links)
- Proof techniques for cryptographic processes (Q2784489) (← links)
- Probabilistic Functions and Cryptographic Oracles in Higher Order Logic (Q2802495) (← links)
- Emerging Issues and Trends in Formal Methods in Cryptographic Protocol Analysis: Twelve Years Later (Q2945721) (← links)
- Computer-Aided Verification for Mechanism Design (Q2959836) (← links)
- Probabilistic Termination by Monadic Affine Sized Typing (Q2988649) (← links)
- Verifiable Side-Channel Security of Cryptographic Implementations: Constant-Time MEE-CBC (Q4639476) (← links)
- Formalization in PVS of Balancing Properties Necessary for Proving Security of the Dolev-Yao Cascade Protocol Model (Q5195250) (← links)
- Automatic Verification of Security Protocols in the Symbolic Model: The Verifier ProVerif (Q5253587) (← links)
- EasyCrypt: A Tutorial (Q5253588) (← links)
- Programming Languages and Systems (Q5316562) (← links)
- A “proof-reading” of Some Issues in Cryptography (Q5428793) (← links)
- VPHL: a verified partial-correctness logic for probabilistic programs (Q5971408) (← links)
- Formalizing Coppersmith's method in Isabelle/HOL (Q6648162) (← links)
- Formally verifying Kyber. Episode V: machine-checked IND-CCA security and correctness of ML-KEM in Easycrypt (Q6648215) (← links)
