Recent work on proof-based verifiable computation has resulted in built systems that employ
tools from complexity theory and cryptography to address a basic problem in systems …

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 area of proof-based verified computation (outsourced computation built atop
probabilistically checkable proofs and cryptographic machinery) has lately seen renewed …

To instill greater confidence in computations outsourced to the cloud, clients should be able
to verify the correctness of the results returned. To this end, we introduce Pinocchio, a built …

We address the problem in which a client stores a large amount of data with an untrusted
server in such a way that, at any moment, the client can ask the server to compute a function …

This paper describes the design, implementation, and evaluation of a system for performing
verifiable outsourced computation. It has long been known that (1) this problem can be …

We introduce and formalize the notion of Verifiable Computation, which enables a
computationally weak client to “outsource” the computation of a function F on various …

An argument system for NP is a proof system that allows efficient verification of NP
statements, given proofs produced by an untrusted yet computationally-bounded prover …

Cloud computing sparked interest in Verifiable Computation protocols, which allow a weak
client to securely outsource computations to remote parties. Recent work has dramatically …

We study the problem of verifiable computation (VC) for RAM programs, where a
computationally weak verifier outsources the execution of a program to a powerful (but …