**
Non-interactive Zaps and New Techniques for NIZK
**

*
Jens Groth, Rafail Ostrovsky, Amit Sahai
*

**
Abstract:
**

In 2000, Dwork and Naor proved a very surprising result: that there exist ``Zaps'',
two-round witness-indistinguishable proofs in the plain model without a common reference string, where the Verifier asks a single question
and the Prover sends back a single answer. This left open the following tantalizing question: does there exist a * non-interactive *
witness indistinguishable proof, where the Prover sends a single message to
the Verifier for some non-trivial NP-language? In 2003, Barak, Ong and Vadhan answered this question affirmatively by derandomizing Dwork and Naor's construction under a complexity theoretic assumption, namely that Hitting Set Generators against co-nondeterministic circuits exist.

In this paper, we construct non-interactive Zaps for all NP-languages. We accomplish this by introducing new techniques for building Non-Interactive Zero Knowledge (NIZK) Proof and Argument systems, which we believe to be of independent interest, and then modifying these to yield our main result. Our construction is based on the Decisional Linear Assumption, which can be seen as a bilinear group variant of the Decisional Diffie-Hellman Assumption.

Furthermore, our single message witness-indistinguishable proof for Circuit Satisfiability is of size O(k|C|) bits, where k is a security parameter, and |C| is the size of the circuit. This is much more efficient than previous constructions of 1- or 2-move Zaps.

**Keywords: **
Non-interactive zero-knowledge, witness indistinguishability, bilinear groups, Decisional Linear Assumption.

**comment:**
In Proceedings of Advances in Cryptology, (CRYPTO-2006)
Springer-Verlag/IACR Lecture Notes in Computer Science.

Fetch PostScript file of the paper Fetch PDF file of the paper

Back to Publications List |