Efficient password authenticated key exchange via oblivious transfer

  • Authors:
  • Ran Canetti;Dana Dachman-Soled;Vinod Vaikuntanathan;Hoeteck Wee

  • Affiliations:
  • Tel Aviv University, Israel,Boston University;Microsoft Research New England;University of Toronto, Canada;George Washington University

  • Venue:
  • PKC'12 Proceedings of the 15th international conference on Practice and Theory in Public Key Cryptography
  • Year:
  • 2012

Quantified Score

Hi-index 0.00

Visualization

Abstract

We present a new framework for constructing efficient password authenticated key exchange (PAKE) protocols based on oblivious transfer (OT). Using this framework, we obtain: an efficient and simple UC-secure PAKE protocol that is secure against adaptive corruptions without erasures . efficient and simple PAKE protocols under the Computational Diffie-Hellman (CDH) assumption and the hardness of factoring. (Previous efficient constructions rely on hash proof systems, which appears to be inherently limited to decisional assumptions.) All of our constructions assume a common reference string (CRS) but do not rely on random oracles.