Rational Sumchecks
From MaRDI portal
Publication:2799100
DOI10.1007/978-3-662-49099-0_12zbMath1382.94116OpenAlexW4240150661MaRDI QIDQ2799100
Siyao Guo, Alon Rosen, Margarita Vald, Pavel Hubáček
Publication date: 8 April 2016
Published in: Theory of Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-662-49099-0_12
Cryptography (94A60) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)
Related Items (4)
Verifiable crowd computing: coping with bounded rationality ⋮ Unnamed Item ⋮ Sumcheck-based delegation of quantum computing to rational server ⋮ Outsourcing computation: the minimal refereed mechanism
Cites Work
- Unnamed Item
- Unnamed Item
- Optimal Contracts for Outsourced Computation
- How to Use Bitcoin to Design Fair Protocols
- Secure Two-Party Computation with Low Communication
- Universally Composable Security with Local Adversaries
- Rational arguments
- Non-Interactive Proofs of Proximity
- Arguments of Proximity
- Algebraic methods for interactive proof systems
- IP = PSPACE
- Computationally Sound Proofs
- Succinct Non-interactive Arguments via Linear Interactive Proofs
- How to delegate computations
- Rational proofs
- Separating succinct non-interactive arguments from all falsifiable assumptions
- Advances in Cryptology - CRYPTO 2003
- Delegation for bounded space
- Interactive proofs of proximity
This page was built for publication: Rational Sumchecks
