"Metaproofs" (and their Cryptographic Applications)
暂无分享,去创建一个
[1] Manuel Blum,et al. How to Prove a Theorem So No One Else Can Claim It , 2010 .
[2] Silvio Micali,et al. The knowledge complexity of interactive proof-systems , 1985, STOC '85.
[3] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[4] Silvio Micali,et al. How to construct random functions , 1986, JACM.
[5] Moni Naor,et al. Bit Commitment Using Pseudo-Randomness , 1989, CRYPTO.
[6] Silvio Micali,et al. Non-Interactive Zero-Knowledge with Preprocessing , 1988, CRYPTO.
[7] Silvio Micali,et al. Non-Interactive Zero-Knowledge Proof Systems , 1987, CRYPTO.
[8] Oded Goldreich,et al. A uniform-complexity treatment of encryption and zero-knowledge , 1993, Journal of Cryptology.
[9] László Babai,et al. Arthur-Merlin Games: A Randomized Proof System, and a Hierarchy of Complexity Classes , 1988, J. Comput. Syst. Sci..
[10] Silvio Micali,et al. How to play ANY mental game , 1987, STOC.
[11] Silvio Micali,et al. Non-Interactive Oblivious Transfer and Spplications , 1989, CRYPTO.
[12] Mihir Bellare,et al. New Paradigms for Digital Signatures and Message Authentication Based on Non-Interative Zero Knowledge Proofs , 1989, CRYPTO.
[13] Silvio Micali,et al. Probabilistic Encryption , 1984, J. Comput. Syst. Sci..
[14] 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).
[15] Whitfield Diffie,et al. New Directions in Cryptography , 1976, IEEE Trans. Inf. Theory.
[16] Silvio Micali,et al. On-line/off-line digital signatures , 1996, Journal of Cryptology.
[17] Moni Naor,et al. Efficient cryptographic schemes provably as secure as subset sum , 1989, 30th Annual Symposium on Foundations of Computer Science.
[18] Moti Yung,et al. Direct Minimum-Knowledge Computations , 1987, CRYPTO.
[19] Moti Yung,et al. On the Design of Provably Secure Cryptographic Hash Functions , 1991, EUROCRYPT.
[20] Moni Naor,et al. Public-key cryptosystems provably secure against chosen ciphertext attacks , 1990, STOC '90.
[21] Leonid A. Levin,et al. Pseudo-random generation from one-way functions , 1989, STOC '89.
[22] Johan Håstad,et al. Pseudo-random generators under uniform assumptions , 1990, STOC '90.
[23] Stephen A. Cook,et al. The complexity of theorem-proving procedures , 1971, STOC.
[24] John Rompel,et al. One-way functions are necessary and sufficient for secure signatures , 1990, STOC '90.
[25] Silvio Micali,et al. A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks , 1988, SIAM J. Comput..
[26] Andrew Chi-Chih Yao,et al. Theory and Applications of Trapdoor Functions (Extended Abstract) , 1982, FOCS.