Paper 2012/598 Original: eprint.iacr.org/2012/598 ↗
Taking proof-based verified computation a few steps closer to practicality (extended version)
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.
Metadata
- Available format(s)
PDF- Category
- Cryptographic protocols
- Publication info
- Preprint.
- History
- 2013-02-28: last updated
- 2012-10-25: published
- Short URL
- https://ia.cr/2012/598
- License
- https://creativecommons.org/licenses/by/4.0/
BibTeX
@misc{cryptoeprint:2012/598,
author = {Srinath Setty and Victor Vu and Nikhil Panpalia and Benjamin Braun and Muqeet Ali and Andrew J. Blumberg and Michael Walfish},
title = {Taking proof-based verified computation a few steps closer to practicality (extended version)},
howpublished = {Cryptology {ePrint} Archive, Paper 2012/598},
year = {2012},
url = {https://eprint.iacr.org/2012/598}
}