Communication Efficient Zero-Knowledge Proofs of Knowledge (With Applications to Electronic Cash)
暂无分享,去创建一个
[1] Silvio Micali,et al. The round complexity of secure protocols , 1990, STOC '90.
[2] Johan Håstad,et al. Pseudo-random generators under uniform assumptions , 1990, STOC '90.
[3] Leonid A. Levin,et al. Pseudo-random generation from one-way functions , 1989, STOC '89.
[4] Alfredo De Santis,et al. Public-Randomness in Public Key Cryptography , 1990, EUROCRYPT.
[5] Amos Fiat,et al. Zero-knowledge proofs of identity , 1987, Journal of Cryptology.
[6] Silvio Micali,et al. A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks , 1988, SIAM J. Comput..
[7] Shafi Goldwasser,et al. Advances in Cryptology — CRYPTO’ 88: Proceedings , 1990, Lecture Notes in Computer Science.
[8] Amos Fiat,et al. Untraceable Electronic Cash , 1990, CRYPTO.
[9] Silvio Micali,et al. Non-Interactive Zero-Knowledge with Preprocessing , 1988, CRYPTO.
[10] 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).
[11] 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).
[12] Silvio Micali,et al. How to construct random functions , 1986, JACM.
[13] Moni Naor,et al. Universal one-way hash functions and their cryptographic applications , 1989, STOC '89.
[14] Rafail Ostrovsky,et al. Minimum resource zero knowledge proofs , 1989, 30th Annual Symposium on Foundations of Computer Science.
[15] Moti Yung,et al. Everything in NP can be Argued in Perfect Zero-Knowledge in a Bounded Number of Rounds , 1989, ICALP.
[16] Moti Yung,et al. Crptograpic Applications of the Non-Interactive Metaproof and Many-Prover Systems , 1990, CRYPTO.
[17] Manuel Blum,et al. Non-interactive zero-knowledge and its applications , 1988, STOC '88.
[18] Kazuo Ohta,et al. Disposable Zero-Knowledge Authentications and Their Applications to Untraceable Electronic Cash , 1989, CRYPTO.
[19] Judit Bar-Ilan,et al. Non-cryptographic fault-tolerant computing in constant number of rounds of interaction , 1989, PODC '89.
[20] John Rompel,et al. One-way functions are necessary and sufficient for secure signatures , 1990, STOC '90.
[21] 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.
[22] Silvio Micali,et al. The Knowledge Complexity of Interactive Proof Systems , 1989, SIAM J. Comput..
[23] Moni Naor,et al. Bit Commitment Using Pseudo-Randomness , 1989, CRYPTO.
[24] S. Micali,et al. Noninteractive Zero-Knowledge , 1990, SIAM J. Comput..
[25] Adi Shamir,et al. Zero Knowledge Proofs of Knowledge in Two Rounds , 1989, CRYPTO.