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 …

We build a system that provides succinct non-interactive zero-knowledge proofs (zk-
SNARKs) for program executions on a von Neumann RISC architecture. The system has two …

There have been tremendous advances in reducing interaction, communication and
verification time in zero-knowledge proofs but it remains an important challenge to make the …

This paper introduces Spartan, a new family of zero-knowledge succinct non-interactive
arguments of knowledge (zkSNARKs) for the rank-1 constraint satisfiability (R1CS), an NP …

We show a constant-overhead interactive zero-knowledge (ZK) proof system for RAM
programs, that is, a ZK proof in which the communication complexity as well as the running …

We describe GINGER, a built system for unconditional, general-purpose, and nearly
practical verification of outsourced computation. GINGER is based on PEPPER, which uses …

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 …

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 …

The area of proof-based verified computation (outsourced computation built atop
probabilistically checkable proofs and cryptographic machinery) has lately seen renewed …

Interactive proofs (IPs) and arguments are cryptographic protocols that enable an untrusted
prover to provide a guarantee that it performed a requested computation correctly …