Polymath: Groth16 is not the limit
From MaRDI portal
Publication:6660297
DOI10.1007/978-3-031-68403-6_6MaRDI QIDQ6660297
Publication date: 10 January 2025
Could not fetch data.
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Updatable and universal common reference strings with applications to zk-SNARKs
- Snarky signatures: minimal signatures of knowledge from simulation-extractable snarks
- A subversion-resistant SNARK
- Subversion-zero-knowledge SNARKs
- The algebraic group model and its applications
- On subversion-resistant SNARKs
- Transparent SNARKs from DARK compilers
- Marlin: preprocessing zkSNARKs with universal and updatable SRS
- Recursive proof composition from accumulation schemes
- An algebraic framework for universal and updatable SNARKs
- LOVE a pairing
- Dory: efficient, transparent arguments for generalised inner products and polynomial commitments
- Extended Tower Number Field Sieve: A New Complexity for the Medium Prime Case
- Scalable Zero Knowledge via Cycles of Elliptic Curves
- Progression-Free Sets and Sublinear Pairing-Based Non-Interactive Zero-Knowledge Arguments
- NIZKs with an Untrusted CRS: Security in the Face of Parameter Subversion
- Constant-Size Commitments to Polynomials and Their Applications
- Short Pairing-Based Non-interactive Zero-Knowledge Arguments
- The Semi-Generic Group Model and Applications to Pairing-Based Cryptography
- Succinct NP Proofs from an Extractability Assumption
- Escrowed Deniable Identification Schemes
- Fixed Argument Pairings
- Signatures of Correct Computation
- Quadratic Span Programs and Succinct NIZKs without PCPs
- A Unified Framework for Non-universal SNARKs
- On the Size of Pairing-Based Non-interactive Arguments
- SnarkPack: practical SNARK aggregation
- Spartan and bulletproofs are simulation-extractable (for free!)
- 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
- Fiat-Shamir transformation of multi-round interactive proofs
- Algebraic group model with oblivious sampling
- \textsf{Testudo}: linear time prover SNARKs with constant size proofs and square root size universal setup
- Constant-size zk-SNARKs in ROM from falsifiable assumptions
- Polymath: Groth16 is not the limit
Related Items (1)
This page was built for publication: Polymath: Groth16 is not the limit
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6660297)
