On NC1 Boolean Circuit Composition of Non-interactive Perfect Zero-Knowledge
暂无分享,去创建一个
[1] Lance Fortnow,et al. The Complexity of Perfect Zero-Knowledge , 1987, Proceeding Structure in Complexity Theory.
[2] Giovanni Di Crescenzo,et al. Secret Sharing and Perfect Zero Knowledge , 1994, CRYPTO.
[3] Manuel Blum,et al. Non-interactive zero-knowledge and its applications , 1988, STOC '88.
[4] Giovanni Di Crescenzo,et al. On monotone formula closure of SZK , 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.
[5] Silvio Micali,et al. The Knowledge Complexity of Interactive Proof Systems , 1989, SIAM J. Comput..
[6] Tal Rabin,et al. An efficient non-interactive statistical zero-knowledge proof system for quasi-safe prime products , 1998, CCS '98.
[7] Silvio Micali,et al. Everything Provable is Provable in Zero-Knowledge , 1990, CRYPTO.
[8] Amos Fiat,et al. Zero-knowledge proofs of identity , 1988, Journal of Cryptology.
[9] Silvio Micali,et al. Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems , 1991, JACM.
[10] 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).
[11] Oded Goldreich,et al. Definitions and properties of zero-knowledge proof systems , 1994, Journal of Cryptology.
[12] Manuel Blum,et al. Noninteractive Zero-Knowledge , 1991, SIAM J. Comput..
[13] Giovanni Di Crescenzo,et al. The Knowledge Complexity of Quadratic Residuosity Languages , 1994, Theor. Comput. Sci..
[14] Carsten Lund,et al. Practical zero-knowledge proofs: Giving hints and using deficiencies , 1988, Journal of Cryptology.
[15] Joan Boyar,et al. Short Discrete Proofs , 1996, EUROCRYPT.
[16] Moti Yung,et al. Certifying Cryptographic Tools: The Case of Trapdoor Permutations , 1992, CRYPTO.
[17] Daniele Micciancio,et al. Statistical Zero-Knowledge Proofs with Efficient Provers: Lattice Problems and More , 2003, CRYPTO.
[18] Stathis Zachos,et al. Does co-NP Have Short Interactive Proofs? , 1987, Inf. Process. Lett..
[19] Moti Yung,et al. Direct Minimum-Knowledge Computations , 1987, CRYPTO.