Zero Knowledge and Soundness Are Symmetric
- 2k Downloads
We give a complexity-theoretic characterization of the class of problems in NP having 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 ∩ coNP having zero-knowledge arguments is closed under complement. Furthermore, we show that a problem in NP has a statistical zero-knowledge argument system if and only if its complement has a computational zero-knowledge proof system. 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 NP having 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.
KeywordsCommitment Scheme Argument System Knowledge Argument Promise Problem Zero Knowledge
- [Gol2]Goldreich, O.: On promise problems (a survey in memory of Shimon Even [1935-2004]). Technical Report TR05–018, ECCC (2005)Google Scholar
- [GSV]Goldreich, O., Sahai, A., Vadhan, S.: Honest verifier statistical zero-knowledge equals general statistical zero-knowledge. In: Proc. 30th STOC, pp. 399–408 (1998)Google Scholar
- [GV]Goldreich, O., Vadhan, S.: Comparing entropies in statistical zero-knowledge with applications to the structure of SZK. In: Proc. 14th Comput. Complex., pp. 54–73 (1999)Google Scholar
- [HORV]Haitner, I., Ong, S., Reingold, O., Vadhan, S.: Instance-dependent commitments for statistical zero-knowledge proofs. In: preparation (March 2007)Google Scholar
- [HR]Haitner, I., Reingold, O.: Statistically-hiding commitment from any one-way function. Technical Report 2006/436, Cryptol. ePrint Arch (2006)Google Scholar
- [IL]Impagliazzo, R., Luby, M.: One-way functions are essential for complexity based cryptography. In: Proc. 30th FOCS, pp. 230–235 (1989)Google Scholar
- [NOV]Nguyen, M., Ong, S., Vadhan, S.: Statistical zero-knowledge arguments for NP from any one-way function. In: Proc. 47th FOCS, pp. 3–14 (2006)Google Scholar
- [NV]Nguyen, M., Vadhan, S.: Zero knowledge with efficient provers. In: Proc. 38th STOC, pp. 287–295 (2006)Google Scholar
- [Ost]Ostrovsky, R.: One-way functions, hard on average problems, and statistical zero-knowledge proofs. In: Proc. 6th Annual Structure in Complexity Theory Conference, pp. 133–138 (1991)Google Scholar
- [OV]Ong, S., Vadhan, S.: Zero knowledge and soundness are symmetric. Technical Report TR06-139, ECCC (2006)Google Scholar
- [OW]Ostrovsky, R., Wigderson, A.: One-way functions are essential for non-trivial zero-knowledge. In: Proc. 2nd Israel Symposium on Theory of Computing Systems, pp. 3–17 (1993)Google Scholar