Outsourcing Computation: the Minimal Refereed Mechanism
Abstract
We consider a setting where a verifier with limited computation power delegates a resource intensive computation taskwhich requires a $T\times S$ computation tableauto two provers where the provers are rational in that each prover maximizes their own payofftaking into account losses incurred by the cost of computation. We design a mechanism called the Minimal Refereed Mechanism (MRM) such that if the verifier has $O(\log S + \log T)$ time and $O(\log S + \log T)$ space computation power, then both provers will provide a honest result without the verifier putting any effort to verify the results. The amount of computation required for the provers (and thus the cost) is a multiplicative $\log S$factor more than the computation itself, making this schema efficient especially for lowspace computations.
 Publication:

arXiv eprints
 Pub Date:
 October 2019
 arXiv:
 arXiv:1910.14269
 Bibcode:
 2019arXiv191014269K
 Keywords:

 Computer Science  Computer Science and Game Theory;
 Computer Science  Cryptography and Security
 EPrint:
 17 pages, 1 figure