Sumcheck arguments and their applications
From MaRDI portal
Publication:2120101
DOI10.1007/978-3-030-84242-0_26zbMath1485.94062OpenAlexW3159039187MaRDI QIDQ2120101
Katerina Sotiraki, Jonathan Bootle, Alessandro Chiesa
Publication date: 31 March 2022
Full work available at URL: https://doi.org/10.1007/978-3-030-84242-0_26
Related Items
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, \textsf{Orbweaver}: succinct linear functional commitments from lattices, Algebraic reductions of knowledge
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Are PCPs inherent in efficient arguments?
- Non-deterministic exponential time has two-prover interactive protocols
- Quasi-optimal SNARGs via linear multi-prover interactive proofs
- \(\mathrm{SPD}\mathbb {Z}_{2^k}\): efficient MPC \(\mod 2^k\) for dishonest majority
- Transparent SNARKs from DARK compilers
- Marlin: preprocessing zkSNARKs with universal and updatable SRS
- \textsc{Fractal}: post-quantum and transparent recursive proofs from holography
- A non-PCP approach to succinct quantum-safe zero-knowledge
- Compressed \(\varSigma\)-protocol theory and practical application to plug \& play secure algorithmics
- Spartan: efficient and general-purpose zkSNARKs without trusted setup
- Linear-time arguments with sublinear verification from tensor codes
- Barriers for succinct arguments in the random oracle model
- Public-coin zero-knowledge arguments with (almost) minimal time and space overheads
- Expected-time cryptography: generic techniques and applications to concrete soundness
- Time- and space-efficient arguments from groups of unknown order
- Efficient information-theoretic secure multiparty computation over \(\mathbb{Z}/p^k\mathbb{Z}\) via Galois rings
- Succinct arguments in the quantum random oracle model
- Linear-size constant-query IOPs for delegating computation
- Short discrete log proofs for FHE and ring-LWE ciphertexts
- Aurora: transparent succinct arguments for R1CS
- Libra: succinct zero-knowledge proofs with optimal prover computation
- Asymptotically good multiplicative LSSS over Galois rings and applications to MPC over \(\mathbb{Z}/p^k\mathbb{Z} \)
- Practical verified computation with streaming interactive proofs
- IP = PSPACE Using Error-Correcting Codes
- Time-Optimal Interactive Proofs for Circuit Evaluation
- Algebraic methods for interactive proof systems
- Efficient Post-quantum SNARKs for RSIS and RLWE and Their Applications to Privacy
- Fiat-Shamir: from practice to theory
- Lattice-Based SNARGs and Their Application to More Efficient Obfuscation
- Efficient Zero-Knowledge Arguments for Arithmetic Circuits in the Discrete Log Setting
