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

Publication series

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

Other

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

ASJC Scopus subject areas

  • Software

Fingerprint

Dive into the research topics of 'Verifying computations with state'. Together they form a unique fingerprint.

Cite this