This paper introduces Brakedown, 1 the first built system that provides linear-time SNARKs
for NP, meaning the prover incurs O (N) finite field operations to prove the satisfiability of an …

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 …

This paper presents Dory, a transparent setup, public-coin interactive argument for inner-
pairing products between committed vectors of elements of two source groups. For a product …

We propose a novel KZG-based sum-check scheme, dubbed Losum, with optimal efficiency.
Particularly, its proving cost is one multi-scalar-multiplication of size k—the number of non …

Garbled Circuit (GC) is a basic technique for practical secure computation. GC handles
Boolean circuits; it consumes significant network bandwidth to transmit encoded gate truth …

Hash functions are a crucial component in incrementally verifiable computation (IVC)
protocols and applications. Among those, recursive SNARKs and folding schemes require …

Goldreich (ECCC 2000) proposed a candidate one-way function construction which is
parameterized by the choice of a small predicate (over d= O (1) variables) and of a bipartite …

We introduce the notion of a Succinct Parallelizable Argument of Knowledge (SPARK). This
is an argument system with the following three properties for computing and proving a time T …

The contribution of the paper is two-fold. First, we design a novel permutation-based hash
mode of operation FP, and analyze its security. We show that any n-bit hash function that …

Succinct non-interactive arguments (SNARGs) enable verifying NP statements with lower
complexity than required for classical NP verification. Traditionally, the focus has been on …