You are looking at a specific version 20071219:135208 of this paper. See the latest version.

Paper 2007/467

Interactive and Noninteractive Zero Knowledge are Equivalent in the Help Model

André Chailloux and Dragos Florin Ciocan and Iordanis Kerenidis and Salil Vadhan

Abstract

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.

Metadata
Available format(s)
PDF PS
Publication info
Published elsewhere. A shorter version was sent at TCC'08
Keywords
cryptographycomputational complexitynoninteractive zero-knowledge proofscommitment schemesArthur-Merlin gamesquantum zero knowledge
Contact author(s)
andre chailloux @ ens-lyon fr
History
2007-12-19: received
Short URL
https://ia.cr/2007/467
License
Creative Commons Attribution
CC BY
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.