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

• 1 January 1998
• journal article
• research article
• Published by Springer Nature in Journal of Cryptology
• Vol. 11  (1) , 1-27
• https://doi.org/10.1007/s001459900032

Abstract

Keywords

• KEY WORDS. ONE-WAY PERMUTATIONS
• ZERO KNOWLEDGE
• EFFICIENT PROOFS
• NONINTERACTIVE ZERO KNOWLEDGE
• CIRCUIT SATISFIABILITY.