## CryptoDB

### Paper: Interactive and Noninteractive Zero Knowledge are Equivalent in the Help Model

Authors: André Chailloux Dragos Florin Ciocan Iordanis Kerenidis Salil P. Vadhan URL: http://eprint.iacr.org/2007/467 Search ePrint Search Google We show that interactive and noninteractive zero-knowledge are equivalent in the help model' of Ben-Or and Gutfreund ({\em J. Cryptology}, 2003). In this model, the shared reference string is generated by a probabilistic polynomial-time dealer who is given access to the statement to be proven. Our results do not rely on any unproven complexity assumptions and hold for statistical zero knowledge, for computational zero knowledge restricted to AM, and for quantum zero knowledge when the help is a pure quantum state.
##### BibTeX
@misc{eprint-2007-13747,
title={Interactive and Noninteractive Zero Knowledge are Equivalent in the Help Model},
booktitle={IACR Eprint archive},
keywords={cryptography, computational complexity, noninteractive zero-knowledge proofs, commitment schemes, Arthur-Merlin games, quantum zero knowledge},
url={http://eprint.iacr.org/2007/467},
note={A shorter version was sent at TCC'08 andre.chailloux@ens-lyon.fr 13860 received 13 Dec 2007},
author={André Chailloux and Dragos Florin Ciocan and Iordanis Kerenidis and Salil P. Vadhan},
year=2007
}
`