@conference {641322,
	title = {An equivalence between zero knowledge and commitments.},
	booktitle = {R. Canetti, editor, Proceedings of the Third Theory of Cryptography Conference (TCC {\textquoteleft}08)},
	volume = {4948},
	year = {2008},
	pages = {482-500},
	publisher = {Springer Verlag, Lecture Notes in Computer Science},
	organization = {Springer Verlag, Lecture Notes in Computer Science},
	abstract = {
	We show that a language in NP has a zero-knowledge protocol if and only if the language has an {\textquotedblleft}instance-dependent{\textquotedblright} commitment scheme. An instance-dependent commitment schemes for a given language is a commitment scheme that can depend on an instance of the language, and where the hiding and binding properties are required to hold only on the yes and no instances of the language, respectively.



	The novel direction is the\&nbsp;only if\&nbsp;direction. Thus, we confirm the widely held belief that commitments are not only sufficient for zero knowledge protocols, but\&nbsp;necessary\&nbsp;as well. Previous results of this type either held only for restricted types of protocols or languages, or used nonstandard relaxations of (instance-dependent) commitment schemes.

},
	url = {https://link.springer.com/chapter/10.1007/978-3-540-78524-8_27},
	author = {Shien Jin Ong and Salil Vadhan}
}
