Can Statistical Zero Knowledge Be Made Non-interactive? or On the Relationship of SZK and NISZK
Can Statistical Zero Knowledge Be Made Non-interactive? or On the Relationship of SZK and NISZK
Oded Goldreich,A. Sahai,S. Vadhan
1998 · DOI: 10.1007/3-540-48405-1_30
Annual International Cryptology Conference · 99 Citations
TLDR
The main tools in the analysis are two promise problems that are natural restrictions of promise problems known to be complete for SZK that are in fact complete for NISZK, and using this relationship the results comparing the two classes are derived.