International Association for Cryptologic Research

International Association
for Cryptologic Research

CryptoDB

Optimal Discretization for High-Entropy Graphical Passwords

Authors:
Kemal Bicakci
Download:
URL: http://eprint.iacr.org/2008/178
Search ePrint
Search Google
Abstract: In click-based graphical password schemes that allow arbitrary click locations on image, a click should be verified as correct if it is close within a predefined distance to the originally chosen location. This condition should hold even when for security reasons the password hash is stored in the system, not the password itself. To solve this problem, a robust discretization method has been proposed, recently. In this paper, we show that previous work on discretization does not give optimal results with respect to the entropy of the graphical passwords and propose a new discretization method to increase the password space. To improve the security further, we also present several methods that use multiple hash computations for password verification.
BibTeX
@misc{eprint-2008-17855,
  title={Optimal Discretization for High-Entropy Graphical Passwords},
  booktitle={IACR Eprint archive},
  keywords={applications / authentication, password security, graphical passwords, discretization},
  url={http://eprint.iacr.org/2008/178},
  note={ bicakci@etu.edu.tr 13986 received 17 Apr 2008},
  author={Kemal Bicakci},
  year=2008
}