CryptHOL
From MaRDI portal
Cited in
(34)- EasyUC
- How to simulate it in Isabelle: towards formal proof for secure multi-party computation
- Relational parametricity and quotient preservation for modular (co)datatypes
- Formalising \(\varSigma\)-protocols and commitment schemes using crypthol
- MoSS: modular security specifications framework
- EasyCrypt
- CryptHOL: game-based proofs in higher-order logic
- GNUC
- Autoref
- Ergodic theory
- Zoo Probabilistic Systems
- Monomorphic Monad
- Amortized Complexity
- QuickSort Cost
- Treaps
- Root Balanced Tree
- Random BSTs
- Density Compiler
- LLL Factorization
- Ordinals Cardinals
- ProofPeer
- Regex_Equivalence
- Quotients of bounded natural functors
- Quotients of Bounded Natural Functors
- Probabilistic_While
- MFMC_Countable
- Game_Based_Crypto
- Monad normalisation
- Probabilistic_Prime_Tests
- Verified analysis of random binary tree structures
- Verified analysis of random binary tree structures
- FindFacts
- Smooth_Manifolds
- MoSS
This page was built for software: CryptHOL
