aragonzkresearch / ark-ec-blind-signaturesLinks
Blind signatures over elliptic curve implementation (native & r1cs constraints).
☆13Updated 2 years ago
Alternatives and similar repositories for ark-ec-blind-signatures
Users that are interested in ark-ec-blind-signatures are comparing it to the libraries listed below
Sorting:
- ☆11Updated 4 years ago
- ☆13Updated last year
- ☆11Updated last year
- A list of worth-reading articles about Cryptohraphy☆16Updated 10 months ago
- Proof of concept implementation of Sigmabus https://eprint.iacr.org/2023/1406☆10Updated last year
- ☆14Updated last year
- MiMC implementation in Halo2☆9Updated 2 years ago
- Implementation of https://eprint.iacr.org/2022/1565.pdf on top of arkworks☆16Updated 2 years ago
- An implementation of Sangria☆17Updated 2 years ago
- ☆10Updated 3 years ago
- Prove multi-opens of EIP-4844 KZG blobs☆14Updated 2 years ago
- ☆18Updated 2 years ago
- snarkpack for arkwork☆21Updated 2 years ago
- ☆12Updated last year
- Base64 decoding circuit in halo2☆14Updated last year
- An arkworks implementation of the superspartan PIOP☆13Updated 9 months ago
- Batching zero over k checks☆11Updated 2 years ago
- A rusty implementation of the Caulk+ lookup algorithm.☆12Updated 2 years ago
- Polyexen demo of Plonkish Arithmetiation Format (Plaf) on the zkevm-circuits☆31Updated last year
- Simple trait that enables using FPGA VariableBaseMsm developed by ingonyama☆10Updated 2 years ago
- Starky implementation of Bls12-381☆13Updated last year
- SIPP(Statistically sound Inner Pairing Product) verification in SNARK☆17Updated last year
- https://eprint.iacr.org/2020/1516.pdf☆19Updated 2 years ago
- Draft documents for standardization of Plonkish arithmetization☆23Updated last year
- Groth16 zkSNARK bellman proof verifier using cloudflare/bn256 Pairing☆13Updated 5 years ago
- [wip] implementing origami VDF☆13Updated 2 years ago
- ☆18Updated 5 years ago
- RISC Zero Nova is inherit from Risc Zero but aim to replace STARK with Nova folding scheme☆28Updated last year
- plonky2 implementation of bn254 pairing☆18Updated last year
- 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