skip to main content
article

A framework for password-based authenticated key exchange1

Published: 01 May 2006 Publication History

Abstract

In this paper, we present a general framework for password-based authenticated key exchange protocols, in the common reference string model. Our protocol is actually an abstraction of the key exchange protocol of Katz et al. and is based on the recently introduced notion of smooth projective hashing by Cramer and Shoup. We gain a number of benefits from this abstraction. First, we obtain a modular protocol that can be described using just three high-level cryptographic tools. This allows a simple and intuitive understanding of its security. Second, our proof of security is significantly simpler and more modular. Third, we are able to derive analogs to the Katz et al. protocol under additional cryptographic assumptions. Specifically, in addition to the DDH assumption used by Katz et al., we obtain protocols under both the quadratic and N-residuosity assumptions. In order to achieve this, we construct new smooth projective hash functions.

References

[1]
Bellare, M. and Rogaway, P. 1993. Random oracles are practical: A paradigm for designing efficient protocols. In 1st Conf. on Computer and Communications Security, ACM, New York. 62--73.]]
[2]
Bellare, M. and Rogaway, P. 1994. Entity authentication and key distribution. In CRYPTO' 93, Springer-Verlag (LNCS 773), New York. 232--249.]]
[3]
Bellare, M., Pointcheval, D., and Rogaway, P. 2000. Authenticated key exchange secure against dictionary attacks. In Eurocrypt 2000, Springer-Verlag (LNCS 1807), New York. 139--155.]]
[4]
Bellovin, S. M. and Merritt, M. 1992. Encrypted key exchange: Password-based protocols secure against dictionary attacks. In Proceedings 1992 IEEE Symposium on Research in Security and Privacy. IEEE Computer Society, New York. 72--84.]]
[5]
Bellovin, S. M. and Merritt, M. 1993. Augmented encrypted key exchange: A password-based protocol secure against dictionary attacks and password file compromise. In Proceedings of the 1st ACM Conference on Computer and Communication Security, 244--250.]]
[6]
Boyko, V., MacKenzie, P., and Patel, S. 2000. Provably secure password-authenticated key exchange using Diffie--Hellman. In Eurocrypt 2000, Springer-Verlag (LNCS 1807), New York. 156--171.]]
[7]
Canetti, R., Goldreich, O., and Halevi, S. 2004. The random oracle methodology, revisited. Journal of the ACM 51, 4, 557--594.]]
[8]
Canetti, R. and Krawczyk, H. 2001. Analysis of key-exchange protocols and their use for building secure channels. In Eurocrypt 2001, Springer-Verlag (LNCS 2045), New York. 453--474.]]
[9]
Camenisch, J. and Shoup, V. 2003. Practical verifiable encryption and decryption of discrete logarithms. In CRYPTO'03, Springer-Verlag (LNCS 2729), New York. 126--144.]]
[10]
Cramer, R. and Shoup, V. 1998. A practical public-key cryptosystem secure against adaptive chosen ciphertexts attacks. In CRYPTO'98, Springer-Verlag (LNCS 1462), New York. 13--25. (Full version in {Cramer and Shoup 2003}).]]
[11]
Cramer, R. and Shoup, V. 2002. Universal hash proofs and a paradigm for adaptive chosen ciphertext secure public-key encryption. In Eurocrypt 2002, Springer-Verlag (LNCS 2332), New York. 45--64. (Full version in {Cramer and Shoup 2003}).]]
[12]
Cramer, R. and Shoup, V. 2003. Design and analysis of practical public-key encryption schemes secure against adaptive chosen ciphertext attack. SIAM Journal of Computing 33, 167-226.]]
[13]
Damgård, I. and Groth, J. 2003. Non-interactive and reusable nonmalleable commitment schemes. Proc. of 35th ACM Symp. on Theory of Computing (STOC'03). 426--437.]]
[14]
Di Crescenzo, G., Ishai, Y., and Ostrovsky, R. 1998. Non-interactive and non-malleable commitment. In 30th STOC. 141--150.]]
[15]
Di Crescenzo, G., Katz, J., Ostrovsky, R., and Smith, A. 2001. Efficient and non-interactive non-malleable commitment. In Eurocrypt 2001, Springer-Verlag (LNCS 2045), New York. 40--59.]]
[16]
Diffie, W. and Hellman, M. E. 1976. New directions in cryptography. IEEE Trans. on Inf. Theory, IT-22. 644--654.]]
[17]
Dolev, D., Dwork, C., and Naor, M. 2000. Non-malleable cryptography. SIAM Journal of Computing 30, 2, 391--437.]]
[18]
Dwork, C. 1999. The Non-malleability lectures. Course notes for CS 359, Stanford University, Spring. Available at: theory.stanford.edu/~gdurf/cs359-s99.]]
[19]
Goldreich, O. 2001. Foundations of cryptography---Basic tools. Cambridge University Press, Cambridge.]]
[20]
Goldreich, O. and Lindell, Y. 2001. Session key generation using human passwords only. In CRYPTO 2001, Springer-Verlag (LNCS 2139), New York. 408--432.]]
[21]
Halevi, S. and Krawczyk, H. 1999. Public-key cryptography and password protocols. ACM Transactions on Information and System Security (TISSEC) 2, 3, 230--268.]]
[22]
Jablon, D. P. 1996. Strong password-only authenticated key exchange. SIGCOMM Computer Communication Review 26, 5, 5--26.]]
[23]
Katz, J. 2002. Efficient Cryptographic Protocols Preventing “Man-in-the-Middle” Attacks. Ph.D. Thesis, Columbia University, New York.]]
[24]
Katz, J., Ostrovsky, R., and Yung, M. 2001. Practical password-authenticated key exchange provably secure under standard assumptions. In Eurocrypt 2001, Springer-Verlag (LNCS 2045), New York. 475--494.]]
[25]
Lucks, S. 1997. Open key exchange: How to defeat dictionary attacks without encrypting public keys. In Proceedings of the Workshop on Security Protocols, Springer-Verlag (LNCS 1361), New York. 79--90. (Ecole Normale Superieure).]]
[26]
MacKenzie, P. and Yang, K. 2004. On Simulation-Sound Commitments. Proc. of EUROCRYPT'04, Springer LNCS 3027, New York. 382--400.]]
[27]
Naor, M. and Yung, M. 1989. Universal one-way hash functions and their cryptographic applications. In 21st STOC, 33--43.]]
[28]
Paillier, P. 1999. Public-key cryptosystems based on composite degree residue classes. In EUROCRYPT'99, Springer-Verlag (LNCS 1592), New York. 223--228.]]
[29]
Patel, S. 1997. Number theoretic attacks on secure password schemes. In Proceedings of the 1997 IEEE Symposium on Security and Privacy. 236--247.]]
[30]
Steiner, M., Tsudik, G., and Waidner, M. 1995. Refinement and extension of encrypted key exchange. ACM SIGOPS Oper. Syst. Rev. 29, 3, 22--30.]]
[31]
Wu, T. 1998. The secure remote password protocol. In 1998 Internet Society Symposium on Network and Distributed System Security. 97--111.]]

