May 10, 2011 · Our experimental results demonstrate that a practical general-purpose protocol for verifiable computation may be significantly closer to reality ...

Our aim in this work is to advance a recent line of work on "proof systems" in which the service provider proves the correctness of its output to a user. The ...

Our main contribution is in achieving a prover that runs in time O(S(n) log S(n)), where S(n) is the size of an arithmetic circuit computing the function of.

[CCM 09/CCMT 12], [CMT 10], [CTY 11]. Fits cloud computing well: streaming pass by V can occur while uploading data to cloud.

Practical Verified Computation with. Streaming Interactive Proofs. Doctoral dissertation, Harvard. University. Accessed. July 23, 2018 11:32:38 PM EDT.

— Refereed Games: assumes 1 cloud is honest. — Multi-Prover Interactive Proofs: assumes clouds cannot communicate with each other. Page ...

This work advances a recent line of work on "proof systems" in which the service provider proves the correctness of its output to a user, and describes a ...

We make progress along two interrelated directions. The first seeks to render interactive proofs suitable for applications involving massive data. To this end, ...

ABSTRACT. When computation is outsourced, the data owner would like to be assured that the desired computation has been performed correctly.

Sep 30, 2011 · In this paper, we develop new proof protocols for verifying computations which are streaming in nature: the verifier (data owner) needs only logarithmic space ...