Counting vampires: from univariate sumcheck to updatable ZK-SNARK

DOI10.1007/978-3-031-22966-4_9MaRDI QIDQ6132412zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

aggregatable polynomial commitmentinner-product commitmentsumcheckupdatable and universal zk-SNARK

Mathematics Subject Classification ID

Communication theory (94A05) Cryptography (94A60)

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

• \(\mathcal{Lunar}\): a toolbox for more efficient universal and updatable zkSNARKs and commit-and-prove extensions
• A classification of computational assumptions in the algebraic group model
• A subversion-resistant SNARK
• Algebraic methods for interactive proof systems
• An algebraic framework for universal and updatable SNARKs
• Aurora: transparent succinct arguments for R1CS
• Block-wise P-signatures and non-interactive anonymous credentials with efficient attributes
• Concise mercurial vector commitments and independent zero-knowledge sets with short proofs
• Constant-Size Commitments to Polynomials and Their Applications
• Counting vampires: from univariate sumcheck to updatable ZK-SNARK
• Efficient zero-knowledge arguments for arithmetic circuits in the discrete log setting
• Marlin: preprocessing zkSNARKs with universal and updatable SRS
• NIZKs with an untrusted CRS: security in the face of parameter subversion
• On subversion-resistant SNARKs
• 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
• Short pairing-based non-interactive zero-knowledge arguments
• Subversion-zero-knowledge SNARKs
• Succinct non-interactive arguments via linear interactive proofs
• The algebraic group model and its applications
• Updatable and universal common reference strings with applications to zk-SNARKs

Cited in

(11)

• An algebraic framework for universal and updatable SNARKs
• Counting vampires: from univariate sumcheck to updatable ZK-SNARK
• CRS-updatable asymmetric quasi-adaptive NIZK arguments
• On black-box knowledge-sound commit-and-prove SNARKs
• Benchmarking the setup of updatable zk-SNARKs
• Succinct verification of compressed sigma protocols in the updatable SRS setting
• Lookup arguments: improvements, extensions and applications to zero-knowledge decision trees
• Constant-size zk-SNARKs in ROM from falsifiable assumptions
• Polymath: Groth16 is not the limit
• On knowledge-soundness of Plonk in ROM from falsifiable assumptions
• On security proofs of existing equivalence class signature schemes

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)