Flashproofs: efficient zero-knowledge arguments of range and polynomial evaluation with transparent setup
From MaRDI portal
Publication:6132411
DOI10.1007/978-3-031-22966-4_8zbMATH Open1519.94193OpenAlexW4320154901MaRDI QIDQ6132411FDOQ6132411
Authors: Nan Wang, Sid Chi-Kin Chau 
Publication date: 16 August 2023
Published in: Advances in Cryptology – ASIACRYPT 2022 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-031-22966-4_8
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
zero-knowledge argumentssmart contractsconfidential transactionspolynomial evaluation argumentsrange arguments
Cites Work
- How To Prove Yourself: Practical Solutions to Identification and Signature Problems
- Efficient Protocols for Set Membership and Range Proofs
- Title not available (Why is that?)
- Advances in Cryptology - ASIACRYPT 2003
- Non-interactive Zero-Knowledge Arguments for Voting
- Efficient batch zero-knowledge arguments for low degree polynomials
- Efficient zero-knowledge arguments for arithmetic circuits in the discrete log setting
- Aurora: transparent succinct arguments for R1CS
- Scalable zero knowledge with no trusted setup
- One-out-of-many proofs: or how to leak a secret and spend a coin
- Zero-knowledge argument for polynomial evaluation with application to blacklists
- Zero-knowledge proofs for set membership: efficient, succinct, modular
- On the size of pairing-based non-interactive arguments
- Scalable zero knowledge via cycles of elliptic curves
- Transparent SNARKs from DARK compilers
- \textsc{Fractal}: post-quantum and transparent recursive proofs from holography
- Efficient range proofs with transparent setup from bounded integer commitments
- Spartan: efficient and general-purpose zkSNARKs without trusted setup
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)
