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-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
The Tangled Web of Password Reuse
Das, A., Bonneau, J., Caesar, M., Borisov, N., & Wang, X. (2014) · Proceedings 2014 Network and Distributed System Security Symposium · doi:10.14722/ndss.2014.23357 · Cited by 437
Self-citationTargeted Online Password Guessing: An Underestimated Threat
Wang, D., Zhang, Z., Wang, P., Yan, J., & Huang, X. (2016) · Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security · doi:10.1145/2976749.2978339 · Cited by 323
Gope, P., Das, A. K., Kumar, N., & Cheng, Y. (2019) · IEEE Transactions on Industrial Informatics · doi:10.1109/tii.2019.2895030 · Cited by 296
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
A Study of Probabilistic Password Models
Ma, J., Yang, W., Luo, M., & Li, N. (2014) · 2014 IEEE Symposium on Security and Privacy · doi:10.1109/sp.2014.50 · Cited by 261
Honeywords: making password-cracking detectable
Juels, A., & Rivest, R. L. (2013) · Proceedings of the 2013 ACM SIGSAC conference on Computer & communications security - CCS '13 · doi:10.1145/2508859.2516671 · Cited by 258
Passwords and the evolution of imperfect authentication
Bonneau, J., Herley, C., van Oorschot, P. C., & Stajano, F. (2015) · Communications of the ACM · doi:10.1145/2699390 · Cited by 258
Self-citation(2017) · doi:10.1145/3133956.3134067 · Cited by 187
(2016) · Symposium On Usable Privacy and Security · Cited by 123
Aviv, A. J., Budzitowski, D., & Kuber, R. (2015) · Proceedings of the 31st Annual Computer Security Applications Conference · doi:10.1145/2818000.2818014 · Cited by 68
Security keys: Practical cryptographic second factors for the modern web
Lang, J., Czeskis, A., Balfanz, D., Schilder, M., & Srinivas, S. (2017) · Lecture Notes in Computer Science · doi:10.1007/978-3-662-54970-4_25 · Cited by 54
Bend Passwords: using gestures to authenticate on flexible devices
Maqsood, S., Chiasson, S., & Girouard, A. (2016) · Personal and Ubiquitous Computing · doi:10.1007/s00779-016-0928-6 · Cited by 24
FIDO Gets Verified: A Formal Analysis of the Universal Authentication Framework Protocol
Feng, H., Guan, J., Li, H., Pan, X., & Zhao, Z. (2023) · IEEE Transactions on Dependable and Secure Computing · doi:10.1109/tdsc.2022.3217259 · Cited by 13
This PIN Can Be Easily Guessed: Analyzing the Security of Smartphone Unlock PINs
Markert, P., Bailey, D. V., Golla, M., Durmuth, M., & Aviv, A. J. (2020) · 2020 IEEE Symposium on Security and Privacy (SP) · doi:10.1109/sp40000.2020.00100 · Cited by 9
Studying the impact of managers on password strength and reuse
Lyastani, S. G., Schilling, M., Fahl, S., Bugiel, S., & Backes, M. (2017) · arXiv · doi:10.48550/arxiv.1712.08940 · Cited by 5
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.