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

By Joe Kilian, Erez Petrank. 1995

How researchers see this paper

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

1. Benedikt Bünz
2. Dan Boneh
3. Jonathan Bootle
4. Gregory Maxwell
5. Andrew Poelstra
6. Pieter Wuille
7. Srinath T. V. Setty
8. Brent Waters

Citations in the corpus

• Bulletproofs: Short Proofs for Confidential Transactions and More (2018, background): “Many efficient non-interactive zero-knowledge proofs and arguments for arithmetic circuit satisfiability have been developed [Mic94,KP95,GS08,GGPR13,BSCG ` 13,BSBTHR18], and highly efficient protocols are known.”
• Foundations of Cryptography: Volume 1, Basic Tools (2001, unknown): “10, we mention that a much more efficient construction of non-interactive proof systems for NP , based on the same assumptions as [76], has appeared in [144].”