Verifying computations without reexecuting them Page 1 74 COMMUNICATIONS OF THE ACM
| FEBRUARY 2015 | VOL. 58 | NO. 2 review articles DOI:10.1145/2641562 From theoretical …

We introduce HyperNova, a new recursive argument for proving incremental computations
whose steps are expressed with CCS (Setty et al. ePrint 2023/552), a customizable …

We study the problem of building a verifiable delay function (VDF). A VDF VDF requires a
specified number of sequential steps to evaluate, yet produces a unique output that can be …

Zero-knowledge proof is a powerful cryptographic primitive that has found various
applications in the real world. However, existing schemes with succinct proof size suffer from …

Human dignity demands that personal information, like medical and forensic data, be hidden
from the public. But veils of secrecy designed to preserve privacy may also be abused to …

Abstract Succinct Non-interactive Arguments of Knowledge (SNARKs) allow an untrusted
prover to establish that it correctly ran some “witness-checking procedure” on a witness. A …

We design, implement, and evaluate a zero knowledge succinct non-interactive argument
(SNARG) for Rank-1 Constraint Satisfaction (R1CS), a widely-deployed NP language …

Non-interactive arguments enable a prover to convince a verifier that a statement is true.
Recently there has been a lot of progress both in theory and practice on constructing highly …

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 …

Emerging smart contract systems over decentralized cryptocurrencies allow mutually
distrustful parties to transact safely without trusted third parties. In the event of contractual …