The DOI matches its Crossref record; 20 of the 20 references it cites were found in a registry or an index.
Of passwords and people: measuring the effect of password-composition policies
Abstract
Text-based passwords are the most common mechanism for authenticating humans to computer systems. To prevent users from picking passwords that are too easy for an adversary to guess, system administrators adopt password-composition policies (e.g., requiring passwords to contain symbols and numbers). Unfortunately, little is known about the relationship between password-composition policies and the strength of the resulting passwords, or about the behavior of users (e.g., writing down passwords) in response to different policies. We present a large-scale study that investigates password strength, user behavior, and user sentiment across four password-composition policies. We characterize the predictability of passwords by calculating their entropy, and find that a number of commonly held beliefs about password composition and strength are inaccurate. We correlate our results with user behavior and sentiment to produce several recommendations for password-composition policies that result in strong passwords without unduly burdening users.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
A Mathematical Theory of Communication
Shannon, C. E. (1948) · Bell System Technical Journal · doi:10.1002/j.1538-7305.1948.tb00917.x · Cited by 48,949
Prediction and Entropy of Printed English
Shannon, C. E. (1951) · Bell System Technical Journal · doi:10.1002/j.1538-7305.1951.tb01366.x · Cited by 2,686
Estimation of entropy and mutual information
Paninski, L. (2003) · Neural Computation · doi:10.1162/089976603321780272 · Cited by 1,442 · cited 2×
“Traditional trigram methods, when applied to passwords, require thousands of samples to calculate an accurate estimate [11].”
BackgroundMethodA 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
Analysis of end user security behaviors
Stanton, J. M., Stam, K. R., Mastrangelo, P., & Jolton, J. (2005) · Computers & Security · doi:10.1016/j.cose.2004.07.001 · Cited by 665
Massey, J. L. (2002) · Proceedings of 1994 IEEE International Symposium on Information Theory · doi:10.1109/isit.1994.394764 · Cited by 463 · cited 1×
“Massey showed that entropy provides a lower bound on the expected number of guesses required to identify information; this result connects the entropy in passwords with an attacker’s ability to guess them using a bruteforce attack [9].”
BackgroundTesting 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
The domino effect of password reuse
Ives, B., Walsh, K. R., & Schneider, H. (2004) · Communications of the ACM · doi:10.1145/975817.975820 · Cited by 335
The true cost of unusable password policies: password use in the wild
Inglesant, P. G., & Sasse, M. A. (2010) · Proceedings of the SIGCHI Conference on Human Factors in Computing Systems · doi:10.1145/1753326.1753384 · Cited by 326
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
Self-citationPassword Security: An Empirical Study
Zviran, M., & Haga, W. J. (1999) · Journal of Management Information Systems · doi:10.1080/07421222.1999.11518226 · Cited by 252
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
Improving password security and memorability to protect personal and organizational information
Vu, K.-P. L., Proctor, R. W., Bhargav-Spantzel, A., Tai, B.-L. (., Cook, J., & Eugene Schultz, E. (2007) · International Journal of Human-Computer Studies · doi:10.1016/j.ijhcs.2007.03.007 · Cited by 206
The Password Thicket: Technical and Market Failures in Human Authentication on the Web.
Bonneau, J., & Preibusch, S. (2010) · WEIS · Cited by 177
The 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
Making Passwords Secure and Usable
Adams, A., Sasse, M. A., & Lunt, P. (1997) · People and Computers XII · doi:10.1007/978-1-4471-3601-9_1 · Cited by 164
Where do security policies come from?
Florencio, D. A. F., & Herley, C. (2010) · Symposium On Usable Privacy and Security · doi:10.1145/1837110.1837124 · Cited by 158
Improving system security via proactive password checking
Bishop, M., & Klein, D. V. (1995) · Computers & Security · doi:10.1016/0167-4048(95)00003-q · Cited by 150
Popularity is everything A new approach to protecting passwords from statistical-guessing attacks
Schechter, S., Herley, C., & Mitzenmacher, M. (2010) · Cited by 140
Cited by
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
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
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
Self-citationMenard, P., Bott, G. J., & Crossler, R. E. (2017) · Journal of Management Information Systems · doi:10.1080/07421222.2017.1394083 · Cited by 279
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
Metadata
- Authors
- Komanduri, S., Shay, R., Kelley, P. G., Mazurek, M. L., Bauer, L., Christin, N., Cranor, L. F., & Egelman, S.
- Venue
- Proceedings of the SIGCHI Conference on Human Factors in Computing Systems
- Publisher
- ACM
- Published
- 2011-05-07
- Pages
- 2595-2604
- OpenAlex
- W2113266120
- Cited by
- 345
- References
- 20
- FWCI
- 19.71
- 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.