Counting vampires: from univariate sumcheck to updatable ZK-SNARK
From MaRDI portal
Publication:6132412
DOI10.1007/978-3-031-22966-4_9zbMATH Open1519.94159OpenAlexW4320154909MaRDI QIDQ6132412FDOQ6132412
Authors: Helger Lipmaa, Janno Siim, Michal Zajac 
Publication date: 16 August 2023
Published in: Advances in Cryptology – ASIACRYPT 2022 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-031-22966-4_9
Recommendations
- An algebraic framework for universal and updatable SNARKs
- \(\mathcal{Lunar}\): a toolbox for more efficient universal and updatable zkSNARKs and commit-and-prove extensions
- Aurora: transparent succinct arguments for R1CS
- Updatable and universal common reference strings with applications to zk-SNARKs
- Subvector commitments with application to succinct arguments
Cites Work
- Algebraic methods for interactive proof systems
- Short pairing-based non-interactive zero-knowledge arguments
- Progression-free sets and sublinear pairing-based non-interactive zero-knowledge arguments
- Succinct non-interactive arguments via linear interactive proofs
- Quadratic span programs and succinct NIZKs without PCPs
- Efficient zero-knowledge arguments for arithmetic circuits in the discrete log setting
- Concise mercurial vector commitments and independent zero-knowledge sets with short proofs
- Updatable and universal common reference strings with applications to zk-SNARKs
- The algebraic group model and its applications
- Aurora: transparent succinct arguments for R1CS
- NIZKs with an untrusted CRS: security in the face of parameter subversion
- Marlin: preprocessing zkSNARKs with universal and updatable SRS
- On the size of pairing-based non-interactive arguments
- A subversion-resistant SNARK
- Constant-Size Commitments to Polynomials and Their Applications
- Subversion-zero-knowledge SNARKs
- On subversion-resistant SNARKs
- A classification of computational assumptions in the algebraic group model
- An algebraic framework for universal and updatable SNARKs
- Block-wise P-signatures and non-interactive anonymous credentials with efficient attributes
- \(\mathcal{Lunar}\): a toolbox for more efficient universal and updatable zkSNARKs and commit-and-prove extensions
- Counting vampires: from univariate sumcheck to updatable ZK-SNARK
Cited In (9)
- On black-box knowledge-sound commit-and-prove SNARKs
- An algebraic framework for universal and updatable SNARKs
- CRS-updatable asymmetric quasi-adaptive NIZK arguments
- Benchmarking the setup of updatable zk-SNARKs
- Lookup arguments: improvements, extensions and applications to zero-knowledge decision trees
- Succinct verification of compressed sigma protocols in the updatable SRS setting
- Constant-size zk-SNARKs in ROM from falsifiable assumptions
- Polymath: Groth16 is not the limit
- Counting vampires: from univariate sumcheck to updatable ZK-SNARK
This page was built for publication: Counting vampires: from univariate sumcheck to updatable ZK-SNARK
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6132412)
