Lookup arguments: improvements, extensions and applications to zero-knowledge decision trees
From MaRDI portal
Publication:6635776
DOI10.1007/978-3-031-57722-2_11MaRDI QIDQ6635776
Matteo Campanelli, Helger Lipmaa, Antonio Faonio, Tianyu Li, Dario Fiore
Publication date: 12 November 2024
Cites Work
- Updatable and universal common reference strings with applications to zk-SNARKs
- Arya: nearly linear-time zero-knowledge proofs for correct program execution
- The algebraic group model and its applications
- Marlin: preprocessing zkSNARKs with universal and updatable SRS
- Spartan: efficient and general-purpose zkSNARKs without trusted setup
- An algebraic framework for universal and updatable SNARKs
- Fiat-Shamir bulletproofs are non-malleable (in the algebraic group model)
- Aurora: transparent succinct arguments for R1CS
- SNARKs for C: Verifying Program Executions Succinctly and in Zero Knowledge
- On the Non-malleability of the Fiat-Shamir Transform
- Progression-Free Sets and Sublinear Pairing-Based Non-Interactive Zero-Knowledge Arguments
- Constant-Size Commitments to Polynomials and Their Applications
- ECLIPSE: Enhanced Compiling Method for Pedersen-Committed zkSNARK Engines
- On the Size of Pairing-Based Non-interactive Arguments
- HyperPlonk: Plonk with linear-time prover and high-degree custom gates
- Counting vampires: from univariate sumcheck to updatable ZK-SNARK
- \(\mathcal{Lunar}\): a toolbox for more efficient universal and updatable zkSNARKs and commit-and-prove extensions
- Algebraic group model with oblivious sampling
Related Items (1)
This page was built for publication: Lookup arguments: improvements, extensions and applications to zero-knowledge decision trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6635776)
