Verifiable Computation enables a computationally weak client to "outsource" the computation of a function F on various inputs x 1 , ..., x k to one or more workers. The workers return the result of the function evaluation, e.g., y i = F(x i ), as well as a proof that the computation of F was carried out correctly on the given value x i . The verification of the proof should require substantially less computational effort than computing F(x i ) from scratch. We present a protocol that allows the worker to return a computationally-sound, non-interactive proof that can be verified in O(m) time, where m is the bit-length of the output of F. The protocol requires a one-time pre-processing stage by the client which takes O(|C|) time, where C is the smallest Boolean circuit computing F. Our scheme also provides input and output privacy for the client, meaning that the workers do not learn any information about the x i or y i values.
REF outline a general scheme for verification of computation modeled as a Boolean circuit.
Non-interactive verifiable computing: Outsourcing computation to untrusted workers
In CRYPTO
Computer Science