Rational sumchecks

DOI10.1007/978-3-662-49099-0_12MaRDI QIDQ2799100zbMATH OpenOpenAlexFDO

Authors Siyao Guo, Pavel Hubáček, Alon Rosen, Margarita Vald

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

Mathematics Subject Classification ID

Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Cryptography (94A60)

Recommendations

• Rational arguments: single round delegation with sublinear verification
• Efficient rational proofs with strong utility-gap guarantees
• Rational proofs with multiple provers
• Efficient rational proofs for space bounded computations
• Sequentially composable rational proofs

Cites work

• Advances in Cryptology - CRYPTO 2003
• Algebraic methods for interactive proof systems
• Arguments of proximity (extended abstract)
• Computationally Sound Proofs
• Delegation for bounded space
• How to delegate computations
• How to use bitcoin to design fair protocols
• scientific article; zbMATH DE number 1670844 (Why is no real title available?)
• scientific article; zbMATH DE number 5485522 (Why is no real title available?)
• Interactive proofs of proximity: delegating computation in sublinear time
• IP = PSPACE
• Non-interactive proofs of proximity
• Optimal contracts for outsourced computation
• Rational arguments: single round delegation with sublinear verification
• Rational proofs
• Secure two-party computation with low communication
• Separating succinct non-interactive arguments from all falsifiable assumptions
• Succinct non-interactive arguments via linear interactive proofs
• Universally composable security with local adversaries

Cited in

(13)

• Sumcheck arguments and their applications
• Rational proofs with multiple provers
• Rational arguments: single round delegation with sublinear verification
• Sequentially composable rational proofs
• Fair and rational delegation computation protocol
• Non-cooperative rational interactive proofs
• Sumcheck-based delegation of quantum computing to rational server
• Sumcheck-based delegation of quantum computing to rational server
• Structural complexity of rational interactive proofs
• Verifiable crowd computing: coping with bounded rationality
• Verifiable crowd computing: coping with bounded rationality
• How to make rational arguments practical and extractable
• Outsourcing computation: the minimal refereed mechanism

This page was built for publication: Rational sumchecks

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