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) …

Abstract Zero-Knowledge Proofs (ZKPs), a cryptographic tool known for decades, have
gained significant attention in recent years due to advancements that have made them …

Zero-knowledge and succinctness are two important properties that arise in the study of non-
interactive arguments. Previously, Kitagawa et al.(TCC 2020) showed how to obtain a non …

Among the zero-knowledge succinct non-interactive arguments of knowledge (zk-SNARK),
the simulation-extractable zk-SNARK (SE-SNARK) introduces a security notion of non …

Most succinct arguments (SNARKs) are initially only proven knowledge sound (KS). We
show that the commonly employed compilation strategy from polynomial interactive oracle …

Recent progress in interactive zero-knowledge (ZK) proofs has improved the efficiency of
proving large-scale computations significantly. Nevertheless, real-life applications (eg, in the …

Non-interactive zero-knowledge proofs are a powerful cryptographic primitive used in
privacy-preserving protocols. We design and build C $\emptyset $ C $\emptyset $, the first …

Non-interactive zero-knowledge proofs (NIZKs) are a powerful cryptographic tool, with
numerous potential applications. However, succinct NIZKs (eg, zk-SNARK schemes) …

We propose SublonK---a new succinct non-interactive argument of knowledge (SNARK).
SublonK is the first SNARK that achieves both a constant proof size and prover runtime that …

The last few years have witnessed increasing interest in the deployment of zero-knowledge
proof systems, in particular ones with succinct proofs and efficient verification (zk-SNARKs) …