microsoft / oZKSLinks
oZKS (Ordered Zero-Knowledge Set) is a library that provides an implementation of an Ordered (and Append Only) Zero-Knowledge Set.
☆28Updated 2 months ago
Alternatives and similar repositories for oZKS
Users that are interested in oZKS are comparing it to the libraries listed below
Sorting:
- ☆47Updated 2 years ago
- Fully-compatible implementation of Privacy Pass in Rust.☆35Updated 5 years ago
- ☆22Updated last year
- A library for decentralized private computation☆19Updated 4 years ago
- Argument systems for inner pairing products☆43Updated last year
- ☆31Updated 2 months ago
- A zkSNARK implementation of a merkle tree membership preimage proof.☆23Updated 6 years ago
- Discrete-event simulation for BFT consensus protocols☆48Updated 4 years ago
- distributed RSA modulus generation in Rust☆15Updated 3 years ago
- ☆13Updated 5 years ago
- Implementation of incrementally verifiable ledger system☆18Updated 4 years ago
- Curve ecGFp5☆69Updated 3 years ago
- Implementation of the Groth16 zk-SNARK proving system☆21Updated 7 years ago
- Low-level language for encoding AIR of computations☆38Updated 2 years ago
- BLS working standard draft☆40Updated 6 years ago
- Code for zero-knowledge middleboxes☆63Updated 3 years ago
- ☆35Updated last year
- Generator and supporting evidence for security of the Pallas/Vesta pair of elliptic curves suitable for Halo☆59Updated 2 years ago
- Notes for the R1CS programming workshop at ZK0x04☆31Updated 6 years ago
- Efficient Anonymous Tokens with Private Metadata Bit☆15Updated 2 years ago
- A Rust library for building R1CS gadgets☆91Updated 4 years ago
- Fast and simple constant-time hashing to the BLS12-381 elliptic curve☆45Updated 5 years ago
- Efficient zero-knowledge arguments in the discrete log setting, revisited☆16Updated 5 years ago
- FastPay: High-Performance Byzantine Fault Tolerant Settlement☆85Updated 3 years ago
- Describe elliptic curves☆35Updated 4 years ago
- Linearly Homomorphic Time Lock Puzzle Library☆30Updated 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 5 years ago
- A golang demo for zk-SNARK aggregation☆41Updated 6 years ago
- Pointcheval Sanders signature☆27Updated 5 years ago
- Prover for the Plumo light client system https://docs.zkproof.org/pages/standards/accepted-workshop3/proposal-plumo_celolightclient.pdf☆14Updated 4 years ago