Public Verification of Outsourced Computation of Polynomial Functions

We study the issues of outsourced computation in which a computationally weak client outsources its work to a computationally strong worker. Since the worker may not be trusted, the verification of the correctness of outsourced computation gets more attention. This paper focuses on the public verification model where the computation result can be verified by any other client using the public verification key. Fiore and Gennaro provided a public outsourced computation scheme for polynomial functions. It is efficient and offer security, however it doesn´t keep privacy of the outsourced data. Using the idea of fully homomorphic message authenticators proposed by Gennaro and Wichs, we propose a verification scheme for outsourced computation of polynomial functions. It is in the public verification model and achieves keeping privacy of the outsourced data.