Perfect Non-Interactive Zero Knowledge for NP
暂无分享,去创建一个
[1] Manuel Blum,et al. Noninteractive Zero-Knowledge , 1991, SIAM J. Comput..
[2] Jens Groth,et al. Cryptography in Subgroups of Zn , 2005, TCC.
[3] Rafael Pass,et al. On Deniability in the Common Reference String and Random Oracle Model , 2003, CRYPTO.
[4] Moni Naor,et al. Nonmalleable Cryptography , 2000, SIAM Rev..
[5] Ke Yang,et al. On Simulation-Sound Trapdoor Commitments , 2004, EUROCRYPT.
[6] Dan Boneh,et al. Evaluating 2-DNF Formulas on Ciphertexts , 2005, TCC.
[7] David Chaum,et al. Minimum Disclosure Proofs of Knowledge , 1988, J. Comput. Syst. Sci..
[8] Rafail Ostrovsky,et al. One-way functions, hard on average problems, and statistical zero-knowledge proofs , 1991, [1991] Proceedings of the Sixth Annual Structure in Complexity Theory Conference.
[9] Yehuda Lindell,et al. Universally composable two-party and multi-party secure computation , 2002, STOC '02.
[10] Rafail Ostrovsky,et al. Computational Complexity and Knowledge Complexity , 1994, Electron. Colloquium Comput. Complex..
[11] Giovanni Di Crescenzo,et al. Randomness-Optimal Characterization of Two NP Proof Systems , 2002, RANDOM.
[12] Joe Kilian,et al. An Efficient Noninteractive Zero-Knowledge Proof System for NP with General Assumptions , 1998, Journal of Cryptology.
[13] Adi Shamir,et al. Multiple NonInteractive Zero Knowledge Proofs Under General Assumptions , 1999, SIAM J. Comput..
[14] Moni Naor,et al. Non-malleable cryptography , 1991, STOC '91.
[15] Leonid A. Levin,et al. A hard-core predicate for all one-way functions , 1989, STOC '89.
[16] Amit Sahai,et al. Can Statistical Zero Knowledge Be Made Non-interactive? or On the Relationship of SZK and NISZK , 1998, CRYPTO.
[17] Ran Canetti,et al. Universally composable security: a new paradigm for cryptographic protocols , 2001, Proceedings 2001 IEEE International Conference on Cluster Computing.
[18] Lance Fortnow,et al. The Complexity of Perfect Zero-Knowledge , 1987, Proceeding Structure in Complexity Theory.
[19] Manuel Blum,et al. Non-interactive zero-knowledge and its applications , 1988, STOC '88.
[20] Abhi Shelat,et al. Unconditional Characterizations of Non-interactive Zero-Knowledge , 2005, CRYPTO.
[21] Ivan Damgård,et al. Non-interactive and reusable non-malleable commitment schemes , 2003, STOC '03.
[22] Juan A. Garay,et al. Strengthening Zero-Knowledge Protocols Using Signatures , 2003, EUROCRYPT.
[23] Johan Håstad,et al. Perfect zero-knowledge languages can be recognized in two rounds , 1987, 28th Annual Symposium on Foundations of Computer Science (sfcs 1987).
[24] Giovanni Di Crescenzo,et al. Image Density is Complete for Non-Interactive-SZK (Extended Abstract) , 1998, ICALP.
[25] Rafail Ostrovsky,et al. Efficient and Non-interactive Non-malleable Commitment , 2001, EUROCRYPT.
[26] Adi Shamir,et al. Multiple non-interactive zero knowledge proofs based on a single random string , 1990, Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science.
[27] SahaiAmit,et al. A complete problem for statistical zero knowledge , 2003 .
[28] Ivan Damgård,et al. Non-Interactive Circuit Based Proofs and Non-Interactive Perfect Zero-knowledge with Proprocessing , 1992, EUROCRYPT.
[29] Amit Sahai,et al. Non-malleable non-interactive zero knowledge and adaptive chosen-ciphertext security , 1999, 40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039).
[30] Lance Fortnow. The Complexity of Perfect Zero-Knowledge (Extended Abstract) , 1987, STOC 1987.
[31] Rafail Ostrovsky,et al. Robust Non-interactive Zero Knowledge , 2001, CRYPTO.
[32] Gilles Brassard,et al. Non-transitive transfer of confidence: A perfect zero-knowledge interactive protocol for SAT and beyond , 1986, 27th Annual Symposium on Foundations of Computer Science (sfcs 1986).
[33] Rafail Ostrovsky,et al. Non-interactive and non-malleable commitment , 1998, STOC '98.
[34] Giovanni Di Crescenzo,et al. Non-Interactive Zero-Knowledge: A Low-Randomness Characterization of NP , 1999, ICALP.