TY - GEN

T1 - Verifying computations with state

AU - Braun, Benjamin

AU - Feldman, Ariel J.

AU - Ren, Zuocheng

AU - Setty, Srinath

AU - Blumberg, Andrew J.

AU - Walfish, Michael

PY - 2013

Y1 - 2013

N2 - When a client outsources a job to a third party (e.g., the cloud), how can the client check the result, without re-executing the computation? Recent work in proof-based verifiable computation has made significant progress on this problem by incorporating deep results from complexity theory and cryptography into built systems. However, these systems work within a stateless model: they exclude computations that interact with RAM or a disk, or for which the client does not have the full input. This paper describes Pantry, a built system that overcomes these limitations. Pantry composes proof-based verifiable computation with untrusted storage: the client expresses its computation in terms of digests that attest to state, and verifiably outsources that computation. Using Pantry, we extend verifiability to MapReduce jobs, simple database queries, and interactions with private state. Thus, Pantry takes another step toward practical proof-based verifiable computation for realistic applications.

AB - When a client outsources a job to a third party (e.g., the cloud), how can the client check the result, without re-executing the computation? Recent work in proof-based verifiable computation has made significant progress on this problem by incorporating deep results from complexity theory and cryptography into built systems. However, these systems work within a stateless model: they exclude computations that interact with RAM or a disk, or for which the client does not have the full input. This paper describes Pantry, a built system that overcomes these limitations. Pantry composes proof-based verifiable computation with untrusted storage: the client expresses its computation in terms of digests that attest to state, and verifiably outsources that computation. Using Pantry, we extend verifiability to MapReduce jobs, simple database queries, and interactions with private state. Thus, Pantry takes another step toward practical proof-based verifiable computation for realistic applications.

UR - http://www.scopus.com/inward/record.url?scp=84889685086&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84889685086&partnerID=8YFLogxK

U2 - 10.1145/2517349.2522733

DO - 10.1145/2517349.2522733

M3 - Conference contribution

AN - SCOPUS:84889685086

SN - 9781450323888

T3 - SOSP 2013 - Proceedings of the 24th ACM Symposium on Operating Systems Principles

SP - 341

EP - 357

BT - SOSP 2013 - Proceedings of the 24th ACM Symposium on Operating Systems Principles

T2 - 24th ACM Symposium on Operating Systems Principles, SOSP 2013

Y2 - 3 November 2013 through 6 November 2013

ER -