Efficient password-authenticated key exchange using human-memorable passwords

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2045, Issue , 2001, Pages 475-494

  Katz, Jonathan ^a   Ostrovsky, Rafail ^b   Yung, Moti ^c  

^a Columbia University ^*  (United States)

^b TELCORDIA TECHNOLOGIES   (United States)

^c CertCo Inc ^*  (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CRYPTOGRAPHY;

DESIGN PROTOCOLS; ENGLISH WORD; FORMAL VALIDATION; HEURISTIC PROTOCOLS; IDEAL-CIPHER MODEL; KEY EXCHANGE PROTOCOLS; OFF-LINE DICTIONARY ATTACKS; PASSWORD-AUTHENTICATED KEY EXCHANGE; RANDOM ORACLE; THE STANDARD MODEL;

AUTHENTICATION;

EID: 84945132563     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44987-6_29     Document Type: Conference Paper

References (28)

1. M. Bellare, A. Boldyreva, and S. Micali. Public-Key Encryption in a Multi-User Setting: Security Proofs and Improvements. Eurocrypt 2000.
2. M. Bellare, R. Canetti, and H. Krawczyk. A Modular Approach to the Design and Analysis of Authentication and Key Exchange Protocols. STOC ’98.
3. M. Bellare, D. Pointcheval, and P. Rogaway. Authenticated Key Exchange Secure Against Dictionary Attacks. Eurocrypt 2000.
4. M. Bellare and P. Rogaway. Entity Authentication and Key Distribution. Crypto ’93.
5. M. Bellare and P. Rogaway. Random Oracles are Practical: A Paradigm for Designing Efficient Protocols. ACM CCCS ’93.
6. M. Bellare and P. Rogaway. Provably Secure Session Key Distribution: the Three Party Case. STOC ’95.
7. S. Bellovin and M. Merritt. Encrypted Key Exchange: Password-Based Protocols Secure against Dictionary Attacks. IEEE Symposium on Security and Privacy, 1992.
8. D. Boneh. The Decision Diffie-Hellman Problem. Proceedings of the Third Algorithmic Number Theory Symposium, 1998.
9. M. Boyarsky. Public-Key Cryptography and Password Protocols: The Multi-User Case. ACM CCCS ’99.
10. V. Boyko, P. MacKenzie, and S. Patel. Provably Secure Password-Authenticated Key Exchange Using Diffie-Hellman. Eurocrypt 2000.
11. V. Boyko. On All-or-Nothing Transforms and Password-Authenticated Key Exchange Protocols. PhD Thesis, MIT, Department of Electrical Engineering and Computer Science, Cambridge, MA, 2000.
12. R. Canetti, O. Goldreich, and S. Halevi. The Random Oracle Methodology, Revisited. STOC ’98.
13. R. Cramer and V. Shoup. A Practical Public Key Cryptosystem Provably Secure Against Chosen Ciphertext Attack. Crypto ’98.
14. W. Diffie and M. Hellman. NewDirections in Cryptography. IEEE Trans. Info. Theory, 22(6): 644–654, 1976.
15. S. Even, O. Goldreich, and S. Micali. On-Line/Off-Line Digital Signatures. Crypto ’89.
16. O. Goldreich. On the Foundations of Modern Cryptography. Crypto ’97.
17. O. Goldreich and Y. Lindell. Personal Communication and Crypto 2000 Rump Session. Session-Key Generation using Human Passwords Only. Available at http://eprint.iacr.org/2000/057.
18. O. Goldreich, S. Micali, and A. Wigderson. Howto Play Any Mental Game, or a Completeness Theorem for Protocols with an Honest Majority. STOC ’87.
19. S. Goldwasser, R. Rivest, and S. Micali. A Digital Signature Scheme Secure Against Adaptive Chosen Message Attacks. SIAM J. Comp. 17(2): 281–308, 1988.
20. S. Halevi and H. Krawczyk. Public-Key Cryptography and Password Protocols. ACM Transactions on Information and System Security, 2(3): 230–268, 1999.
21. S. Lucks. Open Key Exchange: Howto Defeat Dictionary Attacks Without Encrypting Public Keys. Proceedings of the Workshop on Security Protocols, 1997.
22. P. MacKenzie, S. Patel, and R. Swaminathan. Password-Authenticated Key Exchange Based on RSA. Asiacrypt 2000.
23. M. Naor and M. Yung. Universal One-Way Hash Functions and Their Cryptographic Applications. STOC ’89.
24. G. Poupard and J. Stern. Security Analysis of a Practical “on the fly” Authentication and Signature Generation. Eurocrypt ’98.
25. G. Poupard and J. Stern. On the Fly Signatures Based on Factoring. ACM CCCS ’99.
26. J. Rompel. One-Way Functions are Necessary and Sufficient for Secure Signatures. STOC ’90
27. C.-P. Schnorr. Efficient Signature Generation by Smartcards. J. Crypto. 4(3): 161–174 (1991).
28. V. Shoup. On Formal Models for Secure Key Exchange. Available at http://philby.ucsd.edu/cryptolib.