Sum-check protocol for approximate computations

DOI10.1007/978-3-032-25336-1_8MaRDI QIDQ7305293zbMATH OpenFDO

Authors Zachary DeStefano, Shafi Goldwasser, Yuval Ishai, Yael Tauman Kalai, Justin Thaler

Publication date 29 July 2026

Full work available at URL https://doi.org/10.1007/978-3-032-25336-1_8

Mathematics Subject Classification ID

Cryptography (94A60)

Cites work

• A dimension-free discrete Remez-type inequality on the polytorus
• Adaptive precision floating-point arithmetic and fast robust geometric predicates
• Algebraic methods for interactive proof systems
• Approximate testing with error relative to input size.
• Approximate testing with relative error
• Checking approximate computations over the reals
• Constant-round interactive proofs for delegating computation
• Doubly efficient interactive proofs over infinite and non-commutative rings
• Fast Probabilistic Algorithms for Verification of Polynomial Identities
• Fiat-Shamir: from practice to theory
• How To Prove Yourself: Practical Solutions to Identification and Signature Problems
• scientific article; zbMATH DE number 5485522 (Why is no real title available?)
• scientific article; zbMATH DE number 3651744 (Why is no real title available?)
• scientific article; zbMATH DE number 1256635 (Why is no real title available?)
• scientific article; zbMATH DE number 1256636 (Why is no real title available?)
• scientific article; zbMATH DE number 1500524 (Why is no real title available?)
• scientific article; zbMATH DE number 2086425 (Why is no real title available?)
• scientific article; zbMATH DE number 826245 (Why is no real title available?)
• scientific article; zbMATH DE number 5485587 (Why is no real title available?)
• Interactive oracle proofs
• IP = PSPACE
• IP = PSPACE using error-correcting codes
• Local proofs approaching the witness length
• Low degree testing over the reals
• On soundness notions for interactive oracle proofs
• Polynomial inequalities on measurable sets and their applications
• Proving as fast as computing: succinct arguments with constant prover overhead
• Remez-type inequalities and their applications
• Sharp Remez inequality
• Spartan: efficient and general-purpose zkSNARKs without trusted setup
• Sumcheck arguments and their applications
• Sur une propriété extrémale des polynomes de Tchébychef.
• Zero knowledge proofs towards verifiable decentralized AI pipelines
• Zero-knowledge proofs on secret-shared data via fully linear PCPs

This page was built for publication: Sum-check protocol for approximate computations

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