Zero knowledge with efficient provers
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Foundations of cryptography: a primer
Foundations and Trends® in Theoretical Computer Science
Adaptive Zero-Knowledge Proofs and Adaptively Secure Oblivious Transfer
TCC '09 Proceedings of the 6th Theory of Cryptography Conference on Theory of Cryptography
How to achieve perfect simulation and a complete problem for non-interactive perfect zero-knowledge
TCC'08 Proceedings of the 5th conference on Theory of cryptography
Unconditional characterizations of non-interactive zero-knowledge
CRYPTO'05 Proceedings of the 25th annual international conference on Advances in Cryptology
Theoretical Computer Science
Concurrent zero knowledge without complexity assumptions
TCC'06 Proceedings of the Third conference on Theory of Cryptography
TCC'06 Proceedings of the Third conference on Theory of Cryptography
A characterization of non-interactive instance-dependent commitment-schemes (NIC)
ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
Design and Implementation of a Zero-Knowledge Authentication Framework for Java Card
International Journal of Information Security and Privacy
| Hi-index | 0.00 |
We prove a number of general theorems about CZK, the class of problems possessing computational zero knowledge proofs. Our results are unconditional, in contrast to most previous works on CZK which rely on the assumption that one-way functions exist. We establish several new characterizations ofCZK, and use these characterizations to prove results such as: 1. Honest-verifier CZK equals general CZK. 2. Public-coin CZK equals private-coin CZK. 3. CZK is closed under union (and more generally, "monotone formula closure"). 4. CZK with imperfect completeness equals CZK with perfect completeness. 5. Any problem in CZK 驴 NP can be proven in computational zero knowledge by a BPP^NP prover. 6. CZK with black-box simulators equals CZK with general, non-black-box simulators. The above equalities refer to the resulting class of problems (and do not necessarily preserve other efficiency measures such as round complexity). Our approach is to combine the conditional techniques previously used in the study of CZK with the unconditional techniques developed in the study of SZK, the class of problems possessing statistical zero knowledge proofs. To enable this combination, we prove that every problem in CZK can be decomposed into a a problem in SZK together with a set of instances from which a one-way function can be constructed.