%0 Book Section
%B Public Key Cryptography – PKC 2012
%D 2012
%T Efficient Password Authenticated Key Exchange via Oblivious Transfer
%A Canetti, Ran
%A Dana Dachman-Soled
%A Vaikuntanathan, Vinod
%A Wee, Hoeteck
%E Fischlin, Marc
%E Buchmann, Johannes
%E Manulis, Mark
%K adaptive security
%K Algorithm Analysis and Problem Complexity
%K Computer Communication Networks
%K Data Encryption
%K Discrete Mathematics in Computer Science
%K Management of Computing and Information Systems
%K oblivious transfer
%K Password Authenticated Key Exchange
%K search assumptions
%K Systems and Data Security
%K UC security
%X 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.
%B Public Key Cryptography – PKC 2012
%S Lecture Notes in Computer Science
%I Springer Berlin Heidelberg
%P 449 - 466
%8 2012/01/01/
%@ 978-3-642-30056-1, 978-3-642-30057-8
%G eng
%U http://link.springer.com/chapter/10.1007/978-3-642-30057-8_27