TY - CHAP
T1 - Efficient Password Authenticated Key Exchange via Oblivious Transfer
T2 - Public Key Cryptography – PKC 2012
Y1 - 2012
A1 - Canetti, Ran
A1 - Dana Dachman-Soled
A1 - Vaikuntanathan, Vinod
A1 - Wee, Hoeteck
ED - Fischlin, Marc
ED - Buchmann, Johannes
ED - Manulis, Mark
KW - adaptive security
KW - Algorithm Analysis and Problem Complexity
KW - Computer Communication Networks
KW - Data Encryption
KW - Discrete Mathematics in Computer Science
KW - Management of Computing and Information Systems
KW - oblivious transfer
KW - Password Authenticated Key Exchange
KW - search assumptions
KW - Systems and Data Security
KW - UC security
AB - 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.
JA - Public Key Cryptography – PKC 2012
T3 - Lecture Notes in Computer Science
PB - Springer Berlin Heidelberg
SN - 978-3-642-30056-1, 978-3-642-30057-8
UR - http://link.springer.com/chapter/10.1007/978-3-642-30057-8_27
ER -