Efficient password authenticated key exchange via oblivious transfer

Ran Canetti*, Dana Dachman-Soled, Vinod Vaikuntanathan, Hoeteck Wee

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

29 Scopus citations

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.

Original languageEnglish
Title of host publicationPublic Key Cryptography, PKC 2012 - 15th International Conference on Practice and Theory in Public Key Cryptography, Proceedings
Pages449-466
Number of pages18
DOIs
StatePublished - 2012
Event15th International Conference on Practice and Theory in Public Key Cryptography, PKC 2012 - Darmstadt, Germany
Duration: 21 May 201223 May 2012

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume7293 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference15th International Conference on Practice and Theory in Public Key Cryptography, PKC 2012
Country/TerritoryGermany
CityDarmstadt
Period21/05/1223/05/12

Keywords

  • Password Authenticated Key Exchange
  • UC security
  • adaptive security
  • oblivious transfer
  • search assumptions

Fingerprint

Dive into the research topics of 'Efficient password authenticated key exchange via oblivious transfer'. Together they form a unique fingerprint.

Cite this