A divide-and-conquer sumcheck protocol

DOI10.62056/ABKSDK5VTMaRDI QIDQ7326604zbMATH OpenFDO

Authors Christophe Levrat, Tanguy Medevielle, Jade Nardi

Publication date 9 September 2026

Published in IACR Communications in Cryptology (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.62056/ABKSDK5VT

Mathematics Subject Classification ID

Cryptography (94A60)

Cites work

• \textsc{Zeromorph}: zero-knowledge multilinear-evaluation proofs from homomorphic univariate commitments
• A probabilistic remark on algebraic program testing
• Algebraic methods for interactive proof systems
• Aurora: transparent succinct arguments for R1CS
• BaseFold: efficient field-agnostic polynomial commitment schemes from foldable codes
• Brakedown: linear-time and field-agnostic SNARKs for R1CS
• Constant-Size Commitments to Polynomials and Their Applications
• Delegating computation: interactive proofs for muggles
• Dory: efficient, transparent arguments for generalised inner products and polynomial commitments
• Fast Probabilistic Algorithms for Verification of Polynomial Identities
• Fast Reed-Solomon interactive oracle proofs of proximity
• Fiat-Shamir transformation of multi-round interactive proofs (Extended version)
• scientific article; zbMATH DE number 3651744 (Why is no real title available?)
• Interactive oracle proofs
• IOPs with inverse polynomial soundness error
• Scalable zero knowledge with no trusted setup
• Spartan: efficient and general-purpose zkSNARKs without trusted setup
• Sumcheck arguments and their applications
• The Knowledge Complexity of Interactive Proof Systems
• The theory of hash functions and random oracles. An approach to modern cryptography
• Transparent SNARKs from DARK compilers

This page was built for publication: A divide-and-conquer sumcheck protocol

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