Interactive and noninteractive zero knowledge are equivalent in the help model

Authors:
André Chailloux;Dragos Florin Ciocan;Iordanis Kerenidis;Salil Vadhan
Affiliations:
LRI, Université Paris-Sud, Orsay, France;School of Engineering and Applied Sciences, Harvard University, Cambridge, MA;LRI, Université Paris-Sud, Orsay, France;School of Engineering and Applied Sciences, Harvard University, Cambridge, MA
Venue:
TCC'08 Proceedings of the 5th conference on Theory of cryptography
Year:
2008

Citing 28
Cited 3

Arthur-Merlin games: a randomized proof system, and a hierarchy of complexity class

Journal of Computer and System Sciences - 17th Annual ACM Symposium in the Theory of Computing, May 6-8, 1985
Minimum disclosure proofs of knowledge

Journal of Computer and System Sciences - 27th IEEE Conference on Foundations of Computer Science October 27-29, 1986
Non-interactive zero-knowledge and its applications

STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
The knowledge complexity of interactive proof systems

SIAM Journal on Computing
Pseudo-random generation from one-way functions

STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Perfect zero-knowledge in constant rounds

STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
Statistical zero-knowledge languages can be recognized in two rounds

Journal of Computer and System Sciences
Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems

Journal of the ACM (JACM)
Noninteractive zero-knowledge

SIAM Journal on Computing
Algebraic methods for interactive proof systems

Journal of the ACM (JACM)
IP = PSPACE

Journal of the ACM (JACM)
Honest-verifier statistical zero-knowledge equals general statistical zero-knowledge

STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
A Pseudorandom Generator from any One-way Function

SIAM Journal on Computing
Multiple NonInteractive Zero Knowledge Proofs Under General Assumptions

SIAM Journal on Computing
Parallelization, amplification, and exponential time simulation of quantum interactive proof systems

STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
On relationships between statistical zero-knowledge proofs

Journal of Computer and System Sciences
A complete problem for statistical zero knowledge

Journal of the ACM (JACM)
imits on the Power of Quantum Statistical Zero-Knowledge

FOCS '02 Proceedings of the 43rd Symposium on Foundations of Computer Science
Direct Minimum-Knowledge Computations

CRYPTO '87 A Conference on the Theory and Applications of Cryptographic Techniques on Advances in Cryptology
Everything Provable is Provable in Zero-Knowledge

CRYPTO '88 Proceedings of the 8th Annual International Cryptology Conference on Advances in Cryptology
Comparing Entropies in Statistical Zero Knowledge with Applications to the Structure of SZK

COCO '99 Proceedings of the Fourteenth Annual IEEE Conference on Computational Complexity
On the knowledge complexity of N P

FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science
Zero knowledge with efficient provers

Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Zero-knowledge against quantum attacks

Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
An Unconditional Study of Computational Zero Knowledge

SIAM Journal on Computing
On monotone formula closure of SZK

SFCS '94 Proceedings of the 35th Annual Symposium on Foundations of Computer Science
Unconditional characterizations of non-interactive zero-knowledge

CRYPTO'05 Proceedings of the 25th annual international conference on Advances in Cryptology
One-way secret-key agreement and applications to circuit polarization and immunization of public-key encryption

CRYPTO'05 Proceedings of the 25th annual international conference on Advances in Cryptology

Complete problem for perfect zero-knowledge quantum proof

SOFSEM'12 Proceedings of the 38th international conference on Current Trends in Theory and Practice of Computer Science
Resettable statistical zero knowledge

TCC'12 Proceedings of the 9th international conference on Theory of Cryptography
Witness encryption and its applications

Proceedings of the forty-fifth annual ACM symposium on Theory of computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

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 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.