Cryptology ePrint Archive: Report 2012/598

Taking proof-based verified computation a few steps closer to practicality (extended version)

Srinath Setty and Victor Vu and Nikhil Panpalia and Benjamin Braun and Muqeet Ali and Andrew J. Blumberg and Michael Walfish

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 \emph{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.

Category / Keywords: cryptographic protocols / implementation applications PCP verified computation

Publication Info: This paper is an extended version of a previous publication. This version includes four Appendices (B--E) that were elided from the published version, for space.

Date: received 23 Oct 2012, last revised 28 Feb 2013

Contact author: mwalfish at cs utexas edu

Available format(s): PDF | BibTeX Citation

Note: This paper is an extended version of a previous publication. This version includes four Appendices (B--E) that were elided from the published version, for space, and eliminates an incorrect theoretical claim in the published paper.

Version: 20130228:071118 (All versions of this report)

Short URL: ia.cr/2012/598

Discussion forum: Show discussion | Start new discussion