@conference {643262,
	title = {Statistical zero-knowledge arguments for NP from any one-way function},
	booktitle = {Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS {\textquoteleft}06)},
	year = {2006},
	pages = {3-13},
	publisher = {IEEE},
	organization = {IEEE},
	abstract = {
	Version History:\&nbsp;Merged with STOC {\textquoteright}07 paper of Haitner and Reingold. Also available as a journal version. Full version invited to SIAM J. Computing Special Issue on FOCS {\textquoteleft}06



	We show that every language in NP has a statistical zero-knowledge argument system under the (minimal) complexity assumption that one-way functions exist. In such protocols, even a computationally unbounded verifier cannot learn anything other than the fact that the assertion being proven is true, whereas a polynomial-time prover cannot convince the verifier to accept a false assertion except with negligible probability. This resolves an open question posed by Naor et al. (1998). Departing from previous works on this problem, we do not construct standard statistically hiding commitments from any one-way function. Instead, we construct a relaxed variant of commitment schemes called "1-out-of-2-binding commitments," recently introduced by Nguyen et al. (2006)

},
	url = {https://ieeexplore.ieee.org/document/4031338},
	author = {Minh-Huyen Nguyen and Shien Jin Ong and Salil Vadhan}
}
