An algebraic framework for universal and updatable SNARKs
From MaRDI portal
Publication:2120103
DOI10.1007/978-3-030-84242-0_27zbMath1485.94116OpenAlexW3173910356MaRDI QIDQ2120103
Publication date: 31 March 2022
Full work available at URL: https://doi.org/10.1007/978-3-030-84242-0_27
Related Items
\textsf{Dew}: a transparent constant-sized polynomial commitment scheme, 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, Updatable NIZKs from non-interactive zaps, CRS-updatable asymmetric quasi-adaptive NIZK arguments, Linear-map vector commitments and their practical applications, An analysis of the algebraic group model, Impossibilities in succinct arguments: black-box extraction and more, Algebraic reductions of knowledge
Uses Software
Cites Work
- On the round complexity of OT extension
- Updatable and universal common reference strings with applications to zk-SNARKs
- A subversion-resistant SNARK
- Subversion-zero-knowledge SNARKs
- The algebraic group model and its applications
- Transparent SNARKs from DARK compilers
- Marlin: preprocessing zkSNARKs with universal and updatable SRS
- \textsc{Fractal}: post-quantum and transparent recursive proofs from holography
- Spartan: efficient and general-purpose zkSNARKs without trusted setup
- Aurora: transparent succinct arguments for R1CS
- Scalable zero knowledge with no trusted setup
- Libra: succinct zero-knowledge proofs with optimal prover computation
- Shorter Quasi-Adaptive NIZK Proofs for Linear Subspaces
- The Kernel Matrix Diffie-Hellman Assumption
- Constant-Size Commitments to Polynomials and Their Applications
- Short Pairing-Based Non-interactive Zero-Knowledge Arguments
- Interactive Oracle Proofs
- Linear Algebra with Sub-linear Zero-Knowledge Arguments
- The Knowledge Complexity of Interactive Proof Systems
- Computationally Sound Proofs
- Signatures of Correct Computation
- Quadratic Span Programs and Succinct NIZKs without PCPs
- Updateable Inner Product Argument with Logarithmic Verifier and Applications
- On the Size of Pairing-Based Non-interactive Arguments
- Efficient Zero-Knowledge Arguments for Arithmetic Circuits in the Discrete Log Setting
