Zero knowledge proofs are an important building block in many cryptographic applications.
Unfortunately, when the proof statements become very large, existing zero-knowledge proof …

Zero-knowledge proof is a powerful cryptographic primitive that has found various
applications in the real world. However, existing schemes with succinct proof size suffer from …

Non-interactive zero-knowledge proofs of knowledge for general NP statements are a
powerful cryptographic primitive, both in theory and in practical applications. Recently, much …

We present an efficient zero-knowledge argument of knowledge system customized for the
Paillier cryptosystem. Our system enjoys sublinear proof size, low verification cost, and …

Zero-knowledge succinct non-interactive argument of knowledge (zkSNARK) allows a party,
known as the prover, to convince another party, known as the verifier, that he knows a …

Zero-knowledge proofs, introduced by Goldwasser, Micali, and Rackoff, are a fundamental
building block in theoretical cryptography with numerous applications. Still, the impact of …

Verifying the correctness of computation without revealing the input is a critical issue
intensively studied in real-world applications. The recent surge of zero knowledge …

Zero-knowledge succinct non-interactive arguments of knowledge (zk-SNARKs) are
cryptographic protocols that offer efficient and privacy-preserving means of verifying NP …

Non-interactive zero-knowledge proofs (NIZKs) and in particular succinct NIZK arguments of
knowledge (zk-SNARKs) increasingly see real-world adoption in large and complex …

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 …