Robust discretization, with an application to graphical passwords

Jean-Camille Birget; Dawei Hong; Nasir Memon

Paper 2003/168

Robust discretization, with an application to graphical passwords

Jean-Camille Birget, Dawei Hong, and Nasir Memon

Abstract

When data or the processing on the data have some uncertainty, discretization of those data can lead to significantly different 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.

Metadata

Available format(s): PS
Category: Applications
Publication info: Published elsewhere. Unknown where it was published
Keywords: discretization graphical passwords
Contact author(s): birget @ camden rutgers edu
dhong @ camden rutgers edu
memon @ poly edu
History: 2003-08-15: received
Short URL: https://ia.cr/2003/168
License: CC BY

BibTeX

@misc{cryptoeprint:2003/168,
      author = {Jean-Camille Birget and Dawei Hong and Nasir Memon},
      title = {Robust discretization, with an application to graphical passwords},
      howpublished = {Cryptology {ePrint} Archive, Paper 2003/168},
      year = {2003},
      url = {https://eprint.iacr.org/2003/168}
}