initc3 / SaUCy
The modular protocol framework based on Universal Composability
☆18Updated 4 years ago
Alternatives and similar repositories for SaUCy:
Users that are interested in SaUCy are comparing it to the libraries listed below
- Multi-party computation utilities toolkit for rust☆16Updated 5 years ago
- Super Amazing Universal Composability, Yeah!☆34Updated 3 years ago
- Zero-Knowledge SNARKs from Linear-Size Universal and Updatable Structured Reference Strings☆45Updated 5 years ago
- A Python tool to manage and tag your bibliography (.bib and .pdf) files on Dropbox☆13Updated 2 years ago
- Generator and supporting evidence for security of the Tweedledum/Tweedledee pair of elliptic curves suitable for Halo☆20Updated 2 years ago
- Finite Fields and Curves in Lean☆13Updated 2 years ago
- C implementation of the CLT13 multilinear map☆14Updated 6 years ago
- Hackathon project for Snarky workshop.☆11Updated 5 years ago
- BLS working standard draft☆39Updated 5 years ago
- Argument systems for inner pairing products☆42Updated 9 months ago
- Coq definitions and lemmas for verification of Casper☆18Updated 5 years ago
- Early-stage research related to the Anoma protocols.☆23Updated last year
- Batch verifier for zkSNARKs☆10Updated 2 years ago
- Fawkes-Crypto - zkSNARKs framework☆22Updated last year
- Pure OCaml implementation of the Groth-Maller SNARK verifier (and associated crypto)☆55Updated 5 years ago
- Sonic implementation in Rust☆17Updated 5 years ago
- ☆48Updated 2 years ago
- Futhark implementation of neptune-compatible Poseidon.☆27Updated 4 years ago
- fft impl for ff::Field☆16Updated 11 months ago
- ☆32Updated 2 years ago
- Efficient zero-knowledge arguments in the discrete log setting, revisited☆15Updated 5 years ago
- Schnorr Protocol for Non-interactive Zero-Knowledge Proofs☆75Updated 5 years ago
- Optimised bilinear pairings over elliptic curves☆56Updated last year
- ☆15Updated 6 years ago
- A specification of the CBC Casper consensus protocols written in TLA+ and PlusCal (transpiled to TLA+)☆21Updated 5 years ago
- An O(N\log{N}) time algorithm for computing all N proofs fast in the Pointproofs VC. Also, the O(N\log{N}) time Feist-Khovratovich algori…☆13Updated 4 years ago
- BLST-Verification☆22Updated 3 months ago
- DSL for Secure DApps☆33Updated 2 years ago
- A library providing mechanized proofs of the LibraBFT consensus using the Coq theorem prover☆26Updated 4 years ago
- Rust implementation of ElGamal encryption☆14Updated last year