An Efficient Noninteractive Zero-Knowledge Proof System for NP with General Assumptions

By Joe Kilian, Erez Petrank. 1998

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

1. Jens Groth
2. Srinath T. V. Setty
3. Eli Ben-Sasson
4. Helger Lipmaa
5. Benedikt Bünz
6. Justin Thaler
7. Riad S. Wahby
8. Michael Backes

Citations in the corpus

• Efficient Noninteractive Proof Systems for Bilinear Groups (2008, background): “[19,16,29,17], demonstrates that NIZK proofs exist for all of NP.”
• Simulation-Sound NIZK Proofs for a Practical Language and Constant Size Group Signatures (2006, background): “Feige, Lapidot and Shamir [25] and Kilian and Petrank [33] give constructions based on trapdoor permutations.”
• Short Pairing-Based Non-interactive Zero-Knowledge Arguments (2010, background): “For this reason there has been a lot of research into the underlying assumptions [19,2,28], the efficiency [13,15,33,27], and the security guarantees offered by NIZK proofs [16,38,14].”