Efficient cryptographic protocols preventing man-in-the-middle attacks
暂无分享,去创建一个
[1] Marc Fischlin,et al. The Representation Problem Based on Factoring , 2002, CT-RSA.
[2] Moni Naor,et al. Bit commitment using pseudorandomness , 1989, Journal of Cryptology.
[3] Daniel R. Simon,et al. Non-Interactive Zero-Knowledge Proof of Knowledge and Chosen Ciphertext Attack , 1991, CRYPTO.
[4] Moni Naor,et al. Nonmalleable Cryptography , 2000, SIAM Rev..
[5] Thomas D. Wu. The Secure Remote Password Protocol , 1998, NDSS.
[6] Sarvar Patel,et al. Provably Secure Password-Authenticated Key Exchange Using Diffie-Hellman , 2000, EUROCRYPT.
[7] Moni Naor,et al. Zaps and their applications , 2000, Proceedings 41st Annual Symposium on Foundations of Computer Science.
[8] Richard E. Overill,et al. Foundations of Cryptography: Basic Tools , 2002, J. Log. Comput..
[9] Tatsuaki Okamoto,et al. Provably Secure and Practical Identification Schemes and Corresponding Signature Schemes , 1992, CRYPTO.
[10] Russell Impagliazzo,et al. One-way functions are essential for complexity based cryptography , 1989, 30th Annual Symposium on Foundations of Computer Science.
[11] Amos Fiat,et al. Zero-knowledge proofs of identity , 1988, Journal of Cryptology.
[12] Mihir Bellare,et al. Random oracles are practical: a paradigm for designing efficient protocols , 1993, CCS '93.
[13] Amit Sahai,et al. Many-to-One Trapdoor Functions and Their Ralation to Public-Key Cryptosystems , 1998, CRYPTO.
[14] Ivan Damgård,et al. Fast and Secure Immunization Against Adaptive Man-in-the-Middle Impersonation , 1997, EUROCRYPT.
[15] Jean-Jacques Quisquater,et al. A Practical Zero-Knowledge Protocol Fitted to Security Microprocessor Minimizing Both Transmission and Memory , 1988, EUROCRYPT.
[16] Ran Canetti,et al. Universally Composable Commitments , 2001, CRYPTO.
[17] Ivan Damgård,et al. Multiparty Computation from Threshold Homomorphic Encryption , 2000, EUROCRYPT.
[18] Thomas D. Wu. A Real-World Analysis of Kerberos Password Security , 1999, NDSS.
[19] Whitfield Diffie,et al. New Directions in Cryptography , 1976, IEEE Trans. Inf. Theory.
[20] Markus Jakobsson,et al. Designated Verifier Proofs and Their Applications , 1996, EUROCRYPT.
[21] Silvio Micali,et al. A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks , 1988, SIAM J. Comput..
[22] Rafail Ostrovsky,et al. Robust Non-interactive Zero Knowledge , 2001, CRYPTO.
[23] Hugo Krawczyk,et al. SKEME: a versatile secure key exchange mechanism for Internet , 1996, Proceedings of Internet Society Symposium on Network and Distributed Systems Security.
[24] M. Naor,et al. Perfect zero-knowledge ar-guments for NP can be based on general complexity assumptions , 1998 .
[25] David P. Jablon. Extended password key exchange protocols immune to dictionary attack , 1997, Proceedings of IEEE 6th Workshop on Enabling Technologies: Infrastructure for Collaborative Enterprises.
[26] Rafail Ostrovsky,et al. Non-interactive and non-malleable commitment , 1998, STOC '98.
[27] Marc Fischlin,et al. Identification Protocols Secure against Reset Attacks , 2001, EUROCRYPT.
[28] Hugo Krawczyk,et al. A modular approach to the design and analysis of authentication and key exchange protocols (extended abstract) , 1998, STOC '98.
[29] Ran Canetti,et al. Universally composable security: a new paradigm for cryptographic protocols , 2001, Proceedings 2001 IEEE International Conference on Cluster Computing.
[30] Victor Shoup,et al. On Formal Models for Secure Key Exchange , 1999, IACR Cryptol. ePrint Arch..
[31] Amos Fiat,et al. How to Prove Yourself: Practical Solutions to Identification and Signature Problems , 1986, CRYPTO.
[32] Donald Beaver,et al. Adaptive zero knowledge and computational equivocation (extended abstract) , 1996, STOC '96.
[33] Ran Canetti,et al. The random oracle methodology, revisited , 2000, JACM.
[34] Sarvar Patel,et al. Number theoretic attacks on secure password schemes , 1997, Proceedings. 1997 IEEE Symposium on Security and Privacy (Cat. No.97CB36097).
[35] Ronald Cramer,et al. A Practical Public Key Cryptosystem Provably Secure Against Adaptive Chosen Ciphertext Attack , 1998, CRYPTO.
[36] Pascal Paillier,et al. Public-Key Cryptosystems Based on Composite Degree Residuosity Classes , 1999, EUROCRYPT.
[37] Alfredo De Santis,et al. Zero-knowledge proofs of knowledge without interaction , 1992, Proceedings., 33rd Annual Symposium on Foundations of Computer Science.
[38] Ronald Cramer,et al. Universal Hash Proofs and a Paradigm for Adaptive Chosen Ciphertext Secure Public-Key Encryption , 2001, EUROCRYPT.
[39] Oded Goldreich,et al. On the security of multi-party ping-pong protocols , 1983, 24th Annual Symposium on Foundations of Computer Science (sfcs 1983).
[40] Mihir Bellare,et al. Provably secure session key distribution: the three party case , 1995, STOC '95.
[41] Moti Yung,et al. Constant-Round Perfect Zero-Knowledge Computationally Convincing Protocols , 1991, Theor. Comput. Sci..
[42] Richard M. Karp,et al. On the Security of Ping-Pong Protocols , 1982, Inf. Control..
[43] Daniel R. Simon,et al. Limits on the efficiency of one-way permutation-based hash functions , 1999, 40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039).
[44] Richard M. Karp,et al. On the Security of Ping-Pong Protocols , 1982, Information and Control.
[45] Manuel Blum,et al. Non-interactive zero-knowledge and its applications , 1988, STOC '88.
[46] Ronald Cramer,et al. Modular Design of Secure yet Practical Cryptographic Protocols , 1997 .
[47] David P. Jablon. Strong password-only authenticated key exchange , 1996, CCRV.
[48] Moti Yung,et al. Systematic Design of Two-Party Authentication Protocols , 1991, CRYPTO.
[49] Philip D. MacKenzie. More Efficient Password-Authenticated Key Exchange , 2001, CT-RSA.
[50] M. Rabin. DIGITALIZED SIGNATURES AND PUBLIC-KEY FUNCTIONS AS INTRACTABLE AS FACTORIZATION , 1979 .
[51] Mihir Bellare,et al. Authenticated Key Exchange Secure against Dictionary Attacks , 2000, EUROCRYPT.
[52] Mihir Bellare,et al. Relations among Notions of Security for Public-Key Encryption Schemes , 1998, IACR Cryptol. ePrint Arch..
[53] Amit Sahai,et al. Concurrent Zero-Knowledge: Reducing the Need for Timing Constraints , 1998, CRYPTO.
[54] Yael Tauman Kalai,et al. Improved Online/Offline Signature Schemes , 2001, CRYPTO.
[55] Moni Naor,et al. Universal one-way hash functions and their cryptographic applications , 1989, STOC '89.
[56] Gene Tsudik,et al. Refinement and extension of encrypted key exchange , 1995, OPSR.
[57] Mihir Bellare,et al. On Defining Proofs of Knowledge , 1992, CRYPTO.
[58] Victor Shoup,et al. Why Chosen Ciphertext Security Matters , 2000 .
[59] Jerome H. Saltzer,et al. Reducing risks from poorly chosen keys , 1989, SOSP '89.
[60] Adi Shamir,et al. How to expose an eavesdropper , 1984, CACM.
[61] Mihir Bellare,et al. The Security of the Cipher Block Chaining Message Authentication Code , 2000, J. Comput. Syst. Sci..
[62] Taher El Gamal. A public key cryptosystem and a signature scheme based on discrete logarithms , 1984, IEEE Trans. Inf. Theory.
[63] Torben P. Pedersen. Non-Interactive and Information-Theoretic Secure Verifiable Secret Sharing , 1991, CRYPTO.
[64] Ivan Damgård,et al. Proofs of Partial Knowledge and Simplified Design of Witness Hiding Protocols , 1994, CRYPTO.
[65] Adi Shamir,et al. Zero Knowledge Proofs of Knowledge in Two Rounds , 1989, CRYPTO.
[66] Ivan Damgård,et al. Efficient Zero-Knowledge Proofs of Knowledge Without Intractability Assumptions , 2000, Public Key Cryptography.
[67] Mihir Bellare,et al. A concrete security treatment of symmetric encryption , 1997, Proceedings 38th Annual Symposium on Foundations of Computer Science.
[68] Silvio Micali,et al. On the Cryptographic Applications of Random Functions , 1984, CRYPTO.
[69] Jerome H. Saltzer,et al. Protecting Poorly Chosen Secrets from Guessing Attacks , 1993, IEEE J. Sel. Areas Commun..
[70] Mihir Bellare,et al. Entity Authentication and Key Distribution , 1993, CRYPTO.
[71] Mihir Bellare,et al. Optimal Asymmetric Encryption , 1994, EUROCRYPT.
[72] Ralph C. Merkle,et al. A Certified Digital Signature , 1989, CRYPTO.
[73] Li Gong,et al. Optimal authentification protocols resistant to password guessing attacks , 1995, Proceedings The Eighth IEEE Computer Security Foundations Workshop.
[74] Amit Sahai,et al. Non-malleable Encryption: Equivalence between Two Notions, and an Indistinguishability-Based Characterization , 1999, CRYPTO.
[75] Moni Naor,et al. Public-key cryptosystems provably secure against chosen ciphertext attacks , 1990, STOC '90.
[76] Maurizio Kliban Boyarsky,et al. Public-key cryptography and password protocols: the multi-user case , 1999, CCS '99.
[77] Hugo Krawczyk,et al. Analysis of Key-Exchange Protocols and Their Use for Building Secure Channels , 2001, EUROCRYPT.
[78] Ran Canetti,et al. Security and Composition of Multiparty Cryptographic Protocols , 2000, Journal of Cryptology.
[79] John Rompel,et al. One-way functions are necessary and sufficient for secure signatures , 1990, STOC '90.
[80] Leonid A. Levin,et al. A Pseudorandom Generator from any One-way Function , 1999, SIAM J. Comput..
[81] Philip MacKenzie,et al. On the Security of the SPEKE Password-Authenticated Key Exchange Protocol , 2001, IACR Cryptol. ePrint Arch..
[82] Silvio Micali,et al. Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems , 1991, JACM.
[83] Leonid A. Levin,et al. A hard-core predicate for all one-way functions , 1989, STOC '89.
[84] Silvio Micali,et al. Probabilistic Encryption , 1984, J. Comput. Syst. Sci..
[85] Andrew Chi-Chih Yao,et al. Protocols for secure computations , 1982, FOCS 1982.
[86] Alexander Russell. Necessary and Sufficient Conditions For Collision-Free Hashing , 1992, CRYPTO.
[87] Silvio Micali,et al. Public-Key Encryption in a Multi-user Setting: Security Proofs and Improvements , 2000, EUROCRYPT.
[88] Moni Naor,et al. Concurrent zero-knowledge , 1998, STOC '98.
[89] Paul C. van Oorschot,et al. Authentication and authenticated key exchanges , 1992, Des. Codes Cryptogr..
[90] Silvio Micali,et al. The knowledge complexity of interactive proof-systems , 1985, STOC '85.
[91] Amit Sahai,et al. Non-malleable non-interactive zero knowledge and adaptive chosen-ciphertext security , 1999, 40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039).
[92] Adi Shamir,et al. A method for obtaining digital signatures and public-key cryptosystems , 1978, CACM.
[93] Manuel Blum,et al. An Efficient Probabilistic Public-Key Encryption Scheme Which Hides All Partial Information , 1985, CRYPTO.
[94] Danny Dolev,et al. On the security of public key protocols , 1981, 22nd Annual Symposium on Foundations of Computer Science (sfcs 1981).
[95] Victor Boyko,et al. On all-or-nothing transforms and password-authenticated key exchange protocols , 2000 .
[96] Moti Yung,et al. Symmetric Public-Key Encryption , 1985, CRYPTO.
[97] Rafail Ostrovsky,et al. Efficient Password-Authenticated Key Exchange Using Human-Memorable Passwords , 2001, EUROCRYPT.
[98] Rafail Ostrovsky,et al. Efficient and Non-interactive Non-malleable Commitment , 2001, EUROCRYPT.
[99] 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).
[100] T. Elgamal. A public key cryptosystem and a signature scheme based on discrete logarithms , 1984, CRYPTO 1984.
[101] Steven M. Bellovin,et al. Encrypted key exchange: password-based protocols secure against dictionary attacks , 1992, Proceedings 1992 IEEE Computer Society Symposium on Research in Security and Privacy.
[102] Claus-Peter Schnorr,et al. Efficient signature generation by smart cards , 2004, Journal of Cryptology.
[103] Alfred Menezes,et al. Handbook of Applied Cryptography , 2018 .
[104] Jonathan Katz,et al. Complete characterization of security notions for probabilistic private-key encryption , 2000, STOC '00.
[105] Hugo Krawczyk,et al. Public-key cryptography and password protocols , 1998, CCS '98.
[106] Stefan Lucks,et al. Open Key Exchange: How to Defeat Dictionary Attacks Without Encrypting Public Keys , 1997, Security Protocols Workshop.