Samaritan: linear-time prover SNARK from new multilinear polynomial commitments

DOI10.1007/978-981-95-5116-3_15MaRDI QIDQ7232568zbMATH OpenFDO

Authors Chaya Ganesh, Sikhar Patranabis, Nitin Singh

Publication date 23 April 2026

Full work available at URL https://doi.org/10.1007/978-981-95-5116-3_15

zbMATH Keywords

multilinear polynomial commitment scheme

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Cryptography (94A60)

Cites work

• \textsc{Zeromorph}: zero-knowledge multilinear-evaluation proofs from homomorphic univariate commitments
• \textsf{Testudo}: linear time prover SNARKs with constant size proofs and square root size universal setup
• Blaze: fast SNARKs from interleaved RAA codes
• Brakedown: linear-time and field-agnostic SNARKs for R1CS
• Constant-Size Commitments to Polynomials and Their Applications
• Dory: efficient, transparent arguments for generalised inner products and polynomial commitments
• From extractable collision resistance to succinct non-interactive arguments of knowledge, and back again
• Gemini: elastic SNARKs for diverse environments
• Greyhound: fast polynomial commitments from lattices
• How To Prove Yourself: Practical Solutions to Identification and Signature Problems
• HyperPlonk: Plonk with linear-time prover and high-degree custom gates
• Libra: succinct zero-knowledge proofs with optimal prover computation
• Marlin: preprocessing zkSNARKs with universal and updatable SRS
• On the size of pairing-based non-interactive arguments
• Orion: zero knowledge proof with linear prover time
• Polynomial commitments from lattices: post-quantum security, fast verification and transparent setup
• Progression-free sets and sublinear pairing-based non-interactive zero-knowledge arguments
• Quadratic span programs and succinct NIZKs without PCPs
• Short pairing-based non-interactive zero-knowledge arguments
• Short PCPs with Polylog Query Complexity
• Signatures of correct computation
• Snarks for C: verifying program executions succinctly and in zero knowledge
• Spartan: efficient and general-purpose zkSNARKs without trusted setup
• Succinct non-interactive arguments via linear interactive proofs
• Succinct non-interactive zero knowledge arguments from span programs and linear error-correcting codes
• The algebraic group model and its applications
• Transparent SNARKs from DARK compilers

Cited in

(1)

• Soloist: distributed snark for R1CS with constant proof size

This page was built for publication: Samaritan: linear-time prover SNARK from new multilinear polynomial commitments

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