Outsourcing computation: the minimal refereed mechanism
From MaRDI portal
Publication:777972
DOI10.1007/978-3-030-35389-6_19zbMath1435.68100arXiv1910.14269OpenAlexW2990374137MaRDI QIDQ777972
Biaoshuai Tao, Yuqing Kong, Chris Peikert, Grant Schoenebeck
Publication date: 30 June 2020
Full work available at URL: https://arxiv.org/abs/1910.14269
Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Other nonclassical models of computation (68Q09) Mechanism design theory (91B03)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Refereed delegation of computation
- Arthur-Merlin games: A randomized proof system, and a hierarchy of complexity classes
- Algorithmic rationality: game theory with costly computation
- Rational Sumchecks
- From extractable collision resistance to succinct non-interactive arguments of knowledge, and back again
- Rational arguments
- Delegating Computation
- Non-interactive Verifiable Computing: Outsourcing Computation to Untrusted Workers
- The Knowledge Complexity of Interactive Proof Systems
- Algebraic methods for interactive proof systems
- IP = PSPACE
- How to delegate computations publicly
- Succinct delegation for low-space non-deterministic computation
- Strictly Proper Scoring Rules, Prediction, and Estimation
- Constant-round interactive proofs for delegating computation
- Rational proofs
This page was built for publication: Outsourcing computation: the minimal refereed mechanism
