Improved constant-sized polynomial commitment schemes without trusted setup
From MaRDI portal
Cites work
- \textsf{Dew}: a transparent constant-sized polynomial commitment scheme
- Aurora: transparent succinct arguments for R1CS
- Automata, Languages and Programming
- Batching techniques for accumulators with applications to IOPs and stateless blockchains
- Constant-Size Commitments to Polynomials and Their Applications
- Dirichlet’s proof of the three-square theorem: An algorithmic perspective
- Dory: efficient, transparent arguments for generalised inner products and polynomial commitments
- Efficient proofs that a committed number lies in an interval
- Efficient verifiable delay functions
- Efficient zero-knowledge arguments for arithmetic circuits in the discrete log setting
- Fast Reed-Solomon interactive oracle proofs of proximity
- How To Prove Yourself: Practical Solutions to Identification and Signature Problems
- scientific article; zbMATH DE number 1722673 (Why is no real title available?)
- scientific article; zbMATH DE number 1256636 (Why is no real title available?)
- scientific article; zbMATH DE number 2086711 (Why is no real title available?)
- Inner product functional commitments with constant-size public parameters and openings
- Non-interactive Zero-Knowledge Arguments for Voting
- On interactive proofs with a laconic prover
- On the Evaluation of Powers and Monomials
- On the size of pairing-based non-interactive arguments
- Polymath: Groth16 is not the limit
- The knowledge complexity of interactive proof-systems
- Time- and space-efficient arguments from groups of unknown order
- Transparent SNARKs from DARK compilers
- Trustless unknown-order groups
This page was built for publication: Improved constant-sized polynomial commitment schemes without trusted setup
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7346693)
