Theory of Cryptography Conference

TCC 2011: Theory of Cryptography pp 293-310

Round-Optimal Password-Based Authenticated Key Exchange

  • Jonathan Katz
  • Vinod Vaikuntanathan
Conference paper

DOI: 10.1007/978-3-642-19571-6_18

Volume 6597 of the book series Lecture Notes in Computer Science (LNCS)
Cite this paper as:
Katz J., Vaikuntanathan V. (2011) Round-Optimal Password-Based Authenticated Key Exchange. In: Ishai Y. (eds) Theory of Cryptography. TCC 2011. Lecture Notes in Computer Science, vol 6597. Springer, Berlin, Heidelberg


We show a general framework for constructing password-based authenticated key exchange protocols with optimal round complexity — one message per party, sent simultaneously — in the standard model, assuming a common reference string. When our framework is instantiated using bilinear-map cryptosystems, the resulting protocol is also (reasonably) efficient. Somewhat surprisingly, our framework can be adapted to give protocols in the standard model that are universally composable while still using only one (simultaneous) round.

Download to read the full conference paper text

Copyright information

© International Association for Cryptologic Research 2011

Authors and Affiliations

  • Jonathan Katz
    • 1
  • Vinod Vaikuntanathan
    • 2
  1. 1.University of MarylandUSA
  2. 2.Microsoft ResearchUSA