Cryptology ePrint Archive: Report 2003/168
Robust discretization, with an application to graphical passwords
Jean-Camille Birget and 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.
Category / Keywords: applications / discretization, graphical passwords
Date: received 12 Aug 2003
Contact author: birget at camden rutgers edu, dhong@camden rutgers edu, memon@poly edu
Available format(s): Postscript (PS) | Compressed Postscript (PS.GZ) | BibTeX Citation
Version: 20030815:062311 (All versions of this report)
Discussion forum: Show discussion | Start new discussion
[ Cryptology ePrint archive ]