EasyCrypt
From MaRDI portal
Software:21717
No author found.
Source code repository: https://github.com/EasyCrypt/easycrypt
Related Items (32)
MoSS: modular security specifications framework ⋮ Automated proofs of block cipher modes of operation ⋮ Security Protocol Verification: Symbolic and Computational Models ⋮ Verified Indifferentiable Hashing into Elliptic Curves ⋮ Beyond 2-Safety: Asymmetric Product Programs for Relational Program Verification ⋮ Probabilistic Relational Hoare Logics for Computer-Aided Security Proofs ⋮ Relational Reasoning via Probabilistic Coupling ⋮ Computer-Aided Cryptographic Proofs ⋮ Formal verification of masked hardware implementations in the presence of glitches ⋮ Finding a middle ground for computer-aided cryptography ⋮ Beyond Differential Privacy: Composition Theorems and Relational Logic for f-divergences between Probabilistic Programs ⋮ CryptHOL: game-based proofs in higher-order logic ⋮ Monoidal computer. I: Basic computability by string diagrams ⋮ Emerging Issues and Trends in Formal Methods in Cryptographic Protocol Analysis: Twelve Years Later ⋮ Another look at automated theorem-proving II ⋮ Computer-Aided Verification for Mechanism Design ⋮ Authenticated confidential channel establishment and the security of TLS-DHE ⋮ Post-quantum verification of Fujisaki-Okamoto ⋮ VPHL: a verified partial-correctness logic for probabilistic programs ⋮ Probabilistic Termination by Monadic Affine Sized Typing ⋮ System-level non-interference of constant-time cryptography. II: Verified static analysis and stealth memory ⋮ Proving uniformity and independence by self-composition and coupling ⋮ Probabilistic relational verification for cryptographic implementations ⋮ Tractable Inference Systems: An Extension with a Deducibility Predicate ⋮ Formalising \(\varSigma\)-protocols and commitment schemes using crypthol ⋮ Computer-Aided Security Proofs for the Working Cryptographer ⋮ Probabilistic Functions and Cryptographic Oracles in Higher Order Logic ⋮ Belenios: a simple private and verifiable electronic voting system ⋮ Implicit computational complexity of subrecursive definitions and applications to cryptographic proofs ⋮ Formalization in PVS of Balancing Properties Necessary for Proving Security of the Dolev-Yao Cascade Protocol Model ⋮ Automatic Verification of Security Protocols in the Symbolic Model: The Verifier ProVerif ⋮ Formal security proofs with minimal fuss: implicit computational complexity at work
This page was built for software: EasyCrypt
