Resolving the Conflict Between Generality and Plausibility in Verified Computation

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. The core issue is that the work for the prover is immense, in general; it is near-practical only for hand-compiled computations that can be expressed in special forms. This paper addresses that problem. Provided one is willing to batch verification, the authors develop a protocol that achieves the efficiency of the best manually constructed protocols in the literature yet applies to all computations.

Provided by: University of Teramo Topic: Security Date Added: Nov 2012 Format: PDF

Find By Topic