A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2013; you can also visit the original URL.
The file type is
We construct a 1-round delegation scheme for every language computable in time t = t(n) and space s = s(n), where the running time of the prover is poly(t) and the running time of the verifier isÕ(n + poly(s)) (whereÕ hides polylog(t) factors). The proof exploits a curious connection between the problem of computation delegation and the model of multi-prover interactive proofs that are sound against no-signaling (cheating) strategies, a model that was studied in the context of multi-proverdoi:10.1145/2488608.2488679 dblp:conf/stoc/KalaiRR13 fatcat:6dybbzm3qvcv3kmv2p3m5r4jy4