Which languages have 4-round zero-knowledge proofs?

Authors:
Jonathan Katz
Affiliations:
Department of Computer Science, University of Maryland
Venue:
TCC'08 Proceedings of the 5th conference on Theory of cryptography
Year:
2008

Citing 26
Cited 5

Does co-NP have short interactive proofs?

Information Processing Letters
A digital signature scheme secure against adaptive chosen-message attacks

SIAM Journal on Computing - Special issue on cryptography
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
The knowledge complexity of interactive proof systems

SIAM Journal on Computing
A discrete logarithm implementation of perfect zero-knowledge blobs

Journal of Cryptology
Perfect zero-knowledge in constant rounds

STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
The (true) complexity of statistical zero knowledge

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)
Round-optimal perfect zero-knowledge proofs

Information Processing Letters
On the Composition of Zero-Knowledge Proof Systems

SIAM Journal on Computing
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
Zero Knowledge Proofs of Knowledge in Two Rounds

CRYPTO '89 Proceedings of the 9th Annual International Cryptology Conference on Advances in Cryptology
On the Existence of 3-Round Zero-Knowledge Protocols

CRYPTO '98 Proceedings of the 18th Annual International Cryptology Conference on Advances in Cryptology
4 Move Perfect ZKIP of Knowledge with No Assumption

ASIACRYPT '91 Proceedings of the International Conference on the Theory and Applications of Cryptology: Advances in Cryptology
On the Complexity of Constant Round ZKIP of Possession of Knowledge

ASIACRYPT '91 Proceedings of the International Conference on the Theory and Applications of Cryptology: Advances in Cryptology
Efficient Zero-Knowledge Proofs of Knowledge Without Intractability Assumptions

PKC '00 Proceedings of the Third International Workshop on Practice and Theory in Public Key Cryptography: Public Key Cryptography
How to Go Beyond the Black-Box Simulation Barrier

FOCS '01 Proceedings of the 42nd IEEE symposium on Foundations of Computer Science
A study of statistical zero-knowledge proofs

A study of statistical zero-knowledge proofs
Strict Polynomial-Time in Simulation and Extraction

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

Journal of Computer and System Sciences - Special issue on FOCS 2003
Statistically-hiding commitment from any one-way function

Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
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
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

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

LATINCRYPT'10 Proceedings of the First international conference on Progress in cryptology: cryptology and information security in Latin America
(Nearly) round-optimal black-box constructions of commitments secure against selective opening attacks

TCC'11 Proceedings of the 8th conference on Theory of cryptography
The knowledge tightness of parallel zero-knowledge

TCC'12 Proceedings of the 9th international conference on Theory of Cryptography
On the Composition of Public-Coin Zero-Knowledge Protocols

SIAM Journal on Computing
A unified framework for UC from only OT

ASIACRYPT'12 Proceedings of the 18th international conference on The Theory and Application of Cryptology and Information Security

Quantified Score

Hi-index	0.00

Visualization

Abstract

We show that if a language L has a 4-round, black-box, computational zero-knowledge proof system with negligible soundness error, then L ∈ MA. Assuming the polynomial hierarchy does not collapse, this means in particular that NP-complete languages do not have 4-round zero-knowledge proofs (at least with respect to black-box simulation).