IPAKE: Isomorphisms for Password-Based Authenticated Key Exchange

Abstract. In this paper we revisit one of the most popular passwordbased key exchange protocols, namely the OKE (for Open Key Exchange) scheme, proposed by Luck in 1997. Our results can be highlighted as follows. First we define a new primitive that we call trapdoor hard-to-invert isomorphisms, and give some candidates. Then we present a generic password-based key exchange construction, that admits a security proof assuming that these objects exist. Finally, we instantiate our general scheme with some concrete examples, such as the Diffie-Hellman function and the RSA function, but more interestingly the modular square root function, which leads to the first scheme with security related to the integer factorization problem. Furthermore, the latter variant is very efficient for one party (the server). Our results hold in the random-oracle model.

• Type: Conference
• Year: 2004
• Where: CRYPTO
• Authors: Dario Catalano, David Pointcheval, Thomas Pornin
• Keywords: CRYPTO 2004, Key Exchange, Key Exchange Protocols, Open Key Exchange