Graphical Passwords Based on Robust Discretization
Jean-Camille Birget, D. H. Hong, Nasir D. Memon · IEEE Transactions on Information Forensics and Security · 2006
This paper generalizes Blonder's graphical passwords to arbitrary images and solves a robustness problem that this generalization entails. The password consists of user-chosen click points in a displayed image. In order to store passwords in cryptographically hashed form, we need to prevent small uncertainties in the click points from having any effect on the password. We achieve this by introducing a robust discretization, based on multigrid discretization.