Constant-size zk-SNARKs in ROM from falsifiable assumptions
From MaRDI portal
Publication:6637561
DOI10.1007/978-3-031-58751-1_2MaRDI QIDQ6637561
Helger Lipmaa, Janno Siim, Roberto Parisella
Publication date: 13 November 2024
zk-SNARKspolynomial IOPpolynomial commitment schemeblack-box knowledge-soundnesswitness-extended emulation
Cryptography (94A60) Theory of compilers and interpreters (68N20) Data encryption (aspects in computer science) (68P25)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Updatable and universal common reference strings with applications to zk-SNARKs
- The algebraic group model and its applications
- Transparent SNARKs from DARK compilers
- Marlin: preprocessing zkSNARKs with universal and updatable SRS
- Aggregatable subvector commitments for stateless cryptocurrencies
- An algebraic framework for universal and updatable SNARKs
- A compressed \(\varSigma \)-protocol theory for lattices
- Shorter pairing-based arguments under standard assumptions
- Subvector commitments with application to succinct arguments
- Short signatures without random oracles and the SDH assumption in bilinear groups
- Dory: efficient, transparent arguments for generalised inner products and polynomial commitments
- Progression-Free Sets and Sublinear Pairing-Based Non-Interactive Zero-Knowledge Arguments
- Constant-Size Commitments to Polynomials and Their Applications
- How To Prove Yourself: Practical Solutions to Identification and Signature Problems
- Signatures of Correct Computation
- How Not to Prove Yourself: Pitfalls of the Fiat-Shamir Heuristic and Applications to Helios
- Quadratic Span Programs and Succinct NIZKs without PCPs
- Fast Reed-Solomon Interactive Oracle Proofs of Proximity
- On the existence of extractable one-way functions
- Separating succinct non-interactive arguments from all falsifiable assumptions
- Advances in Cryptology - CRYPTO 2003
- On the concrete efficiency of probabilistically-checkable proofs
- On the Size of Pairing-Based Non-interactive Arguments
- 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
- Proofs for inner pairing products and applications
- To label, or not to label (in generic groups)
- An analysis of the algebraic group model
- Impossibilities in succinct arguments: black-box extraction and more
- Algebraic group model with oblivious sampling
- The relationship between idealized models under computationally bounded adversaries
- Constant-size zk-SNARKs in ROM from falsifiable assumptions
Related Items (2)
This page was built for publication: Constant-size zk-SNARKs in ROM from falsifiable assumptions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6637561)
