A lower-bound of complexity for RSA-Based password-authenticated key exchange

  • Authors:
  • SeongHan Shin;Kazukuni Kobara;Hideki Imai

  • Affiliations:
  • Institute of Industrial Science, The University of Tokyo, Tokyo, Japan;Institute of Industrial Science, The University of Tokyo, Tokyo, Japan;Institute of Industrial Science, The University of Tokyo, Tokyo, Japan

  • Venue:
  • EuroPKI'05 Proceedings of the Second European conference on Public Key Infrastructure
  • Year:
  • 2005

Quantified Score

Hi-index 0.00

Visualization

Abstract

Some RSA-based PAKE protocols have been proposed using a challenge-response method for verifying the validity of the server's RSA public key due to the lack of a PKI. However, these kind of RSA-based PAKE protocols cannot specify the exact overall complexity of their protocols since there exists a system parameter l needed for the challenge-response method. In this paper we present an RSA-based PAKE (RSA-PAKE) protocol, followed by its lower-bound of complexity and the actual computation and communication costs.