Robust discretization, with an application to graphical passwords.

Abstract

When data or the processing on the data have some uncertainty, discretization of those data can lead to signicantly dierent output. For example, in certain graphical password schemes, a slight uncertainty in the clicking places can produce a different password. We present a discretization method, called robust discretization, which gives stable outputs in the presence of uncertainties. Robust discretization enables us to implement graphical password schemes that are much more flexible and versatile than previously know ones.