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 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.
Lingua originale | Inglese |
---|---|
Pagine | 67-77 |
Numero di pagine | 11 |
DOI | |
Stato di pubblicazione | Pubblicato - 1997 |
Pubblicato esternamente | Sì |
Evento | Proceedings of the 1997 4th ACM Conference on Computer and Communications Security - Zurich, Switz Durata: 1 apr 1997 → 4 apr 1997 |
???event.eventtypes.event.conference???
???event.eventtypes.event.conference??? | Proceedings of the 1997 4th ACM Conference on Computer and Communications Security |
---|---|
Città | Zurich, Switz |
Periodo | 1/04/97 → 4/04/97 |