Succinct non-interactive arguments of knowledge (SNARKs) have found numerous
applications in the blockchain setting and elsewhere. The most efficient SNARKs require a …

Recent efficient constructions of zero-knowledge Succinct Non-interactive Arguments of
Knowledge (zk-SNARKs), require a setup phase in which a common-reference string (CRS) …

Subversion zero knowledge for non-interactive proof systems demands that zero knowledge
(ZK) be maintained even when the common reference string (CRS) is chosen maliciously …

Non-interactive zero-knowledge proofs, and more specifically succinct non-interactive zero-
knowledge arguments (zk-SNARKs), have been proven to be the “Swiss army knife” of the …

Ever since their introduction, zero-knowledge proofs have become an important tool for
addressing privacy and scalability concerns in a variety of applications. In many systems …

Zk-SNARKs (succinct non-interactive zero-knowledge arguments of knowledge) are needed
in many applications. Unfortunately, all previous zk-SNARKs for interesting languages are …

Abstract Succinct Non-interactive Arguments of Knowledge (SNARKs) have seen interest
and development from the cryptographic community over recent years, and there are now …

Zero-knowledge succinct non-interactive arguments of knowledge (zk-SNARKs) have
emerged as a valuable tool for verifiable computation and privacy preserving protocols …

The two most common ways to design non-interactive zero-knowledge (NIZK) proofs are
based on Sigma protocols and QAP-based SNARKs. The former is highly efficient for …

We present a zero-knowledge argument for NP with low communication complexity, low
concrete cost for both the prover and the verifier, and no trusted setup, based on standard …