Password-authenticated key exchange based on RSA

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

Volumn 1976, Issue , 2000, Pages 599-613

  Mackenzie, Philip ^a   Patel, Sarvar ^a   Swaminathan, Ram ^b  

^a LUCENT TECHNOLOGIES   (United States)

^b HEWLETT PACKARD LABORATORIES   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATION THEORY; CRYPTOGRAPHY;

ACTIVE ADVERSARY; BASIC PROTOCOLS; DIFFIE HELLMAN; OFF-LINE DICTIONARY ATTACKS; PASSWORD AUTHENTICATED KEY EXCHANGE PROTOCOLS; PASSWORD-AUTHENTICATED KEY EXCHANGE; PROVABLY SECURE; RANDOM ORACLE MODEL;

AUTHENTICATION;

EID: 84937402236     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44448-3_46     Document Type: Conference Paper

References (37)

1. M. Bellare, R. Canetti, and H. Krawczyk. A modular approach to the design and analysis of authentication and key exchange protocols. In STOC’98, pages 419–428.
2. Donald Beaver. Secure multiparty protocols and zero-knowledge proof systems tolerating a faulty minority. Journal of Cryptology, 4(2):75–122, 1991.
3. D. Bleichenbacher, 1999. Personal Communication.
4. S. M. Bellovin and M. Merritt. Encrypted key exchange: Password-based protocols secure against dictionary attacks. In Proceedings of the IEEE Symposium on Research in Security and Privacy, pages 72–84, 1992.
5. S. M. Bellovin and M. Merritt. Augumented encrypted key exchange: A password-based protocol secure against dictionary attacks and password file compromise. In CCS’93, pages 244–250.
6. V. Boyko, P. MacKenzie, and S. Patel. Provably-secure password authentication and key exchange using Diffie-Hellman. In EUROCRYPT2000
7. M. Boyarsky. Public-key cryptography and password protocols: The multiuser case. In CCS’99, pages 63–72.
8. M. Bellare, D. Pointcheval, and P. Rogaway. Authenticated key exchange secure against dictionary attacks. In EUROCRYPT2000
9. M. Bellare and P. Rogaway. Random oracles are practical: A paradigm for designing efficient protocols. In CCS’93, pages 62–73.
10. M. Bellare and P. Rogaway. Entity authentication and key distribution. In CRYPTO’93, LNCS vol. 773, pages 232–249. Springer-Verlag, August 1993.
11. Mihir Bellare and Phillip Rogaway. Optimal asymmetric encryption. In EUROCRYPT 94, LNCS vol. 950, pages 92–111. Springer-Verlag, May 1994.
12. M. Bellare and P. Rogaway. The exact security of digital signatures—how to sign with RSA and Rabin. In EUROCRYPT 96, pages 399–416, 1996.
13. E. Bach and J. Shallit. Algorithmic Number Theory: Volume 1 Efficient Algorithms. The MIT Press, Cambridge, Massachusetts, 1996.
14. First ACM Conference on Computer and Communications Security, 1993.
15. Sixth ACM Conference on Computer and Communications Security, 1999.
16. R. Canetti, O. Goldreich, and S. Halevi. The random oracle methodology, revisited. In STOC’98, pages 209–218.
17. W. Diffie and M. Hellman. New directions in cryptography. IEEE Trans. Info. Theory, 22(6):644–654, 1976.
18. Advances in Cryptology—EUROCRYPT’2000, LNCS vol. 1807. Springer-Verlag, 14–18 May 2000.
19. L. Gong, T. M. A. Lomas, R. M. Needham, and J. H. Saltzer. Protecting poorly chosen secrets from guessing attacks. IEEE Journal on Selected Areas in Communications, 11(5):648–656, June 1993.
20. L. Gong. Optimal authentication protocols resistant to password guessing attacks. In Proc. 8th IEEE Computer Security Foundations Workshop, pages 24–29, 1995.
21. S. Halevi and H. Krawczyk. Public-key cryptography and password protocols. In Proceedings of the Fifth Annual Conference on Computer and Communications Security, pages 122–131, 1998.
22. IEEE P1363 Annex D/Editorial Contribution 1c: Standard specifications for public-key cryptography, June 1998.
23. D. Jablon. Integrity sciences web site. http://www.IntegritySciences.com.
24. D. Jablon. Strong password-only authenticated key exchange. ACM Computer Communication Review, ACM SIGCOMM, 26(5):5–20, 1996.
25. D. Jablon. Extended password key exchange protocols immune to dictionary attack. In WETICE’97 Workshop on Enterprise Security, 1997.
26. H. W. Lenstra. Divisors in residue classes. Mathematics of Computation, 42:331–340, 1984.
27. Stephan Lucks. Op en key exchange: How to defeat dictionary attacks without encrypting public keys. In Proc. Workshop on Security Protocols, 1997.
28. P. MacKenzie, S. Patel, and R. Swaminathan. Password-authenticated key exchange based on rsa. full version.
29. RSA Laboratories Technical Note. PK CS #1, version 2, RSA encryption standard. http://www.rsa.com/rsalabs/pubs/PKCS/, 1999.
30. S. Patel. Number theoretic attacks on secure password schemes. In Proc. IEEE Symposium on Research in Security and Privacy, pages 236–247, 1997.
31. M. Roe, B. Christianson, and D. Wheeler. Secure sessions from weak secrets. Technical report, Univ. o f Cambridge and Univ. o f Hertfordshire, 1998.
32. R. Rivest, A. Shamir and L. Adleman. A method for obtaining digital signature and public key cryptosystems. Comm. of the ACM, 21:120–126, 1978.
33. V. Shoup. On formal models for secure key exchange. IBM Research Report RZ 3121, April 1999.
34. Thirtieth ACM Symposium on Theory of Computing, May 1998.
35. M. Steiner, G. Tsudik, and M. Waidner. Refinement and extension of encrypted key exchange. ACM Operating System Review, 29:22–30, 1995.
36. T. W u. The secure remote password protocol. In Proc. 1998 Internet Society Network and Distributed System Security Symposium, pages 97–111, 1998.
37. T. Wu. A real world analysis of kerberos password security. In 1999 Internet Society Network and Distributed System Security Symposium, 1999.