Taking Proof-Based Verified Computation a Few Steps Closer to Practicality

Authors: 

Srinath Setty, Victor Vu, Nikhil Panpalia, Benjamin Braun, Andrew J. Blumberg, and Michael Walfish, The University of Texas at Austin

Abstract: 

We describe GINGER, a built system for unconditional, general-purpose, and nearly practical verification of outsourced computation. GINGER is based on PEPPER, which uses the PCP theorem and cryptographic techniques to implement an efficient argument system (a kind of interactive protocol). GINGER slashes the query size and costs via theoretical refinements that are of independent interest; broadens the computational model to include (primitive) floating-point fractions, inequality comparisons, logical operations, and conditional control flow; and includes a parallel GPU-based implementation that dramatically reduces latency.

 

Open Access Media

USENIX is committed to Open Access to the research presented at our events. Papers and proceedings are freely available to everyone once the event begins. Any video, audio, and/or slides that are posted after the event are also free and open to everyone. Support USENIX and our commitment to Open Access.

BibTeX
@inproceedings {180216,
author = {Srinath Setty and Victor Vu and Nikhil Panpalia and Benjamin Braun and Andrew J. Blumberg and Michael Walfish},
title = {Taking {Proof-Based} Verified Computation a Few Steps Closer to Practicality},
booktitle = {21st USENIX Security Symposium (USENIX Security 12)},
year = {2012},
isbn = {978-931971-95-9},
address = {Bellevue, WA},
pages = {253--268},
url = {https://www.usenix.org/conference/usenixsecurity12/technical-sessions/presentation/setty},
publisher = {USENIX Association},
month = aug
}

Presentation Video

Presentation Audio