Advertisement
Published in:
2011 | OriginalPaper | Chapter
Round-Optimal Password-Based Authenticated Key Exchange
Authors : Jonathan Katz, Vinod Vaikuntanathan
Published in: Theory of Cryptography
Publisher: Springer Berlin Heidelberg
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by
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 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 in the standard model that are
universally composable
while still using only one (simultaneous) round.