<p>I'm not sure what exactly you are looking for. </p>

<p>Goldreich's book ("Foundations of Cryptography, volume 1") contains an extensive discussion of non-interactive ZK proofs. So do these lecture notes of Katz (lectures 11-13): <a href="http://www.cs.umd.edu/~jkatz/gradcrypto2/scribes.html" rel="nofollow">http://www.cs.umd.edu/~jkatz/gradcrypto2/scribes.html</a>.</p>

<p>You could also look at this paper: Uriel Feige, Dror Lapidot, Adi Shamir: Multiple NonInteractive Zero Knowledge Proofs Under General Assumptions. SIAM J. Comput. 29(1): 1-28 (1999) and references therein.</p>

CC BY-SA 3.0
2011-10-12T01:50:13.827Z
2011-10-12T01:50:13.827Z
user6584
<p>The most famous "efficient" NIZK is by Groth and Sahai:</p>

<p>Jens Groth, Amit Sahai
Efficient Non-interactive Proof Systems for Bilinear Groups, Eurocrypt 2008</p>

<p>If you are willing to use stronger security assumptions, you can get even better efficiency. See the following paper of Groth (and subsequent improvements by other people), for example:</p>

<p>Jens Groth
Short Pairing-Based Non-interactive Zero-Knowledge Arguments, Asiacrypt 2010</p>

CC BY-SA 3.0
2013-03-10T17:41:24.497Z
2013-03-10T17:41:24.497Z
cryptocat
<p>I am working on Cryptographic protocols. While I was doing a survey, I required some "Non-Interactive Zero Knowledge Proofs" (NIZK) which I can use.</p>

<p>I can only find transformations between different models of NIZK in the abstract sense, like the Hidden Bits Model (J.Katz) and non-malleable NIZK (A.Sahai)</p>

<p>Is there any credible material like Thesis/Papers where I can find example constructions of Non-Interactive Zero Knowledge Proofs which I can make use for my protocols.</p>

<p>Thanks!</p>

CC BY-SA 3.0
2011-09-08T16:39:00.150Z
Can you modify the title so that it matches your question more clearly?  You are specifically asking about NIZK, not general ZK.
Tsuyoshi Ito
CC BY-SA 3.0
2011-09-08T16:55:34.253Z
@Tsuyoshi I edited it as per your suggestion.
Suresh Venkat
<reference-request><cr.crypto-security><zero-knowledge>
Instances of Noninteractive Zero knowlege Proofs
Maverickgugu
# Instances of Noninteractive Zero knowlege Proofs

(Asked by: username_0 on 2011-09-08)

I am working on Cryptographic protocols. While I was doing a survey, I required some "Non-Interactive Zero Knowledge Proofs" (NIZK) which I can use.

I can only find transformations between different models of NIZK in the abstract sense, like the Hidden Bits Model (J.Katz) and non-malleable NIZK (A.Sahai)

Is there any credible material like Thesis/Papers where I can find example constructions of Non-Interactive Zero Knowledge Proofs which I can make use for my protocols.

Thanks!

**Tags:** reference-request, cr.crypto-security, zero-knowledge
> **Comments:**
> **username_1**: Can you modify the title so that it matches your question more clearly?  You are specifically asking about NIZK, not general ZK.  
> **username_2**: @Tsuyoshi I edited it as per your suggestion.  

---

## 2 answers

### Answer by username_3 on 2011-10-12. Score: 4

I'm not sure what exactly you are looking for.

Goldreich's book ("Foundations of Cryptography, volume 1") contains an extensive discussion of non-interactive ZK proofs. So do these lecture notes of Katz (lectures 11-13): <http://www.cs.umd.edu/~jkatz/gradcrypto2/scribes.html>.

You could also look at this paper: Uriel Feige, Dror Lapidot, Adi Shamir: Multiple NonInteractive Zero Knowledge Proofs Under General Assumptions. SIAM J. Comput. 29(1): 1-28 (1999) and references therein.


---

### Answer by username_4 on 2013-03-10. Score: 2

The most famous "efficient" NIZK is by Groth and Sahai:

Jens Groth, Amit Sahai
Efficient Non-interactive Proof Systems for Bilinear Groups, Eurocrypt 2008

If you are willing to use stronger security assumptions, you can get even better efficiency. See the following paper of Groth (and subsequent improvements by other people), for example:

Jens Groth
Short Pairing-Based Non-interactive Zero-Knowledge Arguments, Asiacrypt 2010


---

