Flashproofs: efficient zero-knowledge arguments of range and polynomial evaluation with transparent setup
From MaRDI portal
Publication:6132411
Recommendations
- Efficient batch zero-knowledge arguments for low degree polynomials
- Efficient lattice-based polynomial evaluation and batch ZK arguments
- Efficient range proofs with transparent setup from bounded integer commitments
- Efficient zero-knowledge arguments from two-tiered homomorphic commitments
- Efficient zero-knowledge arguments for arithmetic circuits in the discrete log setting
Cites work
- scientific article; zbMATH DE number 1303126 (Why is no real title available?)
- Advances in Cryptology - ASIACRYPT 2003
- Aurora: transparent succinct arguments for R1CS
- Efficient Protocols for Set Membership and Range Proofs
- Efficient batch zero-knowledge arguments for low degree polynomials
- Efficient range proofs with transparent setup from bounded integer commitments
- Efficient zero-knowledge arguments for arithmetic circuits in the discrete log setting
- How To Prove Yourself: Practical Solutions to Identification and Signature Problems
- Non-interactive Zero-Knowledge Arguments for Voting
- On the size of pairing-based non-interactive arguments
- One-out-of-many proofs: or how to leak a secret and spend a coin
- Scalable zero knowledge via cycles of elliptic curves
- Scalable zero knowledge with no trusted setup
- Spartan: efficient and general-purpose zkSNARKs without trusted setup
- Transparent SNARKs from DARK compilers
- Zero-knowledge argument for polynomial evaluation with application to blacklists
- Zero-knowledge proofs for set membership: efficient, succinct, modular
- \textsc{Fractal}: post-quantum and transparent recursive proofs from holography
Cited in
(6)- Efficient lattice-based polynomial evaluation and batch ZK arguments
- Zero-knowledge argument for polynomial evaluation with application to blacklists
- Efficient range proofs with transparent setup from bounded integer commitments
- Bulletproofs++: next generation confidential transactions via reciprocal set membership arguments
- Efficient batch zero-knowledge arguments for low degree polynomials
- Dory: efficient, transparent arguments for generalised inner products and polynomial commitments
This page was built for publication: Flashproofs: efficient zero-knowledge arguments of range and polynomial evaluation with transparent setup
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6132411)
