Split prover zero-knowledge SNARKs

DOI10.1007/978-3-031-91820-9_12MaRDI QIDQ6951597zbMATH OpenFDO

Authors Sanjam Garg, Aarushi Goel, Dimitris Kolonelos, Sina Shiehian, Rohit Sinha

Publication date 29 July 2025

Full work available at URL https://doi.org/10.1007/978-3-031-91820-9_12

zbMATH Keywords

Groth16 zkSNARKs

Mathematics Subject Classification ID

Cryptography (94A60)

Cites work

• Arya: nearly linear-time zero-knowledge proofs for correct program execution
• Cryptography and Coding
• Dory: efficient, transparent arguments for generalised inner products and polynomial commitments
• How To Prove Yourself: Practical Solutions to Identification and Signature Problems
• Incrementally Verifiable Computation or Proofs of Knowledge Imply Time/Space Efficiency
• Libra: succinct zero-knowledge proofs with optimal prover computation
• Linear-time arguments with sublinear verification from tensor codes
• Linear-time zero-knowledge proofs for arithmetic circuit satisfiability
• Marlin: preprocessing zkSNARKs with universal and updatable SRS
• Nova: recursive zero-knowledge arguments from folding schemes
• On the size of pairing-based non-interactive arguments
• Quadratic span programs and succinct NIZKs without PCPs
• Recursive composition and bootstrapping for SNARKs and proof-carrying data
• Scalable zero knowledge via cycles of elliptic curves
• Spartan: efficient and general-purpose zkSNARKs without trusted setup
• The algebraic group model and its applications
• The hunting of the SNARK
• Zero-knowledge IOPs with linear-time prover and polylogarithmic-time verifier
• \textsc{Fractal}: post-quantum and transparent recursive proofs from holography

This page was built for publication: Split prover zero-knowledge SNARKs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6951597)