Can Statistical Zero Knowledge be made Non-Interactive? or On the Relationship of SZK and NISZK
The Harvard community has made this article openly available. Please share how this access benefits you. Your story matters
Citation Goldreich, Odedm Amit Sahai, and Salil Vadhan. 1999. Can statistical zero-knowledge be made non-interactive?, or On the relationship of SZK and NISZK. In Advances in cryptology-CRYPTO `99: Proceedings of the 19th Annual International Cryptology Conference, August 15-19, 1999, Santa Barbara, California, ed. M. Wiener, 467-484. Berlin, Heidelberg: Springer-Verlag. Lecture Notes in Computer Science, 1666: 467-484.
Published Version http://dx.doi.org/10.1007/3-540-48405-1_30;http:// dx.doi.org/10.1007/3-540-48405-1
Citable link http://nrs.harvard.edu/urn-3:HUL.InstRepos:4728400
Terms of Use This article was downloaded from Harvard University’s DASH repository, and is made available under the terms and conditions applicable to Other Posted Material, as set forth at http:// nrs.harvard.edu/urn-3:HUL.InstRepos:dash.current.terms-of- use#LAA
Can Statistical Zero Knowledge b e made Non Interactive
or