The DOI matches its Crossref record; 43 of the 43 references it cites were found in a registry or an index.
The Science of Guessing: Analyzing an Anonymized Corpus of 70 Million Passwords
Abstract
We report on the largest corpus of user-chosen passwords ever studied, consisting of anonymized password histograms representing almost 70 million Yahoo! users, mitigating privacy concerns while enabling analysis of dozens of subpopulations based on demographic factors and site usage characteristics. This large data set motivates a thorough statistical treatment of estimating guessing difficulty by sampling from a secret distribution. In place of previously used metrics such as Shannon entropy and guessing entropy, which cannot be estimated with any realistically sized sample, we develop partial guessing metrics including a new variant of guesswork parameterized by an attacker's desired success rate. Our new metric is comparatively easy to approximate and directly relevant for security engineering. By comparing password distributions with a uniform distribution which would provide equivalent security against different forms of guessing attack, we estimate that passwords provide fewer than 10 bits of security against an online, trawling attack, and only about 20 bits of security against an optimal offline dictionary attack. We find surprisingly little variation in guessing difficulty; every identifiable group of users generated a comparably weak password distribution. Security motivations such as the registration of a payment card have no greater impact than demographic factors such as age and nationality. Even proactive efforts to nudge users towards better password choices with graphical feedback make little difference. More surprisingly, even seemingly distant language communities choose the same weak passwords and an attacker never gains more than a factor of 2 efficiency gain by switching from the globally optimal dictionary to a population-specific lists.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
A Mathematical Theory of Communication
Shannon, C. E. (1948) · Bell System Technical Journal · doi:10.1002/j.1538-7305.1948.tb01338.x · Cited by 88,486
Power-Law Distributions in Empirical Data
Clauset, A., Shalizi, C. R., & Newman, M. E. J. (2009) · SIAM Review · doi:10.1137/070710111 · Cited by 8,019
Power-law distributions in empirical data
Clauset, A. J., Shalizi, C. R., & Newman, M. E. J. (2018) · Figshare · doi:10.1184/r1/6586835.v1 · Cited by 6,504
Hartley, R. V. L. (1928) · Bell System Technical Journal · doi:10.1002/j.1538-7305.1928.tb01236.x · Cited by 1,828
A large-scale study of web password habits
Florencio, D., & Herley, C. (2007) · Proceedings of the 16th international conference on World Wide Web · doi:10.1145/1242572.1242661 · Cited by 1,047
Baayen, R. H. (2001) · Text, Speech and Language Technology · doi:10.1007/978-94-010-0844-0 · Cited by 978
Password security: a case history
Morris, R., & Thompson, K. (1979) · Communications of the ACM · doi:10.1145/359168.359172 · Cited by 926
PassPoints: Design and longitudinal evaluation of a graphical password system
Wiedenbeck, S., Waters, J., Birget, J.-C., Brodskiy, A., & Memon, N. (2005) · International Journal of Human-Computer Studies · doi:10.1016/j.ijhcs.2005.04.010 · Cited by 692
Password memorability and security: empirical results
Yan, J., Blackwell, A., Anderson, R., & Grant, A. (2004) · IEEE Security & Privacy Magazine · doi:10.1109/msp.2004.81 · Cited by 687
What’s in a Name?: Evaluating Statistical Attacks on Personal Knowledge Questions
Bonneau, J., Just, M., & Matthews, G. (2010) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-14577-3_10 · Cited by 579
Self-citationYour botnet is my botnet: analysis of a botnet takeover
Stone-Gross, B., Cova, M., Cavallaro, L., Gilbert, B., Szydlowski, M., Kemmerer, R., Kruegel, C., & Vigna, G. (2009) · Proceedings of the 16th ACM conference on Computer and communications security · doi:10.1145/1653662.1653738 · Cited by 577
Password Cracking Using Probabilistic Context-Free Grammars
Weir, M., Aggarwal, S., Medeiros, B. D., & Glodek, B. (2009) · 2009 30th IEEE Symposium on Security and Privacy · doi:10.1109/sp.2009.8 · Cited by 524
On User Choice in Graphical Password Schemes
Davis, D., Monrose, F., & Reiter, M. K. (2004) · Cited by 471
Massey, J. L. (2002) · Proceedings of 1994 IEEE International Symposium on Information Theory · doi:10.1109/isit.1994.394764 · Cited by 463 · cited 3×
“It has been demonstrated that H1 is mathematically inappropriate as a measure guessing difficulty [27]–[30].”
BackgroundFast dictionary attacks on passwords using time-space tradeoff
Narayanan, A., & Shmatikov, V. (2005) · Proceedings of the 12th ACM conference on Computer and communications security · doi:10.1145/1102120.1102168 · Cited by 447
Testing metrics for password creation policies by attacking large sets of revealed passwords
Weir, M., Aggarwal, S., Collins, M., & Stern, H. (2010) · Proceedings of the 17th ACM conference on Computer and communications security · doi:10.1145/1866307.1866327 · Cited by 411
Kelley, P. G., Komanduri, S., Mazurek, M. L., Shay, R., Vidas, T., Bauer, L., Christin, N., Cranor, L. F., & Lopez, J. (2012) · 2012 IEEE Symposium on Security and Privacy · doi:10.1109/sp.2012.38 · Cited by 397
Protection and the control of information sharing in multics
Saltzer, J. H. (1974) · Communications of the ACM · doi:10.1145/361011.361067 · Cited by 392
PKCS #5: Password-Based Cryptography Specification Version 2.0
Kaliski, B. (2000) · doi:10.17487/rfc2898 · Cited by 372
Foiling the cracker: A survey of, and improvements to, password security
Klein, D. V. (1992) · Cited by 349
Good‐turing frequency estimation without tears*
Gale, W. A., & Sampson, G. (1995) · Journal of Quantitative Linguistics · doi:10.1080/09296179508590051 · Cited by 314
Encountering stronger password requirements: user attitudes and behaviors
Shay, R., Komanduri, S., Kelley, P. G., Leon, P. G., Mazurek, M. L., Bauer, L., Christin, N., & Cranor, L. F. (2010) · Proceedings of the Sixth Symposium on Usable Privacy and Security · doi:10.1145/1837110.1837113 · Cited by 305
Password Strength: An Empirical Analysis
Dell'Amico, M., Michiardi, P., & Roudier, Y. (2010) · 2010 Proceedings IEEE INFOCOM · doi:10.1109/infcom.2010.5461951 · Cited by 290
How To Break Anonymity of the Netflix Prize Dataset
Narayanan, A., & Shmatikov, V. (2006) · arXiv (Cornell University) · doi:10.48550/arxiv.cs/0610105 · Cited by 263
Password Security: An Empirical Study
Zviran, M., & Haga, W. J. (1999) · Journal of Management Information Systems · doi:10.1080/07421222.1999.11518226 · Cited by 252
Entropy measures and unconditional security in cryptography
Cachin, C. (1997) · Repository for Publications and Research Data (ETH Zurich) · doi:10.3929/ethz-a-001806220 · Cited by 246
Electronic authentication guideline
Burr, W. E., Dodson, D. F., & Polk, W. T. (2004) · doi:10.6028/nist.sp.800-63v1.0.1 · Cited by 241
On a Distribution Law for Word Frequencies
Sichel, H. S. (1975) · Journal of the American Statistical Association · doi:10.1080/01621459.1975.10482469 · Cited by 237
Human selection of mnemonic phrase-based passwords
Kuo, C., Romanosky, S., & Cranor, L. F. (2006) · doi:10.1145/1143120.1143129 · Cited by 212
The tracker: a threat to statistical database security
Denning, D. E., & Denning, P. J. (1979) · ACM Transactions on Database Systems · doi:10.1145/320064.320069 · Cited by 209
The Password Thicket: Technical and Market Failures in Human Authentication on the Web.
Bonneau, J., & Preibusch, S. (2010) · Cited by 177
Self-citationThe security of modern password expiration: an algorithmic framework and empirical analysis
Zhang, Y., Monrose, F., & Reiter, M. K. (2010) · Proceedings of the 17th ACM conference on Computer and communications security · doi:10.1145/1866307.1866328 · Cited by 169
A Birthday Present Every Eleven Wallets? The Security of Customer-Chosen Banking PINs
Bonneau, J., Preibusch, S., & Anderson, R. (2012) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-32946-3_3 · Cited by 164
Self-citationHarrison, M. C., & Wilkes, M. V. (1970) · Mathematics of Computation · doi:10.2307/2004522 · Cited by 158
Adaptive Password-Strength Meters from Markov Models
Castelluccia, C., Dürmuth, M., & Perito, D. (2012) · HAL (Le Centre pour la Communication Scientifique Directe) · Cited by 150
A Real-World Analysis of Kerberos Password Security.
Wu, T. D. (1999) · Cited by 120
Passwords: If We’re So Smart, Why Are We Still Using Them?
Herley, C., van Oorschot, P. C., & Patrick, A. S. (2009) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-03549-4_14 · Cited by 115
Kelley, P. G., Komanduri, S., Mazurek, M. L., et al. (2011) · doi:10.21236/ada570747 · Cited by 84
On the Incomparability of Entropy and Marginal Guesswork in Brute-Force Attacks
Pliam, J. O. (2000) · Lecture notes in computer science · doi:10.1007/3-540-44495-5_7 · Cited by 77
Good-Turing Smoothing Without Tears
Gale, W. A. (2001) · Cited by 76
Passwords in use in a university timesharing environment
Riddle, B. L., Miron, M. S., & Semo, J. A. (1989) · Computers & Security · doi:10.1016/0167-4048(89)90049-7 · Cited by 62
Humphries, J. (1969) · Electronics and Power · doi:10.1049/ep.1969.0228 · Cited by 54
Egelman, S., Bonneau, J., Chiasson, S., Dittrich, D., & Schechter, S. (2012) · Lecture notes in computer science · doi:10.1007/978-3-642-34638-5_11 · Cited by 26
Self-citation
Cited by
The Quest to Replace Passwords: A Framework for Comparative Evaluation of Web Authentication Schemes
Bonneau, J., Herley, C., Oorschot, P. C. V., & Stajano, F. (2012) · 2012 IEEE Symposium on Security and Privacy · doi:10.1109/sp.2012.44 · Cited by 1,110
Self-citationTwo birds with one stone: two-factor authentication with security beyond conventional bound
Wang, D., & Wang, P. (2016) · IEEE Transactions on Dependable and Secure Computing · doi:10.1109/tdsc.2016.2605087 · Cited by 539
Wang, D., Cheng, H., Wang, P., Huang, X., & Jian, G. (2017) · IEEE Transactions on Information Forensics and Security · doi:10.1109/tifs.2017.2721359 · Cited by 499
Anonymous Two-Factor Authentication in Distributed Systems: Certain Goals Are Beyond Attainment
Wang, D., He, D., Wang, P., & Chu, C.-H. (2015) · IEEE Transactions on Dependable and Secure Computing · doi:10.1109/tdsc.2014.2355850 · Cited by 451
A Survey on Systems Security Metrics
Pendleton, M., Garcia-Lebron, R., Cho, J.-H., & Xu, S. (2017) · ACM Computing Surveys · doi:10.1145/3005714 · Cited by 283
Metadata
- Authors
- Bonneau, J.
- Venue
- 2012 IEEE Symposium on Security and Privacy
- Publisher
- IEEE
- Published
- 2012-05
- Pages
- 538-552
- ISSN
- 1081-6011 (ISSN-L)
- OpenAlex
- W2048755632
- Cited by
- 687
- References
- 43
- FWCI
- 42.20
- Type
- conference paper
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.