Loading...
Please wait, while we are loading the content...
Similar Documents
Optimizing password composition policies (2013).
| Content Provider | CiteSeerX |
|---|---|
| Author | Blocki, Jeremiah Komanduri, Saranga Procaccia, Ariel D. Sheffet, Or |
| Abstract | A password composition policy restricts the space of allowable passwords to eliminate weak passwords that are vulnerable to statistical guessing attacks. Usability studies have demonstrated that existing password composition policies can sometimes result in weaker password distributions; hence a more principled approach is needed. We introduce the first theoretical model for optimizing password composition policies. We study the computational and sample complexity of this problem under different assumptions on the structure of policies and on users’ preferences over passwords. Our main positive result is an algorithm that – with high probability — constructs almost optimal policies (which are specified as a union of subsets of allowed passwords), and requires only a small number of samples of users’ preferred passwords. We complement our theoretical results with simulations using a real-world dataset of 32 million passwords. |
| File Format | |
| Publisher Date | 2013-01-01 |
| Access Restriction | Open |
| Subject Keyword | Password Composition Policy Sample Complexity First Theoretical Model Statistical Guessing Attack Weaker Password Distribution Principled Approach Allowable Password Optimal Policy User Preference High Probability User Preferred Password Weak Password Theoretical Result Different Assumption Real-world Dataset Small Number Usability Study Main Positive Result |
| Content Type | Text |
