Sumcheck arguments and their applications
From MaRDI portal
Recommendations
- Rational sumchecks
- AI 2005: Advances in Artificial Intelligence
- Implementation of a package of tools for manipulation of sums
- A computer checked algebraic verification of a distributed summation algorithm
- Some Methods for the Evaluation of a Sum
- scientific article; zbMATH DE number 2212148
- BOOLEAN METHODS AND PTÁK'S SUM
- The evaluation of an alternative sum with applications to the analysis of some data structures
- Sumterms, summands, sumtuples, and sums and the meta-arithmetic of summation
Cites work
- \(\mathrm{SPD}\mathbb {Z}_{2^k}\): efficient MPC \(\mod 2^k\) for dishonest majority
- \textsc{Fractal}: post-quantum and transparent recursive proofs from holography
- A non-PCP approach to succinct quantum-safe zero-knowledge
- Algebraic methods for interactive proof systems
- Are PCPs inherent in efficient arguments?
- Asymptotically good multiplicative LSSS over Galois rings and applications to MPC over \(\mathbb{Z}/p^k\mathbb{Z} \)
- Aurora: transparent succinct arguments for R1CS
- Barriers for succinct arguments in the random oracle model
- Compressed \(\varSigma\)-protocol theory and practical application to plug \& play secure algorithmics
- Efficient information-theoretic secure multiparty computation over \(\mathbb{Z}/p^k\mathbb{Z}\) via Galois rings
- Efficient post-quantum SNARKs for RSIS and RLWE and their applications to privacy
- Efficient zero-knowledge arguments for arithmetic circuits in the discrete log setting
- Expected-time cryptography: generic techniques and applications to concrete soundness
- Fiat-Shamir: from practice to theory
- scientific article; zbMATH DE number 5485522 (Why is no real title available?)
- scientific article; zbMATH DE number 2009982 (Why is no real title available?)
- Interactive oracle proofs with constant rate and query complexity
- IP = PSPACE using error-correcting codes
- Lattice-based SNARGs and their application to more efficient obfuscation
- Libra: succinct zero-knowledge proofs with optimal prover computation
- Linear-size constant-query IOPs for delegating computation
- Linear-time arguments with sublinear verification from tensor codes
- Marlin: preprocessing zkSNARKs with universal and updatable SRS
- Non-deterministic exponential time has two-prover interactive protocols
- Practical verified computation with streaming interactive proofs
- Public-coin zero-knowledge arguments with (almost) minimal time and space overheads
- Quasi-optimal SNARGs via linear multi-prover interactive proofs
- Short discrete log proofs for FHE and ring-LWE ciphertexts
- Spartan: efficient and general-purpose zkSNARKs without trusted setup
- Succinct arguments in the quantum random oracle model
- Time- and space-efficient arguments from groups of unknown order
- Time-optimal interactive proofs for circuit evaluation
- Transparent SNARKs from DARK compilers
Cited in
(24)- Sumex utility functions
- Practical non-interactive publicly verifiable secret sharing with thousands of parties
- Lattice-based SNARKs: publicly verifiable, preprocessing, and recursively composable (extended abstract)
- Lattice-based succinct arguments for NP with polylogarithmic-time verification
- Lower bound on SNARGs in the random oracle model
- Quantum rewinding for many-round protocols
- Doubly efficient interactive proofs over infinite and non-commutative rings
- Lattice-based succinct arguments from vanishing polynomials (extended abstract)
- \textsf{Orbweaver}: succinct linear functional commitments from lattices
- Algebraic reductions of knowledge
- Multilinear Schwartz-Zippel \(\operatorname{mod} \mathrm{N}\) and lattice-based succinct arguments
- Lattice-based polynomial commitments: towards asymptotic and concrete efficiency
- SLAP: succinct lattice-based polynomial commitments from standard assumptions
- Polynomial commitments from lattices: post-quantum security, fast verification and transparent setup
- \textsf{LatticeFold+}: faster, simpler, shorter lattice-based folding for succinct proof systems
- \textsf{Zinc}: succinct arguments with small arithmetization overheads from IOPs of proximity to the integers
- Straight-line knowledge extraction for multi-round protocols
- DewTwo: a transparent PCS with quasi-linear prover, logarithmic verifier and 4.5KB proofs from falsifiable assumptions
- Transparent SNARKs over Galois rings
- Scalable zkSNARKs for matrix computations. A generic framework for verifiable deep learning
- Inner-product commitments over integers with applications to succinct arguments
- SNARK lower bounds via communication complexity
- Sum-check protocol for approximate computations
- A divide-and-conquer sumcheck protocol
This page was built for publication: Sumcheck arguments and their applications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2120101)
