The following pages link to EasyCrypt (Q21717):
Displaying 32 items.
- Automated proofs of block cipher modes of operation (Q287326) (← links)
- Monoidal computer. I: Basic computability by string diagrams (Q385721) (← links)
- Formal verification of masked hardware implementations in the presence of glitches (Q1648840) (← links)
- Finding a middle ground for computer-aided cryptography (Q1662190) (← links)
- Authenticated confidential channel establishment and the security of TLS-DHE (Q1698403) (← 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)
- Belenios: a simple private and verifiable electronic voting system (Q2303376) (← 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)
- Post-quantum verification of Fujisaki-Okamoto (Q2692346) (← links)
- Probabilistic Functions and Cryptographic Oracles in Higher Order Logic (Q2802495) (← links)
- Security Protocol Verification: Symbolic and Computational Models (Q2894308) (← links)
- Verified Indifferentiable Hashing into Elliptic Curves (Q2894324) (← links)
- Probabilistic Relational Hoare Logics for Computer-Aided Security Proofs (Q2908554) (← links)
- Computer-Aided Cryptographic Proofs (Q2914729) (← 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)
- Another look at automated theorem-proving II (Q3225748) (← links)
- Beyond 2-Safety: Asymmetric Product Programs for Relational Program Verification (Q3455833) (← links)
- Relational Reasoning via Probabilistic Coupling (Q3460069) (← links)
- Proving uniformity and independence by self-composition and coupling (Q4645748) (← links)
- Tractable Inference Systems: An Extension with a Deducibility Predicate (Q4928430) (← links)
- Formalization in PVS of Balancing Properties Necessary for Proving Security of the Dolev-Yao Cascade Protocol Model (Q5195250) (← links)
- Computer-Aided Security Proofs for the Working Cryptographer (Q5199185) (← links)
- Automatic Verification of Security Protocols in the Symbolic Model: The Verifier ProVerif (Q5253587) (← links)
- Beyond Differential Privacy: Composition Theorems and Relational Logic for f-divergences between Probabilistic Programs (Q5327422) (← links)
- Probabilistic relational verification for cryptographic implementations (Q5408416) (← links)
- VPHL: a verified partial-correctness logic for probabilistic programs (Q5971408) (← links)
