Lunar: a toolbox for more efficient universal and updatable zkSNARKs and commit-and-prove extensions

Recommendations

\textsf{ECLIPSE}: enhanced compiling method for Pedersen-committed zkSNARK engines
Prover-efficient commit-and-prove zero-knowledge SNARKs
Updatable and universal common reference strings with applications to zk-SNARKs
Prover-efficient commit-and-prove zero-knowledge snarks
Spartan: efficient and general-purpose zkSNARKs without trusted setup

Cites work

\textsc{Fractal}: post-quantum and transparent recursive proofs from holography
A subversion-resistant SNARK
An algebraic framework for Diffie-Hellman assumptions
An algebraic framework for universal and updatable SNARKs
Aurora: transparent succinct arguments for R1CS
Barycentric Lagrange Interpolation
Computational integrity with a public random string from quasi-linear PCPs
Computationally Sound Proofs
Constant-round interactive proofs for delegating computation
Constant-Size Commitments to Polynomials and Their Applications
Definitions and properties of zero-knowledge proof systems
Efficient zero-knowledge arguments for arithmetic circuits in the discrete log setting
Fine-Tuning Groth-Sahai Proofs
From extractable collision resistance to succinct non-interactive arguments of knowledge, and back again
scientific article; zbMATH DE number 4161074 (Why is no real title available?)
Interactive oracle proofs
Libra: succinct zero-knowledge proofs with optimal prover computation
Linear-size constant-query IOPs for delegating computation
Marlin: preprocessing zkSNARKs with universal and updatable SRS
On the size of pairing-based non-interactive arguments
Progression-free sets and sublinear pairing-based non-interactive zero-knowledge arguments
Quadratic span programs and succinct NIZKs without PCPs
Scalable zero knowledge with no trusted setup
Separating succinct non-interactive arguments from all falsifiable assumptions
Short pairing-based non-interactive zero-knowledge arguments
Spartan: efficient and general-purpose zkSNARKs without trusted setup
Subversion-resistant simulation (knowledge) sound NIZKs
Subversion-zero-knowledge SNARKs
Succinct non-interactive arguments via linear interactive proofs
The algebraic group model and its applications
The Knowledge Complexity of Interactive Proof Systems
Transparent SNARKs from DARK compilers
Updatable and universal common reference strings with applications to zk-SNARKs
Updateable Inner Product Argument with Logarithmic Verifier and Applications
Zero-knowledge proofs for set membership: efficient, succinct, modular

Cited in

(34)

Prover-efficient commit-and-prove zero-knowledge snarks
Marlin: preprocessing zkSNARKs with universal and updatable SRS
An algebraic framework for universal and updatable SNARKs
Prover-efficient commit-and-prove zero-knowledge SNARKs
\textsf{ECLIPSE}: enhanced compiling method for Pedersen-committed zkSNARK engines
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
On black-box knowledge-sound commit-and-prove SNARKs
From polynomial IOP and commitments to non-malleable zkSNARKs
How to compile polynomial IOP into simulation-extractable SNARKs: a modular approach
Algebraic group model with oblivious sampling
\textsf{Testudo}: linear time prover SNARKs with constant size proofs and square root size universal setup
Benchmarking the setup of updatable zk-SNARKs
Lookup arguments: improvements, extensions and applications to zero-knowledge decision trees
Constant-size zk-SNARKs in ROM from falsifiable assumptions
An efficient ZK compiler from SIMD circuits to general circuits
Polymath: Groth16 is not the limit
Hybrid zero-knowledge from garbled circuits and circuit-based composition of -protocols
Lightweight transparent zero-knowledge proofs for cross-domain statements
On knowledge-soundness of Plonk in ROM from falsifiable assumptions
Universally composable SNARKs with transparent setup without programmable random oracle
SNARKs for virtual machines are non-malleable
Hybrid zero-knowledge from garbled circuits
Commit-and-prove system for vectors and applications to threshold signing
The brave new world of global generic groups and UC-secure zero-overhead SNARKs
On security proofs of existing equivalence class signature schemes
Natively compatible super-efficient lookup arguments and how to apply them
Updatable and universal common reference strings with applications to zk-SNARKs

This page was built for publication: \(\mathcal{Lunar}\): a toolbox for more efficient universal and updatable zkSNARKs and commit-and-prove extensions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6157543)