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 design, implement, and evaluate a zero knowledge succinct non-interactive argument
(SNARG) for Rank-1 Constraint Satisfaction (R1CS), a widely-deployed NP language …

SPDZ denotes a multiparty computation scheme in the preprocessing model based on
somewhat homomorphic encryption (SHE) in the form of BGV. At CCS'16, Keller et al …

Recent work, including ZKBoo, ZKB++, and Ligero, has developed efficient non-interactive
zero-knowledge proofs of knowledge (NIZKPoKs) for Boolean circuits based on symmetric …

Non-interactive batch arguments for NP provide a way to amortize the cost of NP verification
across multiple instances. They enable a prover to convince a verifier of multiple NP …

We introduce and study the notion of fully linear probabilistically checkable proof systems. In
such a proof system, the verifier can make a small number of linear queries that apply jointly …

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 …

Succinct non-interactive arguments of knowledge (SNARKs) enable non-interactive efficient
verification of NP computations and admit short proofs. However, all current SNARK …

We prove that Kilian's four-message succinct argument system is post-quantum secure in
the standard model when instantiated with any probabilistically checkable proof and any …

Succinct non-interactive arguments (SNARGs) are highly efficient certificates of membership
in non-deterministic languages. Constructions of SNARGs in the random oracle model are …