Abstract
We show that the class NISZK of languages that admit non-interactive statistical zero-knowledge proof system has a natural complete promise problem. This characterizes statistical zero-knowledge in the public random string model without reference to the public random string or to zero knowledge. Building on this result we are able to show structural properties of NISZK such as closure under OR composition and closure under complement.
Cite
CITATION STYLE
De Santis, A., Di Crescenzo, G., Persiano, G., & Yung, M. (1998). Image density is complete for non-interactive-SZK. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1443 LNCS, pp. 784–795). Springer Verlag. https://doi.org/10.1007/bfb0055102
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
