Linear-time accumulation schemes

DOI10.1007/978-3-032-12287-2_13MaRDI QIDQ7233182zbMATH OpenFDO

Authors Benedikt Bünz, Alessandro Chiesa, Giacomo Fenzi, William Wang

Publication date 24 April 2026

Full work available at URL https://doi.org/10.1007/978-3-032-12287-2_13

zbMATH Keywords

accumulation schemesinteractive oracle reductionslinear codes

Mathematics Subject Classification ID

Cryptography (94A60) Linear codes (general theory) (94B05)

Cites work

• \textsc{Arc}: accumulation for Reed-Solomon codes
• \textsf{LatticeFold+}: faster, simpler, shorter lattice-based folding for succinct proof systems
• BaseFold: efficient field-agnostic polynomial commitment schemes from foldable codes
• Blaze: fast SNARKs from interleaved RAA codes
• Breaking the \(O(\sqrt{n})\)-bit barrier: Byzantine agreement with polylog bits per party
• Cluster computing in zero knowledge
• Constant-round interactive proofs for delegating computation
• Constant-Size Commitments to Polynomials and Their Applications
• Fast Reed-Solomon interactive oracle proofs of proximity
• scientific article; zbMATH DE number 176545 (Why is no real title available?)
• scientific article; zbMATH DE number 7650353 (Why is no real title available?)
• Incrementally Verifiable Computation or Proofs of Knowledge Imply Time/Space Efficiency
• Interactive oracle proofs
• Linear-size constant-query IOPs for delegating computation
• Linear-time arguments with sublinear verification from tensor codes
• Linear-time encodable and decodable error-correcting codes
• Linear-time encodable codes meeting the gilbert-varshamov bound and their cryptographic applications
• Linear-Time Encodable/Decodable Codes With Near-Optimal Rate
• Linear-time zero-knowledge proofs for arithmetic circuit satisfiability
• Low-complexity cryptographic hash functions
• On the Evaluation of Powers and Monomials
• Proof-carrying data without succinct arguments
• Protostar: generic efficient accumulation/folding for special-sound protocols
• Proximity gaps for Reed-Solomon codes
• Recursive composition and bootstrapping for SNARKs and proof-carrying data
• Recursive proof composition from accumulation schemes
• Scalable zero knowledge via cycles of elliptic curves
• Snarks for C: verifying program executions succinctly and in zero knowledge
• STIR: Reed-Solomon proximity testing with fewer queries
• Succinct arguments in the quantum random oracle model
• WHIR: Reed-Solomon proximity testing with super-fast verification
• Zero-knowledge IOPs with linear-time prover and polylogarithmic-time verifier

Cited in

(1)

• How to prove post-quantum security for succinct non-interactive reductions

This page was built for publication: Linear-time accumulation schemes

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