GAPP: generic aggregation of polynomial IOPs
From MaRDI portal
Cites work
- Arya: nearly linear-time zero-knowledge proofs for correct program execution
- Compressed \(\varSigma\)-protocol theory and practical application to plug \& play secure algorithmics
- Constant-Size Commitments to Polynomials and Their Applications
- Dory: efficient, transparent arguments for generalised inner products and polynomial commitments
- Efficient zero-knowledge arguments for arithmetic circuits in the discrete log setting
- From extractable collision resistance to succinct non-interactive arguments of knowledge, and back again
- How To Prove Yourself: Practical Solutions to Identification and Signature Problems
- HyperNova: recursive arguments for customizable constraint systems
- Lookup arguments: improvements, extensions and applications to zero-knowledge decision trees
- Marlin: preprocessing zkSNARKs with universal and updatable SRS
- Minimum disclosure proofs of knowledge
- MuxProofs: succinct arguments for machine computation from vector lookups
- Nova: recursive zero-knowledge arguments from folding schemes
- Proofs for inner pairing products and applications
- Protostar: generic efficient accumulation/folding for special-sound protocols
- Quadratic span programs and succinct NIZKs without PCPs
- Samaritan: linear-time prover SNARK from new multilinear polynomial commitments
- Short pairing-based non-interactive zero-knowledge arguments
- SnarkPack: practical SNARK aggregation
- Snarks for C: verifying program executions succinctly and in zero knowledge
- Structure-preserving signatures and commitments to group elements
- Succinct non-interactive arguments via linear interactive proofs
- Transparent SNARKs from DARK compilers
This page was built for publication: GAPP: generic aggregation of polynomial IOPs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7443634)