Image Density is Complete for Non-Interactive-SZK (Extended Abstract)
暂无分享,去创建一个
[1] Lance Fortnow,et al. The Complexity of Perfect Zero-Knowledge , 1987, Proceeding Structure in Complexity Theory.
[2] Amit Sahai,et al. A complete promise problem for statistical zero-knowledge , 1997, Proceedings 38th Annual Symposium on Foundations of Computer Science.
[3] Moti Yung,et al. Direct Minimum-Knowledge Computations , 1987, CRYPTO.
[4] Rafail Ostrovsky,et al. One-way functions are essential for non-trivial zero-knowledge , 1993, [1993] The 2nd Israel Symposium on Theory and Computing Systems.
[5] Silvio Micali,et al. Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems , 1991, JACM.
[6] Manuel Blum,et al. Noninteractive Zero-Knowledge , 1991, SIAM J. Comput..
[7] Russell Impagliazzo,et al. How to recycle random bits , 1989, 30th Annual Symposium on Foundations of Computer Science.
[8] Mihir Bellare,et al. Knowledge on the average—perfect, statistical and logarithmic , 1995, STOC '95.
[9] GoldreichOded,et al. Definitions and properties of zero-knowledge proof systems , 1994 .
[10] S. Micali,et al. Non-Interactive Zero Knowledge , 1990 .
[11] Shafi Goldwasser,et al. Private coins versus public coins in interactive proof systems , 1986, STOC '86.
[12] Giovanni Di Crescenzo,et al. The Knowledge Complexity of Quadratic Residuosity Languages , 1994, Theor. Comput. Sci..
[13] László Babai,et al. Arthur-Merlin Games: A Randomized Proof System, and a Hierarchy of Complexity Classes , 1988, J. Comput. Syst. Sci..
[14] Silvio Micali,et al. The knowledge complexity of interactive proof-systems , 1985, STOC '85.
[15] Larry Carter,et al. Universal Classes of Hash Functions , 1979, J. Comput. Syst. Sci..
[16] Michael Sipser,et al. A complexity theoretic approach to randomness , 1983, STOC.
[17] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[18] Giovanni Di Crescenzo,et al. On monotone formula closure of SZK , 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.
[19] Leonid A. Levin,et al. A Pseudorandom Generator from any One-way Function , 1999, SIAM J. Comput..
[20] Silvio Micali,et al. Everything Provable is Provable in Zero-Knowledge , 1990, CRYPTO.
[21] Tatsuaki Okamoto,et al. On relationships between statistical zero-knowledge proofs , 1996, STOC '96.
[22] Johan Håstad,et al. Statistical Zero-Knowledge Languages can be Recognized in Two Rounds , 1991, J. Comput. Syst. Sci..
[23] Giovanni Di Crescenzo,et al. Randomness-Efficient Non-Interactive Zero-Knowledge (Extended Abstract) , 1997, ICALP.
[24] Moni Naor,et al. Public-key cryptosystems provably secure against chosen ciphertext attacks , 1990, STOC '90.