Paper 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.
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.
Metadata
- Available format(s)
- Category
- Cryptographic protocols
- Publication info
- Published elsewhere. 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.
- Contact author(s)
- mwalfish @ cs utexas edu
- History
- 2013-02-28: last of 2 revisions
- 2012-10-25: received
- See all versions
- Short URL
- https://ia.cr/2012/598
- License
-
CC BY