Cryptology ePrint Archive: Report 2010/368

Round-Optimal Password-Based Authenticated Key Exchange

Jonathan Katz and Vinod Vaikuntanathan

Abstract: 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 the existence of 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 (still in the standard model) that are universally composable, while still using only one (simultaneous) round.

Category / Keywords: password-based key exchange

Date: received 25 Jun 2010, last revised 11 Sep 2012

Contact author: jkatz at cs umd edu

Available format(s): PDF | BibTeX Citation

Note: This is the full version.

Version: 20120911:140346 (All versions of this report)

Short URL: ia.cr/2010/368

Discussion forum: Show discussion | Start new discussion