loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
38th Annual Symposium on Foundations of Computer Science (FOCS '97)
A Complete Promise Problem for Statistical Zero-Knowledge
Miami Beach, FL
October 19-October 22
ISBN: 0-8186-8197-7
ASCII Text
x 
 
Amit Sahai, Salil Vadhan, "A Complete Promise Problem for Statistical Zero-Knowledge," Foundations of Computer Science, IEEE Annual Symposium on, pp. 448, 38th Annual Symposium on Foundations of Computer Science (FOCS '97), 1997.
 
 
BibTex
x
 
@article{ 10.1109/SFCS.1997.646133,
author = {Amit Sahai and Salil Vadhan},
title = {A Complete Promise Problem for Statistical Zero-Knowledge},
journal ={Foundations of Computer Science, IEEE Annual Symposium on},
volume = {0},
year = {1997},
issn = {0272-5428},
pages = {448},
doi = {http://doi.ieeecomputersociety.org/10.1109/SFCS.1997.646133},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - CONF
JO - Foundations of Computer Science, IEEE Annual Symposium on
TI - A Complete Promise Problem for Statistical Zero-Knowledge
SN - 0272-5428
SP
EP
A1 - Amit Sahai,
A1 - Salil Vadhan,
PY - 1997
VL - 0
JA - Foundations of Computer Science, IEEE Annual Symposium on
ER -
 
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.
Citation:
Amit Sahai, Salil Vadhan, "A Complete Promise Problem for Statistical Zero-Knowledge," focs, pp.448, 38th Annual Symposium on Foundations of Computer Science (FOCS '97), 1997
Usage of this product signifies your acceptance of the Terms of Use.