Verifying computations with state

Benjamin Braun, Ariel J. Feldman, Zuocheng Ren, Srinath Setty, Andrew J. Blumberg, Michael Walfish

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

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.

Original languageEnglish (US)
Title of host publicationSOSP 2013 - Proceedings of the 24th ACM Symposium on Operating Systems Principles
Pages341-357
Number of pages17
DOIs
StatePublished - 2013
Event24th ACM Symposium on Operating Systems Principles, SOSP 2013 - Farmington, PA, United States
Duration: Nov 3 2013Nov 6 2013

Other

Other24th ACM Symposium on Operating Systems Principles, SOSP 2013
CountryUnited States
CityFarmington, PA
Period11/3/1311/6/13

Fingerprint

Random access storage
Cryptography

ASJC Scopus subject areas

  • Software

Cite this

Braun, B., Feldman, A. J., Ren, Z., Setty, S., Blumberg, A. J., & Walfish, M. (2013). Verifying computations with state. In SOSP 2013 - Proceedings of the 24th ACM Symposium on Operating Systems Principles (pp. 341-357) https://doi.org/10.1145/2517349.2522733

Verifying computations with state. / Braun, Benjamin; Feldman, Ariel J.; Ren, Zuocheng; Setty, Srinath; Blumberg, Andrew J.; Walfish, Michael.

SOSP 2013 - Proceedings of the 24th ACM Symposium on Operating Systems Principles. 2013. p. 341-357.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Braun, B, Feldman, AJ, Ren, Z, Setty, S, Blumberg, AJ & Walfish, M 2013, Verifying computations with state. in SOSP 2013 - Proceedings of the 24th ACM Symposium on Operating Systems Principles. pp. 341-357, 24th ACM Symposium on Operating Systems Principles, SOSP 2013, Farmington, PA, United States, 11/3/13. https://doi.org/10.1145/2517349.2522733
Braun B, Feldman AJ, Ren Z, Setty S, Blumberg AJ, Walfish M. Verifying computations with state. In SOSP 2013 - Proceedings of the 24th ACM Symposium on Operating Systems Principles. 2013. p. 341-357 https://doi.org/10.1145/2517349.2522733
Braun, Benjamin ; Feldman, Ariel J. ; Ren, Zuocheng ; Setty, Srinath ; Blumberg, Andrew J. ; Walfish, Michael. / Verifying computations with state. SOSP 2013 - Proceedings of the 24th ACM Symposium on Operating Systems Principles. 2013. pp. 341-357
@inproceedings{ce0abce31ae5412b8f24cc1550af7aa0,
title = "Verifying computations with state",
abstract = "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.",
author = "Benjamin Braun and Feldman, {Ariel J.} and Zuocheng Ren and Srinath Setty and Blumberg, {Andrew J.} and Michael Walfish",
year = "2013",
doi = "10.1145/2517349.2522733",
language = "English (US)",
isbn = "9781450323888",
pages = "341--357",
booktitle = "SOSP 2013 - Proceedings of the 24th ACM Symposium on Operating Systems Principles",

}

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

SP - 341

EP - 357

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

ER -