This paper describes a new VA system, called Giraffe; charges Giraffe for all three costs; and identifies regimes where outsourcing is worthwhile. Giraffe’s base is an interactive proof geared to data parallel computation. Giraffe makes this protocol asymptotically optimal for the prover, which is of independent interest. Giraffe also develops a design template that produces hardware designs automatically for a wide range of parameters, introduces hardware primitives molded to the protocol’s data flows, and incorporates program analyses that expand applicability. Giraffe wins even when outsourcing several tens of sub-computations, scales to 500x larger computations than prior work, and can profitably outsource parts of programs that are not worthwhile to outsource in full.
Category / Keywords: implementation / verifiable computation, trustworthy hardware, probabilistic proofs, interactive proofs, sum-check protocol Date: received 13 Mar 2017, last revised 5 Jun 2017 Contact author: rsw at cs stanford edu Available format(s): PDF | BibTeX Citation Version: 20170606:004032 (All versions of this report) Short URL: ia.cr/2017/242 Discussion forum: Show discussion | Start new discussion