Cited By

View all
  • (2024)Optimizing text security with Mahgoub transformation and S-box encryption strategiesInternational Journal of Information Technology10.1007/s41870-024-02082-8Online publication date: 29-Jul-2024
  • (2024)Quantum-safe multi-server password-based authenticated key exchange protocolMultimedia Tools and Applications10.1007/s11042-023-17984-183:24(65011-65038)Online publication date: 18-Jan-2024
  • (2024)Witness Encryption for Succinct Functional Commitments and ApplicationsPublic-Key Cryptography – PKC 202410.1007/978-3-031-57722-2_5(132-167)Online publication date: 15-Apr-2024
  • Show More Cited By

Recommendations

Comments

Information & Contributors

Information

Published In

cover image ACM Transactions on Information and System Security
ACM Transactions on Information and System Security  Volume 9, Issue 2
May 2006
122 pages
ISSN:1094-9224
EISSN:1557-7406
DOI:10.1145/1151414
Issue’s Table of Contents
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 May 2006
Published in TISSEC Volume 9, Issue 2

Permissions

Request permissions for this article.

Check for updates

Author Tags

  1. Passwords
  2. authentication
  3. dictionary attack
  4. projective hash functions

Qualifiers

  • Article

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)10
  • Downloads (Last 6 weeks)1
Reflects downloads up to 21 Jan 2025

Other Metrics

Citations

Cited By

View all
  • (2024)Optimizing text security with Mahgoub transformation and S-box encryption strategiesInternational Journal of Information Technology10.1007/s41870-024-02082-8Online publication date: 29-Jul-2024
  • (2024)Quantum-safe multi-server password-based authenticated key exchange protocolMultimedia Tools and Applications10.1007/s11042-023-17984-183:24(65011-65038)Online publication date: 18-Jan-2024
  • (2024)Witness Encryption for Succinct Functional Commitments and ApplicationsPublic-Key Cryptography – PKC 202410.1007/978-3-031-57722-2_5(132-167)Online publication date: 15-Apr-2024
  • (2023)A new password-authenticated module learning with rounding-based key exchange protocol: Saber.PAKEThe Journal of Supercomputing10.1007/s11227-023-05251-x79:16(17859-17896)Online publication date: 10-May-2023
  • (2023)Almost Tight Multi-user Security Under Adaptive Corruptions from LWE in the Standard ModelAdvances in Cryptology – CRYPTO 202310.1007/978-3-031-38554-4_22(682-715)Online publication date: 20-Aug-2023
  • (2022)Smooth Projective Hash Function From Codes and its ApplicationsIEEE Transactions on Services Computing10.1109/TSC.2021.310032315:6(3541-3553)Online publication date: 1-Nov-2022
  • (2022)Quantum-Safe Round-Optimal Password Authentication for Mobile DevicesIEEE Transactions on Dependable and Secure Computing10.1109/TDSC.2020.304077619:3(1885-1899)Online publication date: 1-May-2022
  • (2022)A gapless code-based hash proof system based on RQC and its applicationsDesigns, Codes and Cryptography10.1007/s10623-022-01075-790:12(3011-3044)Online publication date: 1-Dec-2022
  • (2022)Password authentication key exchange based on key consensus for IoT securityCluster Computing10.1007/s10586-022-03665-526:1(1-12)Online publication date: 13-Jul-2022
  • (2021)A Verifier-Based Password-Authenticated Key Exchange Using Tamper-Proof HardwareThe Computer Journal10.1093/comjnl/bxaa178Online publication date: 5-Jan-2021
  • Show More Cited By

View Options

Login options

Full Access

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Media

Figures

Other

Tables

Share

Share

Share this Publication link

Share on social media