Paper 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.
Note: This is the full version.
Metadata
- Available format(s)
-
PDF
- Publication info
- Published elsewhere. Unknown where it was published
- Keywords
- password-based key exchange
- Contact author(s)
- jkatz @ cs umd edu
- History
- 2012-09-11: last of 2 revisions
- 2010-06-28: received
- See all versions
- Short URL
- https://ia.cr/2010/368
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2010/368,
author = {Jonathan Katz and Vinod Vaikuntanathan},
title = {Round-Optimal Password-Based Authenticated Key Exchange},
howpublished = {Cryptology ePrint Archive, Paper 2010/368},
year = {2010},
note = {\url{https://eprint.iacr.org/2010/368}},
url = {https://eprint.iacr.org/2010/368}
}
