A zero-knowledge proof is a fundamental cryptographic primitive that enables the
verification of statements without revealing unnecessary information. Zero-knowledge proofs …

We present Libra, the first zero-knowledge proof system that has both optimal prover time
and succinct proof size/verification time. In particular, if C is the size of the circuit being …

In this thesis, we study zero-knowledge proofs, a cryptographic primitive that allows to prove
a statement while yielding nothing beyond its truth, and their applications to secure …

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 …

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

Efficient zero-knowledge (ZK) proofs for arbitrary boolean or arithmetic circuits have recently
attracted much attention. Existing solutions suffer from either significant prover overhead (ie …

There have been tremendous advances in reducing interaction, communication and
verification time in zero-knowledge proofs but it remains an important challenge to make the …

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

We show a compiler that allows to prove the correct execution of RAM programs using any
zero-knowledge system for circuit satisfiability. At the core of this work is an arithmetic circuit …

Zero-knowledge (ZK) proofs have recently attracted much attention. Typically, these are
defined with respect to statements that are fomulated as circuits over a fixed finite field F2 or …