Author(s): Srinath Setty, Richard Mcpherson, Andrew Blumberg and Michael Walfish

Download: Paper (PDF)

Date: 6 Feb 2012

Document Type: Briefing Papers

Associated Event: NDSS Symposium 2012


It has long been known that, to achieve unconditionally verifiable outsourced computation, probabilistically checkable proofs (PCPs) and argument systems offered solutions in theory but were hopeless in practice. This paper describes a system that reduces the costs of this machinery by 20 orders of magnitude, resulting in a built system for outsourced computation that is in striking distance of practical.