High dictionary compression for proactive password checking
Authors:
Open Access
- 1 November 1998
- journal article
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Information and System Security
- Vol. 1 (1) , 3-25
Abstract
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 a very high dictionary compression (up to 1000 to 1) with low error rates (of the order of 1%). A prototype implementation, called ProCheck, is made available online. We survey previous approaches to proactive password checking, and provide an in-depth comparison.Keywords
This publication has 7 references indexed in Scilit:
- Kerberos: an authentication service for computer networksIEEE Communications Magazine, 1994
- OPUS: Preventing weak password choicesComputers & Security, 1992
- Inferring decision trees using the minimum description lenght principleInformation and Computation, 1989
- Simplifying decision treesInternational Journal of Man-Machine Studies, 1987
- Stochastic Complexity and ModelingThe Annals of Statistics, 1986
- Induction of decision treesMachine Learning, 1986
- Optimizing decision trees through heuristically guided searchCommunications of the ACM, 1978