Cited in
(65)- Security protocol verification: symbolic and computational models
- Implicit computational complexity of subrecursive definitions and applications to cryptographic proofs
- Probabilistic termination by monadic affine sized typing
- Automatic verification of security protocols in the symbolic model: the verifier ProVerif
- Authenticated confidential channel establishment and the security of TLS-DHE
- Computer-aided verification for mechanism design
- Emerging issues and trends in formal methods in cryptographic protocol analysis: twelve years later
- Automated proofs of block cipher modes of operation
- Computer-Aided Security Proofs for the Working Cryptographer
- MoSS: modular security specifications framework
- Tractable inference systems: an extension with a deducibility predicate
- Beyond 2-safety: asymmetric product programs for relational program verification
- 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
- Belenios: a simple private and verifiable electronic voting system
- Probabilistic relational Hoare logics for computer-aided security proofs
- Formal verification of masked hardware implementations in the presence of glitches
- CryptHOL: game-based proofs in higher-order logic
- COSTA
- TulaFale
- AVISPA
- CertiCrypt
- scyther
- ASPIER
- Spi2Java
- GNUC
- pGCL
- Plutus
- CoSP
- ALEA
- F*
- CryptHOL
- LLL Factorization
- Zoo Probabilistic Systems
- acrt
- REBECCA
- CacheAudit
- Yosys
- Helios
- HACL*
- Game_Based_Crypto
- MFMC_Countable
- Probabilistic_While
- Computer-aided cryptographic proofs
- Finding a middle ground for computer-aided cryptography
- System-level non-interference of constant-time cryptography. II: Verified static analysis and stealth memory
- Formalization in PVS of balancing properties necessary for proving security of the Dolev-Yao cascade protocol model
- Formal security proofs with minimal fuss: implicit computational complexity at work
- MoSS
- Belenios
- Another look at automated theorem-proving. II
- RHLE Benchmarks
- VPHL: a verified partial-correctness logic for probabilistic programs
- Probabilistic relational verification for cryptographic implementations
- AMulet
- EasyUC
- G6K
- Q#
- Probabilistic functions and cryptographic oracles in higher order logic
- Relational reasoning via probabilistic coupling
- Post-quantum verification of Fujisaki-Okamoto
- Beyond Differential Privacy: Composition Theorems and Relational Logic for f-divergences between Probabilistic Programs
- Jasmin
- Verified indifferentiable hashing into elliptic curves
This page was built for software: EasyCrypt
