A novel one-time password mutual authentication scheme on sharing renewed finite random sub-passwords

  • Authors:
  • Longyan Gong;Jingxin Pan;Beibei Liu;Shengmei Zhao

  • Affiliations:
  • Institute of Signal Processing and Transmission, Nanjing University of Posts and Telecommunications, Nanjing 210003, China and Department of Applied Physics, Nanjing University of Posts and Teleco ...;Institute of Signal Processing and Transmission, Nanjing University of Posts and Telecommunications, Nanjing 210003, China;Institute of Signal Processing and Transmission, Nanjing University of Posts and Telecommunications, Nanjing 210003, China;Institute of Signal Processing and Transmission, Nanjing University of Posts and Telecommunications, Nanjing 210003, China

  • Venue:
  • Journal of Computer and System Sciences
  • Year:
  • 2013

Quantified Score

Hi-index 0.00

Visualization

Abstract

This paper proposes a novel one-time password (OTP) mutual authentication scheme based on challenge/response mechanisms. In the scheme, random sub-passwords and corresponding hashes are shared between a user and a server, respectively. By performing modular algebraic operations on two or more randomly chosen sub-passwords, relatively independent OTPs can be produced in the scheme. The used sub-passwords are renewed according to random permutation functions. With tens of random sub-passwords, we can get enough OTPs that can meet the practical needs. The stores and calculations can be implemented with a microcomputer in the user@?s terminal. At the same time, the scheme can provide sufficient security in ordinary applications.