An equivalence between zero knowledge and commitments
SJ Ong, S Vadhan - Theory of Cryptography: Fifth Theory of Cryptography …, 2008 - Springer
We show that a language in NP has a zero-knowledge protocol if and only if the language
has an “instance-dependent” commitment scheme. An instance-dependent commitment …
has an “instance-dependent” commitment scheme. An instance-dependent commitment …
Interactive and noninteractive zero knowledge are equivalent in the help model
We show that interactive and noninteractive zero-knowledge are equivalent in the 'help
model'of Ben-Or and Gutfreund (J. Cryptology, 2003). In this model, the shared reference …
model'of Ben-Or and Gutfreund (J. Cryptology, 2003). In this model, the shared reference …
Interactive and noninteractive zero knowledge coincide in the help model
We show that a problem in $\AM $ has a interactive zero-knowledge proof system {\em if and
only if} it has a noninteractive zero knowledge proof system in thehelp model'of Ben-Or and …
only if} it has a noninteractive zero knowledge proof system in thehelp model'of Ben-Or and …