Increasing deployment of advanced zero-knowledge proof systems, especially zkSNARKs,
has raised critical questions about their security against real-world attacks. Two classes of …

We study sufficient conditions to compile simulation-extractable zkSNARKs from information-
theoretic interactive oracle proofs (IOP) using a simulation-extractable commit-and-prove …

Zero-knowledge proofs and in particular succinct non-interactive zero-knowledge proofs (so
called zk-SNARKs) are getting increasingly used in real-world applications, with …

Abstract Zero-knowledge Succinct Non-interactive ARguments of Knowledge (zkSNARKs)
are becoming an increasingly fundamental tool in many real-world applications where the …

Bulletproofs (Bünz et al. IEEE S&P 2018) are a celebrated ZK proof system that allows for
short and efficient proofs, and have been implemented and deployed in several real-world …

The simulation paradigm, introduced by Goldwasser, Micali and Rackoff, is of fundamental
importance to modern cryptography. In a breakthrough work from 2001, Barak (FOCS'01) …

Abstract In ASIACRYPT 2016, Bellare, Fuchsbauer and Scafuro studied security of non-
interactive zero-knowledge (NIZK) arguments in the face of parameter subversion. They …

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

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

We study the problem of building non-interactive proof systems modularly by linking small
specialized" gadget" SNARKs in a lightweight manner. Our motivation is both theoretical and …