Proactive Password Checking with Decision Trees
Date: April 1997
Publication: Proceedings of the 4th ACM Conference on Computer and Communications Security, CCS '97
Page(s): 67 - 77
Source 1: http://www.di.unito.it/~ruffo/concorso/Papers/cccs97.pdf
Source 2: http://dx.doi.org/10.1145/266420.266437 - Subscription or payment required
Abstract or Summary:
The important problem of user password selection is addressed and a new proactive password checking technique is presented. In a training phase, a decision tree is generated based on a given dictionary of weak passwords. Then, the decision tree is used to determine whether a user password should be accepted. Experimental results described here show that the method leads to very high dictionary compression (from 100 to 3 in the average) with low error rates (of the order of 1%). We survey previous approaches to proactive password checking, and provide an in-depth comparison.
PasswordResearch.com Note: A newer version of this paper was published with the title High Dictionary Compression for Proactive Password Checking
Do you have additional information to contribute regarding this research paper? If so, please email firstname.lastname@example.org with the details.