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