The complexity of promise problems with applications to public-key cryptography
Information and Control
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
Statistical zero-knowledge languages can be recognized in two rounds
Journal of Computer and System Sciences
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
On relationships between statistical zero-knowledge proofs
Journal of Computer and System Sciences
Foundations of Cryptography: Basic Tools
Foundations of Cryptography: Basic Tools
A complete problem for statistical zero knowledge
Journal of the ACM (JACM)
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
Zero knowledge with efficient provers
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Elements of Information Theory (Wiley Series in Telecommunications and Signal Processing)
Elements of Information Theory (Wiley Series in Telecommunications and Signal Processing)
Statistical Zero-Knowledge Arguments for NP from Any One-Way Function
FOCS '06 Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science
An Unconditional Study of Computational Zero Knowledge
SIAM Journal on Computing
One-way functions are essential for complexity based cryptography
SFCS '89 Proceedings of the 30th Annual Symposium on Foundations of Computer Science
Design and Implementation of a Zero-Knowledge Authentication Framework for Java Card
International Journal of Information Security and Privacy
Hi-index | 0.00 |
We give a complexity-theoretic characterization of the class of problems in NPhaving zero-knowledge argument systems. This characterization is symmetric in its treatment of the zero knowledge and the soundness conditions, and thus we deduce that the class of problems in NP驴 coNPhaving zero-knowledge arguments is closed under complement. Furthermore, we show that a problem in NPhas a statisticalzero-knowledge argument system if and only if its complement has a computational zero-knowledge proofsystem. What is novel about these results is that they are unconditional, i.e., do not rely on unproven complexity assumptions such as the existence of one-way functions.Our characterization of zero-knowledge arguments also enables us to prove a variety of other unconditional results about the class of problems in NPhaving zero-knowledge arguments, such as equivalences between honest-verifier and malicious-verifier zero knowledge, private coins and public coins, inefficient provers and efficient provers, and non-black-box simulation and black-box simulation. Previously, such results were only known unconditionally for zero-knowledge proof systems, or under the assumption that one-way functions exist for zero-knowledge argument systems.