Everything in NP can be Argued in Perfect Zero-Knowledge in a Bounded Number of Rounds
暂无分享,去创建一个
[1] Amos Fiat,et al. Zero-knowledge proofs of identity , 1987, Journal of Cryptology.
[2] Gilles Brassard,et al. Sorting out Zero-Knowledge , 1990, EUROCRYPT.
[3] Lance Fortnow,et al. The Complexity of Perfect Zero-Knowledge , 1987, Proceeding Structure in Complexity Theory.
[4] Stuart A. Kurtz,et al. A discrete logarithm implementation of zero-knowledge blobs , 1987 .
[5] Gilles Brassard,et al. Zero-Knowledge Simulation of Boolean Circuits , 1986, CRYPTO.
[6] David Chaum,et al. Demonstrating That a Public Predicate Can Be Satisfied Without Revealing Any Information About How , 1986, CRYPTO.
[7] Adi Shamir,et al. Zero Knowledge Proofs of Knowledge in Two Rounds , 1989, CRYPTO.
[8] David Chaum,et al. Minimum Disclosure Proofs of Knowledge , 1988, J. Comput. Syst. Sci..
[9] Moti Yung,et al. Direct Minimum-Knowledge Computations , 1987, CRYPTO.
[10] Silvio Micali,et al. The knowledge complexity of interactive proof-systems , 1985, STOC '85.
[11] David Chaum,et al. Multiparty Computations Ensuring Privacy of Each Party's Input and Correctness of the Result , 1987, CRYPTO.
[12] Martin E. Hellman,et al. An improved algorithm for computing logarithms over GF(p) and its cryptographic significance (Corresp.) , 1978, IEEE Trans. Inf. Theory.
[13] Stephen C. Pohlig,et al. An Improved Algorithm for Computing Logarithms over GF(p) and Its Cryptographic Significance , 2022, IEEE Trans. Inf. Theory.
[14] David Chaum,et al. Demonstrating Possession of a Discrete Logarithm Without Revealing It , 1986, CRYPTO.
[15] Moti Yung,et al. Everything in NP can be Argued in Perfect Zero-Knowledge in a Bounded Number of Rounds (Extended Abstract) , 1989, EUROCRYPT.
[16] C. E. SHANNON,et al. A mathematical theory of communication , 1948, MOCO.
[17] 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).
[18] David Chaum,et al. An Improved Protocol for Demonstrating Possession of Discrete Logarithms and Some Generalizations , 1987, EUROCRYPT.
[19] Josh Benaloh,et al. Cryptographic Capsules: A Disjunctive Primative for Interactive Protocols , 1986, CRYPTO.
[20] Claude E. Shannon,et al. A Mathematical Theory of Communications , 1948 .
[21] Silvio Micali,et al. Proofs that yield nothing but their validity and a methodology of cryptographic protocol design , 1986, 27th Annual Symposium on Foundations of Computer Science (sfcs 1986).