Achieving Privacy in Verifiable Computation with Multiple Servers−without FHE and without Pre−proocessing
Prabhanjan Ananth, Nishanth Chandran, Vipul Goyal, Bhavana Kanukurthi, Rafail Ostrovsky
Cloud services provide a powerful resource to which weak clients may outsource their computation. While tremendously useful, they come with their own security challenges. One of the fundamental issues in cloud computation is: how does a client efficiently verify the correctness of computation performed on an untrusted server? In recent years, a number of proposals have been made for constructing verifiable computation protocols. Unfortunately , solutions that guarantee privacy of inputs (in addition to the correctness of computation) rely on the use of fully homomorphic encryption (FHE). An unfortunate consequence of this dependence on FHE, is that all hope of making verifiable computation implementable in practice hinges on the challenge of making FHE deployable in practice. This brings us to the following question: do we need fully homomorphic encryption to obtain privacy in verifiable computation protocol which achieves input privacy?
Another drawback of existing protocols is that they require the client to run a pre − processing stage, in which the work done by the client is proportional to the function being outsourced and hence the outsourcing benefit is obtained inly in an amortized sense. This brings us to our next question: can we build verifiable computation protocols that allow the client to efficiently outsource even a computation that it wishes to execute just once?
In this paper, we consider a model in which the client outsources his computation to multiple (say n ≤ 2) serves. In this model, we construct verifiable computation protocols that do not make use of FHE and that do not have a pre (processing stage. In the two−server setting, we present an extremely practical protocol based on only on one(way functions. we also present a solution, based on the DDH assumption, for the multi−server model for any arbitrary n. All these protocols are secure as long as at least one server is honest. Finally, even in the n − server model, we present a solution based solely on one−way functions. This protocol tolerates up to a constant fraction of corrupted servers.
comment: PKC 2014 PP: 149−166
Fetch PDF file of the paper
|Back to Publications List|