The Community for Technology Leaders
Proceedings 38th Annual Symposium on Foundations of Computer Science (1997)
Miami Beach, FL
Oct. 19, 1997 to Oct. 22, 1997
ISSN: 0272-5428
ISBN: 0-8186-8197-7
pp: 448
Amit Sahai , Massachusetts Institute of Technology
Salil Vadhan , Massachusetts Institute of Technology
We present a complete promise problem for SZK, the class of languages possessing statistical zero-knowledge proofs (against an honest verifier). The problem is to decide whether two efficiently samplable distributions are either statistically close or far apart. This characterizes SZK with no reference to interaction or zero-knowledge. From this theorem and its proof, we are able to establish several other results about SZK, knowledge complexity, and efficiently samplable distributions.

S. Vadhan and A. Sahai, "A Complete Promise Problem for Statistical Zero-Knowledge," Proceedings 38th Annual Symposium on Foundations of Computer Science(FOCS), Miami Beach, FL, 1997, pp. 448.
84 ms
(Ver 3.3 (11022016))