On the round complexity of zero-knowledge proofs based on one-way permutations

Authors:
S. Dov Gordon;Hoeteck Wee;David Xiao;Arkady Yerukhimovich
Affiliations:
Dept. of Computer Science, University of Maryland, College Park, MD;Dept. of Computer Science, Queens College, CUNY, Flushing NY;LRI, Université Paris-Sud, Orsay Cedex, France;Dept. of Computer Science, University of Maryland, College Park, MD
Venue:
LATINCRYPT'10 Proceedings of the First international conference on Progress in cryptology: cryptology and information security in Latin America
Year:
2010

Citing 25
Cited 0

The complexity of perfect zero-knowledge

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

SIAM Journal on Computing
Limits on the provable consequences of one-way permutations

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
Everything in NP can be argued in perfect zero-knowledge in a bounded number of rounds (extended abstract)

EUROCRYPT '89 Proceedings of the workshop on the theory and application of cryptographic techniques on Advances in cryptology
Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems

Journal of the ACM (JACM)
On the Composition of Zero-Knowledge Proof Systems

SIAM Journal on Computing
A Pseudorandom Generator from any One-way Function

SIAM Journal on Computing
Strict polynomial-time in simulation and extraction

STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
On the Existence of 3-Round Zero-Knowledge Protocols

CRYPTO '98 Proceedings of the 18th Annual International Cryptology Conference on Advances in Cryptology
How to Go Beyond the Black-Box Simulation Barrier

FOCS '01 Proceedings of the 42nd IEEE symposium on Foundations of Computer Science
Foundations of Cryptography: Volume 2, Basic Applications

Foundations of Cryptography: Volume 2, Basic Applications
Bounds on the Efficiency of Generic Cryptographic Constructions

SIAM Journal on Computing
Lower bounds for non-black-box zero knowledge

Journal of Computer and System Sciences - Special issue on FOCS 2003
Parallel Repetition of Zero-Knowledge Proofs and the Possibility of Basing Cryptography on NP-Hardness

CCC '06 Proceedings of the 21st Annual IEEE Conference on Computational Complexity
Polylogarithmic-round interactive proofs for coNP collapse the exponential hierarchy

Theoretical Computer Science
Finding Collisions in Interactive Protocols - A Tight Lower Bound on the Round Complexity of Statistically-Hiding Commitments

FOCS '07 Proceedings of the 48th Annual IEEE Symposium on Foundations of Computer Science
Black-Box Constructions of Two-Party Protocols from One-Way Functions

TCC '09 Proceedings of the 6th Theory of Cryptography Conference on Theory of Cryptography
Inaccessible entropy

Proceedings of the forty-first annual ACM symposium on Theory of computing
Round-optimal zero-knowledge arguments based on any one-way function

EUROCRYPT'97 Proceedings of the 16th annual international conference on Theory and application of cryptographic techniques
One-way permutations, interactive hashing and statistically hiding commitments

TCC'07 Proceedings of the 4th conference on Theory of cryptography
Which languages have 4-round zero-knowledge proofs?

TCC'08 Proceedings of the 5th conference on Theory of cryptography
A New Sampling Protocol and Applications to Basing Cryptographic Primitives on the Hardness of NP

CCC '10 Proceedings of the 2010 IEEE 25th Annual Conference on Computational Complexity
Private coins versus public coins in zero-knowledge proof systems

TCC'10 Proceedings of the 7th international conference on Theory of Cryptography

Quantified Score

Hi-index	0.01

Visualization

Abstract

We consider the following problem: canwe construct constant-round zero-knowledge proofs (with negligible soundness) for NP assuming only the existence of one-way permutations? We answer the question in the negative for fully black-box constructions (using only black-box access to both the underlying primitive and the cheating verifier) that satisfy a natural restriction on the "adaptivity" of the simulator's queries. Specifically, we show that only languages in coAM have constant-round zero-knowledge proofs of this kind. We also give strong evidence that we are unlikely to find fully black-box constructions of constant-round zero knowledge proofs for NP, even without this restriction on adaptivity.