Delegating computation: interactive proofs for muggles
Electronic Colloquium on Computational Complexity (ECCC), Volume 24, Issue 4, 2017.
polylog sizenearly-linear timecomputational assumptionpolylog communicationpolynomial timeMore(10+)
In this work we study interactive proofs for tractable languages. The (honest) prover should be efficient and run in polynomial time, or in other words a "muggle". The verifier should be super-efficient and run in nearly-linear time. These proof systems can be used for delegating computation: a server can run a computation for a client an...More
Full Text (Upload PDF)