DMCA
Pretty-simple password-authenticated key-exchange under standard assumptions (2002)
| Venue: | IEICE Trans |
| Citations: | 11 - 1 self |
BibTeX
@ARTICLE{Kobara02pretty-simplepassword-authenticated,
author = {Kazukuni Kobara and Hideki Imai},
title = {Pretty-simple password-authenticated key-exchange under standard assumptions},
journal = {IEICE Trans},
year = {2002},
volume = {85},
pages = {2229--2237}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
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). 1
