How to delegate computations: the power of no-signaling proofs
STOC, pp. 485-494, 2014.
algorithmsdesignmodels of computationmodes of computationtheoryMore(2+)
We construct a 1-round delegation scheme (i.e., argument system) for every language computable in time t = t(n), where the running time of the prover is poly(t) and the running time of the verifier is n · polylog(t). In particular, for every language in P we obtain a delegation scheme with almost linear time verification. Our construction...More
Full Text (Upload PDF)