\(\mathcal{Lunar}\): a toolbox for more efficient universal and updatable zkSNARKs and commit-and-prove extensions
From MaRDI portal
Publication:6157543
DOI10.1007/978-3-030-92078-4_1zbMath1514.94055OpenAlexW3091322675MaRDI QIDQ6157543
Matteo Campanelli, Antonio Faonio, Anaïs Querol, Dario Fiore, Hadrián Rodríguez
Publication date: 12 May 2023
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-030-92078-4_1
Related Items (8)
Witness-succinct universally-composable SNARKs ⋮ HyperPlonk: Plonk with linear-time prover and high-degree custom gates ⋮ \textsf{Dew}: a transparent constant-sized polynomial commitment scheme ⋮ Counting vampires: from univariate sumcheck to updatable ZK-SNARK ⋮ Updatable NIZKs from non-interactive zaps ⋮ CRS-updatable asymmetric quasi-adaptive NIZK arguments ⋮ Impossibilities in succinct arguments: black-box extraction and more ⋮ Algebraic reductions of knowledge
Cites Work
- Unnamed Item
- Updatable and universal common reference strings with applications to zk-SNARKs
- Definitions and properties of zero-knowledge proof systems
- 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
- An algebraic framework for universal and updatable SNARKs
- Zero-knowledge proofs for set membership: efficient, succinct, modular
- Linear-size constant-query IOPs for delegating computation
- Subversion-resistant simulation (knowledge) sound NIZKs
- Aurora: transparent succinct arguments for R1CS
- Scalable zero knowledge with no trusted setup
- Libra: succinct zero-knowledge proofs with optimal prover computation
- From extractable collision resistance to succinct non-interactive arguments of knowledge, and back again
- An Algebraic Framework for Diffie-Hellman Assumptions
- Progression-Free Sets and Sublinear Pairing-Based Non-Interactive Zero-Knowledge Arguments
- Constant-Size Commitments to Polynomials and Their Applications
- Short Pairing-Based Non-interactive Zero-Knowledge Arguments
- Interactive Oracle Proofs
- The Knowledge Complexity of Interactive Proof Systems
- Computationally Sound Proofs
- Barycentric Lagrange Interpolation
- Succinct Non-interactive Arguments via Linear Interactive Proofs
- Quadratic Span Programs and Succinct NIZKs without PCPs
- Updateable Inner Product Argument with Logarithmic Verifier and Applications
- Computational Integrity with a Public Random String from Quasi-Linear PCPs
- Constant-round interactive proofs for delegating computation
- Fine-Tuning Groth-Sahai Proofs
- Separating succinct non-interactive arguments from all falsifiable assumptions
- On the Size of Pairing-Based Non-interactive Arguments
- Efficient Zero-Knowledge Arguments for Arithmetic Circuits in the Discrete Log Setting
This page was built for publication: \(\mathcal{Lunar}\): a toolbox for more efficient universal and updatable zkSNARKs and commit-and-prove extensions
