Zero Knowledge Proofs of Knowledge in Two Rounds
暂无分享,去创建一个
[1] Stephen A. Cook,et al. The complexity of theorem-proving procedures , 1971, STOC.
[2] Vaughan R. Pratt,et al. Every Prime has a Succinct Certificate , 1975, SIAM J. Comput..
[3] 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).
[4] 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).
[5] Silvio Micali,et al. Non-Interactive Zero-Knowledge Proof Systems , 1987, CRYPTO.
[6] David Chaum,et al. Minimum Disclosure Proofs of Knowledge , 1988, J. Comput. Syst. Sci..
[7] Manuel Blum,et al. Non-interactive zero-knowledge and its applications , 1988, STOC '88.
[8] Martín Abadi,et al. On Generating Solved Instances of Computational Problems , 1988, CRYPTO.
[9] Moti Yung,et al. Everything in NP can be Argued in Perfect Zero-Knowledge in a Bounded Number of Rounds (Extended Abstract) , 1989, EUROCRYPT.
[10] Moni Naor,et al. Bit Commitment Using Pseudo-Randomness , 1989, CRYPTO.
[11] Silvio Micali,et al. The Knowledge Complexity of Interactive Proof Systems , 1989, SIAM J. Comput..
[12] Leonid A. Levin,et al. Pseudo-random generation from one-way functions , 1989, STOC '89.
[13] Leonid A. Levin,et al. A hard-core predicate for all one-way functions , 1989, STOC '89.
[14] Ivan Damgård,et al. On the Existence of Bit Commitment Schemes and Zero-Knowledge Proofs , 1989, CRYPTO.
[15] Moti Yung,et al. Everything in NP can be Argued in Perfect Zero-Knowledge in a Bounded Number of Rounds , 1989, ICALP.
[16] Lance Fortnow,et al. The Complexity of Perfect Zero-Knowledge , 1987, Proceeding Structure in Complexity Theory.
[17] Mihir Bellare,et al. New Paradigms for Digital Signatures and Message Authentication Based on Non-Interative Zero Knowledge Proofs , 1989, CRYPTO.