## CryptoDB

### Paper: Round-Optimal Password-Based Authenticated Key Exchange

Authors: Jonathan Katz Vinod Vaikuntanathan DOI: 10.1007/s00145-012-9133-6 Search ePrint Search Google 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-based cryptosystems, the resulting protocol is also (reasonably) efficient. Somewhat surprisingly, our framework can be adapted to give protocols in the standard model that are universally composable while still using only one (simultaneous) round.
##### BibTeX
@article{jofc-2013-29475,
journal={Journal of Cryptology},
publisher={Springer},
volume={26},
pages={714-743},
doi={10.1007/s00145-012-9133-6},
author={Jonathan Katz and Vinod Vaikuntanathan},
year=2013
}