A simple password authentication using a polynomial

  • Authors:
  • Horng-Twu Liaw;Shiou-Wei Fan;Wei-Chen Wu

  • Affiliations:
  • Shih Hsin University, Wenshan, Taipei County, Taiwan, R.O.C.;Shih Hsin University, Wenshan, Taipei County, Taiwan, R.O.C.;Shih Hsin University, Wenshan, Taipei County, Taiwan, R.O.C.

  • Venue:
  • ACM SIGOPS Operating Systems Review
  • Year:
  • 2004

Quantified Score

Hi-index 0.00

Visualization

Abstract

Traditional remote password authentication schemes allow a user to submit his identity and its corresponding password. Then, through a specific algorithm, the server authenticates its users alone. Because these schemes are independent and each scheme develops a specific algorithm by itself, the development cost and computing cost are very high. To avoid the rise in costs, we present a simple password authentication scheme for multi-server environments. The scheme can generate a public polynomial that contains a specific Access Right (AR). The AR means the legal users have different level of authorization based on which server in the multi-server environment in used. Furthermore, the scheme can verify the authorization without a password table. The scheme can authorize many servers at one time so that the users who have registered with various servers do not need to remember different login passwords for each. The scheme also allows users to choose their passwords freely and update it off-line.