Taking proof-based verified computation a few steps closer to practicality

Srinath Setty, Victor Vu, Nikhil Panpalia, Benjamin Braun, Andrew J. Blumberg, Michael Walfish

Research output: Contribution to conferencePaper

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.

Original languageEnglish (US)
Pages253-268
Number of pages16
StatePublished - 2012
Event21st USENIX Security Symposium - Bellevue, United States
Duration: Aug 8 2012Aug 10 2012

Conference

Conference21st USENIX Security Symposium
CountryUnited States
CityBellevue
Period8/8/128/10/12

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Information Systems
  • Safety, Risk, Reliability and Quality

Fingerprint Dive into the research topics of 'Taking proof-based verified computation a few steps closer to practicality'. Together they form a unique fingerprint.

  • Cite this

    Setty, S., Vu, V., Panpalia, N., Braun, B., Blumberg, A. J., & Walfish, M. (2012). Taking proof-based verified computation a few steps closer to practicality. 253-268. Paper presented at 21st USENIX Security Symposium, Bellevue, United States.