Paper 2008/178 Original: eprint.iacr.org/2008/178 ↗
Optimal Discretization for High-Entropy Graphical Passwords
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.
Metadata
- Available format(s)
PDF- Category
- Applications
- Publication info
- Preprint.
- History
- 2008-04-21: last updated
- 2008-04-21: published
- Short URL
- https://ia.cr/2008/178
- License
- https://creativecommons.org/licenses/by/4.0/
BibTeX
@misc{cryptoeprint:2008/178,
author = {Kemal Bicakci},
title = {Optimal Discretization for High-Entropy Graphical Passwords},
howpublished = {Cryptology {ePrint} Archive, Paper 2008/178},
year = {2008},
url = {https://eprint.iacr.org/2008/178}
}