Resolving the conflict between generality and plausibility in verified computation
Srinath Setty, Benjamin M. Braun, Victor Vu, Andrew J. Blumberg, Bryan Jeffery Parno, Michael Walfish · 2013
The area of proof-based verified computation (outsourced computation built atop probabilistically checkable proofs and cryptographic machinery) has lately seen renewed interest. Although recent work has made great strides in reducing the overhead of naive applications of the theory, these schemes still cannot be considered practical. A core issue is that the work for the server is immense, in general; it is practical only for hand-compiled computations that can be expressed in special forms.