Verifiable delegation of computation on outsourced data

  • Backes M
  • Fiore D
  • Reischuk R
  • 64

    Readers

    Mendeley users who have this article in their library.
  • 76

    Citations

    Citations of this article.

Abstract

We address the problem in which a client stores a large amount of data with an untrusted server in such a way that, at any moment, the client can ask the server to compute a function on some portion of its outsourced data. In this scenario, the client must be able to efficiently verify the correctness of the result despite no longer knowing the inputs of the delegated computation, it must be able to keep adding elements to its remote storage, and it does not have to fix in advance (i.e., at data outsourcing time) the function that it will delegate. Even more ambitiously, clients should be able to verify in time independent of the input-size - a very appealing property for computations over huge amounts of data. In this work we propose novel cryptographic techniques that solve the above problem for the class of computations of quadratic polynomials over a large number of variables. This class covers a wide range of significant arithmetic computations - notably, mny important statistics. To confirm the efficiency of our solution, we show encouraging performance results, e.g., correctness proofs have size below 1 kB and are verifiable by clients in less than 10 millseconds.

Get free article suggestions today

Mendeley saves you time finding and organizing research

Sign up here
Already have an account ?Sign in

Find this document

Authors

  • Michael Backes

  • Dario Fiore

  • Raphael M. Reischuk

Cite this document

Choose a citation style from the tabs below

Save time finding and organizing research with Mendeley

Sign up for free