@article {634728,
	title = {Statistically hiding commitments and statistical zero-knowledge arguments from any one-way function},
	journal = {SIAM Journal on Computing},
	volume = {39},
	number = {3},
	year = {2009},
	pages = {1153-1218},
	abstract = {
	Version History:\&nbsp;Special Issue on\&nbsp;STOC {\textquoteleft}07. Merge of papers from FOCS {\textquoteleft}06 and STOC {\textquoteleft}07. Received\&nbsp;SIAM Outstanding Paper Prize 2011.We give a construction of statistically hiding commitment schemes (those in which the hiding property holds against even computationally unbounded adversaries) under the minimal complexity assumption that one-way functions exist. Consequently, one-way functions suffice to give statistical zero-knowledge arguments for any NP statement (whereby even a computationally unbounded adversarial verifier learns nothing other than the fact that the assertion being proven is true, and no polynomial-time adversarial prover can convince the verifier of a false statement). These results resolve an open question posed by Naor et al. [J. Cryptology, 11 (1998), pp. 87{\textendash}108].

},
	url = {https://epubs.siam.org/doi/abs/10.1137/080725404},
	author = {Iftach Haitner and Nguyen, Minh and Shien Jin Ong and Omer Reingold and Salil Vadhan}
}
