Public-Randomness in Public Key Cryptography
暂无分享,去创建一个
[1] David Chaum,et al. Demonstrating That a Public Predicate Can Be Satisfied Without Revealing Any Information About How , 1986, CRYPTO.
[2] Moti Yung,et al. Direct Minimum-Knowledge Computations , 1987, CRYPTO.
[3] 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).
[4] Joseph Y. Halpern,et al. A logic to reason about likelihood , 1983, Artif. Intell..
[5] Shafi Goldwasser,et al. Advances in Cryptology — CRYPTO’ 88: Proceedings , 1990, Lecture Notes in Computer Science.
[6] David Chaum,et al. Multiparty unconditionally secure protocols , 1988, STOC '88.
[7] Moti Yung,et al. Cryptographic Computation: Secure Faut-Tolerant Protocols and the Public-Key Model , 1987, CRYPTO.
[8] Stathis Zachos,et al. Does co-NP Have Short Interactive Proofs? , 1987, Inf. Process. Lett..
[9] Avi Wigderson,et al. Completeness theorems for non-cryptographic fault-tolerant distributed computation , 1988, STOC '88.
[10] Oded Goldreich,et al. A randomized protocol for signing contracts , 1985, CACM.
[11] Silvio Micali,et al. How to play ANY mental game , 1987, STOC.
[12] Joe Kilian,et al. Founding crytpography on oblivious transfer , 1988, STOC '88.
[13] 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).
[14] Rafail Ostrovsky,et al. On Necessary Conditions for Secure Distributed Computation , 1989, Distributed Computing And Cryptography.
[15] Donald Beaver,et al. Multiparty Protocols Tolerating Half Faulty Processors , 1989, CRYPTO.
[16] 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.
[17] Whitfield Diffie,et al. New Directions in Cryptography , 1976, IEEE Trans. Inf. Theory.
[18] S. Micali,et al. Noninteractive Zero-Knowledge , 1990, SIAM J. Comput..
[19] Silvio Micali,et al. Non-Interactive Oblivious Transfer and Spplications , 1989, CRYPTO.
[20] Rafail Ostrovsky,et al. Minimum resource zero knowledge proofs , 1989, 30th Annual Symposium on Foundations of Computer Science.
[21] Bert den Boer. Oblivous Transfer Protecting Secrecy , 1991, EUROCRYPT.
[22] Moti Yung,et al. Everything in NP can be Argued in Perfect Zero-Knowledge in a Bounded Number of Rounds , 1989, ICALP.
[23] Claude Crépeau,et al. Equivalence Between Two Flavours of Oblivious Transfers , 1987, CRYPTO.
[24] Manuel Blum,et al. Non-interactive zero-knowledge and its applications , 1988, STOC '88.
[25] Silvio Micali,et al. Removing interaction from zero-knowledge proofs , 1990 .
[26] Manuel Blum,et al. Coin Flipping by Telephone. , 1981, CRYPTO 1981.
[27] Lance Fortnow,et al. The Complexity of Perfect Zero-Knowledge , 1987, Proceeding Structure in Complexity Theory.
[28] Gilles Brassard,et al. Information theoretic reductions among disclosure problems , 1986, 27th Annual Symposium on Foundations of Computer Science (sfcs 1986).
[29] Silvio Micali,et al. The Knowledge Complexity of Interactive Proof Systems , 1989, SIAM J. Comput..
[30] Silvio Micali,et al. Non-Interactive Zero-Knowledge with Preprocessing , 1988, CRYPTO.
[31] Silvio Micali,et al. Non-Interactive Zero-Knowledge Proof Systems , 1987, CRYPTO.
[32] Tal Rabin,et al. Verifiable secret sharing and multiparty protocols with honest majority , 1989, STOC '89.
[33] David Chaum,et al. Minimum Disclosure Proofs of Knowledge , 1988, J. Comput. Syst. Sci..