You Can Prove So Many Things in Zero-Knowledge

We present a short survey of known notions of zero- knowledge proof systems in the interactive model and main results about these notions. We then introduce a new notion,an extension of proofs of knowledge,which we call Proofs of Non-Zero Knowledge, as they allow a prover to convince a verifier that he knows a secret satisfying some relation, without revealing any new information about the secret or even the relation that the secret satifies with the common input. We prove a number of basic results about proofs of non-zero knowledge, and, in the process, revisit previously studied protocols, described as ‘proofs of partial knowledge’, which are particular cases of proofs of non-zero knowledge.

[1]  Silvio Micali,et al.  Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems , 1991, JACM.

[2]  Silvio Micali,et al.  Everything Provable is Provable in Zero-Knowledge , 1990, CRYPTO.

[3]  Giovanni Di Crescenzo,et al.  Zero-knowledge proofs of decision power: new protocols and optimal round-complexity , 1997, ICICS.

[4]  Amos Fiat,et al.  Zero-knowledge proofs of identity , 1987, Journal of Cryptology.

[5]  Ivan Damgård,et al.  Proofs of Partial Knowledge and Simplified Design of Witness Hiding Protocols , 1994, CRYPTO.

[6]  Tatsuaki Okamoto,et al.  Advances in Cryptology — ASIACRYPT 2000 , 2000, Lecture Notes in Computer Science.

[7]  Juan A. Garay,et al.  Concurrent oblivious transfer , 2000, Proceedings 41st Annual Symposium on Foundations of Computer Science.

[8]  Matthew K. Franklin,et al.  Multi-Autority Secret-Ballot Elections with Linear Work , 1996, EUROCRYPT.

[9]  Yunlei Zhao,et al.  Some Observations on Zap and Its Applications , 2004, ACNS.

[10]  Giovanni Di Crescenzo,et al.  On monotone formula closure of SZK , 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.

[11]  Lance Fortnow,et al.  The Complexity of Perfect Zero-Knowledge , 1987, Proceeding Structure in Complexity Theory.

[12]  Ivan Damgård,et al.  Efficient Zero-Knowledge Proofs of Knowledge Without Intractability Assumptions , 2000, Public Key Cryptography.

[13]  Giovanni Di Crescenzo,et al.  Security-preserving hardness-amplification for any regular one-way function , 1999, STOC '99.

[14]  Toshiya Itoh,et al.  A language-dependent cryptographic primitive , 1997, Journal of Cryptology.

[15]  Matthew K. Franklin,et al.  Commital Deniable Proofs and Electronic Campaign Finance , 2000, ASIACRYPT.

[16]  Arto Salomaa,et al.  Public-Key Cryptography , 1991, EATCS Monographs on Theoretical Computer Science.

[17]  Adi Shamir,et al.  IP = PSPACE , 1992, JACM.

[18]  Yvo Desmedt,et al.  Advances in Cryptology — CRYPTO ’94 , 2001, Lecture Notes in Computer Science.

[19]  Giovanni Di Crescenzo,et al.  On zero-knowledge proofs (extended abstract): “from membership to decision” , 2000, STOC '00.

[20]  David Chaum,et al.  Minimum Disclosure Proofs of Knowledge , 1988, J. Comput. Syst. Sci..

[21]  Mihir Bellare,et al.  On Defining Proofs of Knowledge , 1992, CRYPTO.

[22]  Amos Fiat,et al.  How to Prove Yourself: Practical Solutions to Identification and Signature Problems , 1986, CRYPTO.

[23]  Moti Yung,et al.  Zero-Knowledge Proofs of Computational Power (Extended Summary) , 1989, EUROCRYPT.

[24]  Andrew Odlyzko,et al.  Advances in Cryptology — CRYPTO’ 86 , 2000, Lecture Notes in Computer Science.

[25]  Oded Goldreich,et al.  Universal arguments and their applications , 2002, Proceedings 17th IEEE Annual Conference on Computational Complexity.

[26]  Stathis Zachos,et al.  Does co-NP Have Short Interactive Proofs? , 1987, Inf. Process. Lett..

[27]  Martin Tompa,et al.  Random self-reducibility and zero knowledge interactive proofs of possession of information , 1987, 28th Annual Symposium on Foundations of Computer Science (sfcs 1987).

[28]  Giovanni Di Crescenzo,et al.  Secret Sharing and Perfect Zero Knowledge , 1994, CRYPTO.

[29]  Boaz Barak,et al.  How to go beyond the black-box simulation barrier , 2001, Proceedings 2001 IEEE International Conference on Cluster Computing.

[30]  Moti Yung,et al.  Direct Minimum-Knowledge Computations , 1987, CRYPTO.

[31]  Moti Yung,et al.  Minimum-Knowledge Interactive Proofs for Decision Problems , 1989, SIAM J. Comput..

[32]  Silvio Micali,et al.  The Knowledge Complexity of Interactive Proof Systems , 1989, SIAM J. Comput..