microsoft / oZKS
oZKS (Ordered Zero-Knowledge Set) is a library that provides an implementation of an Ordered (and Append Only) Zero-Knowledge Set.
☆19Updated 8 months ago
Alternatives and similar repositories for oZKS:
Users that are interested in oZKS are comparing it to the libraries listed below
- ☆32Updated 2 years ago
- Implementation of the Groth16 zk-SNARK proving system☆22Updated 6 years ago
- Fast and simple constant-time hashing to the BLS12-381 elliptic curve☆43Updated 4 years ago
- A zk-SNARK for randomized algorithms + linear-size universal circuits☆17Updated 3 years ago
- Argument systems for inner pairing products☆41Updated 5 months ago
- A zkSNARK implementation of a merkle tree membership preimage proof.☆24Updated 5 years ago
- Curve ecGFp5☆68Updated 2 years ago
- Describe elliptic curves☆35Updated 3 years ago
- ☆22Updated last month
- BLS working standard draft☆39Updated 5 years ago
- Implementation of the ZKB++ proof system☆20Updated 5 years ago
- Generator and supporting evidence for security of the Tweedledum/Tweedledee pair of elliptic curves suitable for Halo☆20Updated 2 years ago
- Generator and supporting evidence for security of the Pallas/Vesta pair of elliptic curves suitable for Halo☆55Updated last year
- Identity Based Encryption schemes on the BLS12-381 pairing-friendly elliptic curve☆20Updated 3 years ago
- ☆48Updated last year
- Blind signatures over secp256k1 elliptic curve☆17Updated 2 years ago
- Rust library for building IQC: cryptography based on class groups of imaginary quadratic orders☆63Updated last year
- A library for generating non-interactive proofs of knowledge without trusted setup☆29Updated 5 years ago
- Code for zero-knowledge middleboxes☆61Updated 2 years ago
- fft impl for ff::Field☆15Updated 8 months ago
- An independent reimplementation of (vn)TinyRAM☆37Updated 8 years ago
- Sage implementation of the isogeny-and-pairing based VDF☆24Updated 3 years ago
- Hyrax reference implementation: meta-repo with top-level makefile, etc☆35Updated 6 years ago
- distributed RSA modulus generation in Rust☆15Updated 2 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
- Recursive SNARKs based on Plonk and Halo☆114Updated 3 years ago
- An api for constructing sparse Merkle tree accumulators with random sampling capabilities.☆24Updated 3 years ago
- A golang demo for zk-SNARK aggregation☆41Updated 5 years ago
- HashWires is a range proof system for credentials issued by a trusted third party.☆19Updated 2 years ago
- ☆12Updated 4 years ago