Polymath: Groth16 is not the limit
From MaRDI portal
Recommendations
Cites work
- \(\mathcal{Lunar}\): a toolbox for more efficient universal and updatable zkSNARKs and commit-and-prove extensions
- \textsf{Testudo}: linear time prover SNARKs with constant size proofs and square root size universal setup
- A subversion-resistant SNARK
- A unified framework for non-universal SNARKs
- Algebraic group model with oblivious sampling
- An algebraic framework for universal and updatable SNARKs
- Constant-Size Commitments to Polynomials and Their Applications
- Constant-size zk-SNARKs in ROM from falsifiable assumptions
- Counting vampires: from univariate sumcheck to updatable ZK-SNARK
- Dory: efficient, transparent arguments for generalised inner products and polynomial commitments
- Escrowed deniable identification schemes
- Extended tower number field sieve: a new complexity for the medium prime case
- Fiat-Shamir transformation of multi-round interactive proofs
- Fixed argument pairings
- scientific article; zbMATH DE number 1302784 (Why is no real title available?)
- scientific article; zbMATH DE number 1024065 (Why is no real title available?)
- scientific article; zbMATH DE number 1952905 (Why is no real title available?)
- LOVE a pairing
- 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
- Polymath: Groth16 is not the limit
- Progression-free sets and sublinear pairing-based non-interactive zero-knowledge arguments
- Proofs for inner pairing products and applications
- Quadratic span programs and succinct NIZKs without PCPs
- Recursive proof composition from accumulation schemes
- Scalable zero knowledge via cycles of elliptic curves
- Short pairing-based non-interactive zero-knowledge arguments
- Signatures of correct computation
- SnarkPack: practical SNARK aggregation
- Snarky signatures: minimal signatures of knowledge from simulation-extractable snarks
- Spartan and bulletproofs are simulation-extractable (for free!)
- Subversion-zero-knowledge SNARKs
- Succinct NP Proofs from an Extractability Assumption
- The algebraic group model and its applications
- The Semi-Generic Group Model and Applications to Pairing-Based Cryptography
- Transparent SNARKs from DARK compilers
- Updatable and universal common reference strings with applications to zk-SNARKs
Cited in
(6)- Polymath: Groth16 is not the limit
- On knowledge-soundness of Plonk in ROM from falsifiable assumptions
- Designated-verifier SNARGs with one group element
- RoK and Roll -- verifier-efficient random projection for \(\tilde{O}(\lambda )\)-size lattice arguments (extended abstract)
- A short-list of pairing-friendly curves resistant to the special TNFS algorithm at the 192-bit security level
- Improved constant-sized polynomial commitment schemes without trusted setup
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)
