Necessary and Sufficient Assumptions for Non-iterative Zero-Knowledge Proofs of Knowledge for All NP Relations
暂无分享,去创建一个
Giovanni Di Crescenzo | Alfredo De Santis | Giuseppe Persiano | A. D. Santis | G. Persiano | G. D. Crescenzo
[1] John Rompel,et al. One-way functions are necessary and sufficient for secure signatures , 1990, STOC '90.
[2] Leonid A. Levin,et al. A Pseudorandom Generator from any One-way Function , 1999, SIAM J. Comput..
[3] Eric Bach,et al. How to Generate Factored Random Numbers , 1988, SIAM J. Comput..
[4] Whitfield Diffie,et al. New Directions in Cryptography , 1976, IEEE Trans. Inf. Theory.
[5] Russell Impagliazzo,et al. Limits on the provable consequences of one-way permutations , 1988, STOC '89.
[6] Silvio Micali,et al. How to construct random functions , 1986, JACM.
[7] Moni Naor,et al. Bit commitment using pseudo-randomness (extended abstract) , 1989, CRYPTO 1989.
[8] Donald Beaver,et al. Adaptive zero knowledge and computational equivocation (extended abstract) , 1996, STOC '96.
[9] Rafail Ostrovsky,et al. Non-interactive and non-malleable commitment , 1998, STOC '98.
[10] Manuel Blum,et al. Noninteractive Zero-Knowledge , 1991, SIAM J. Comput..
[11] Rafail Ostrovsky,et al. On Concurrent Zero-Knowledge with Pre-processing , 1999, CRYPTO.
[12] Moni Naor,et al. Public-key cryptosystems provably secure against chosen ciphertext attacks , 1990, STOC '90.
[13] S. Micali,et al. Noninteractive Zero-Knowledge , 1990, SIAM J. Comput..
[14] Russell Impagliazzo,et al. One-way functions are essential for complexity based cryptography , 1989, 30th Annual Symposium on Foundations of Computer Science.
[15] Manuel Blum,et al. Non-interactive zero-knowledge and its applications , 1988, STOC '88.
[16] David Chaum,et al. Minimum Disclosure Proofs of Knowledge , 1988, J. Comput. Syst. Sci..
[17] Michael Luby,et al. How to Construct Pseudo-Random Permutations from Pseudo-Random Functions (Abstract) , 1986, CRYPTO.
[18] 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.
[19] Silvio Micali,et al. Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems , 1991, JACM.
[20] Moni Naor,et al. Universal one-way hash functions and their cryptographic applications , 1989, STOC '89.
[21] Jeffrey Shallit,et al. Algorithmic Number Theory , 1996, Lecture Notes in Computer Science.
[22] Alfredo De Santis,et al. Zero-knowledge proofs of knowledge without interaction , 1992, Proceedings., 33rd Annual Symposium on Foundations of Computer Science.
[23] Manuel Blum,et al. How to generate cryptographically strong sequences of pseudo random bits , 1982, 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982).
[24] 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.
[25] Andrew Chi-Chih Yao,et al. Theory and application of trapdoor functions , 1982, 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982).
[26] Silvio Micali,et al. The Knowledge Complexity of Interactive Proof Systems , 1989, SIAM J. Comput..