We present a methodology to construct preprocessing zkSNARKs where the structured
reference string (SRS) is universal and updatable. This exploits a novel use of holography …

We present a new methodology to efficiently realize recursive composition of succinct non-
interactive arguments of knowledge (SNARKs). Prior to this work, the only known …

Succinct arguments allow a prover to convince a verifier of the validity of any statement in a
language, with minimal communication and verifier's work. Among other approaches, lattice …

We study how to construct zkSNARKs whose SRS is universal and updatable, ie, valid for all
relations within a size-bound and to which a dynamic set of participants can indefinitely add …

We introduce a class of interactive protocols, which we call sumcheck arguments, that
establishes a novel connection between the sumcheck protocol (Lund et al. JACM 1992) …

Timed cryptography studies primitives that retain their security only for a predetermined
amount of time, such as proofs of sequential work and time-lock puzzles. This feature has …

We construct a polynomial commitment scheme with constant (ie, independent of the
degree) sized evaluation proofs and logarithmic (in the degree) verification time in the …

A collection of sets displays a proximity gap with respect to some property if for every set in
the collection, either (i) all members are δ-close to the property in relative Hamming distance …

Succinct arguments that rely on the Merkle-tree paradigm introduced by Kilian (STOC 92)
suffer from larger proof sizes in practice due to the use of generic cryptographic primitives. In …

A report on the selection process of the STARK friendly hash (SFH) function for
standardization by the Ethereum Foundation. The outcome of this process, described here …