[Resource Topic] 2003/038: Pretty-Simple Password-Authenticated Key-Exchange Under Standard Assumptions

Welcome to the resource topic for 2003/038

Title:
Pretty-Simple Password-Authenticated Key-Exchange Under Standard Assumptions

Authors: Kazukuni Kobara, Hideki Imai

Abstract:

In this paper, we propose a pretty-simple
password-authenticated key-exchange protocol,
which is
proven to be secure in the standard model under the following
three assumptions. (1) DDH (Decision Diffie-Hellman)
problem is hard. (2) The entropy of the password is large
enough to avoid
on-line exhaustive search (but not necessarily off-line
exhaustive search). (3) MAC is selectively unforgeable
against partially chosen message attacks, (which is weaker
than being existentially unforgeable against chosen message attacks).

ePrint: https://eprint.iacr.org/2003/038

See all topics related to this paper.

Feel free to post resources that are related to this paper below.

Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.

For more information, see the rules for Resource Topics .