Private Outsourcing of Polynomial Functions

We study the problems of outsourcing computation where a computational weak client outsources its computation task to a powerful server. Our work focuses on the research about outsourcing polynomial functions. Based on Zhang and Safavi-Naini´s work, we construct a private outsourcing computation scheme for polynomial functions. Our scheme can keep privacy of the outsourced data and function. It is efficient in the sense of amortization and satisfies public verification. Compared with Zhang and Safavi-Naini´s work, our construction uses a new efficient verify-method and makes the verification process public (any other clients can verify the correctness of the results returned by the server using the public key).