The DOI matches its Crossref record; 22 of the 22 references it cites were found in a registry or an index.
A Study of Probabilistic Password Models
Abstract
A probabilistic password model assigns a probability value to each string. Such models are useful for research into understanding what makes users choose more (or less) secure passwords, and for constructing password strength meters and password cracking utilities. Guess number graphs generated from password models are a widely used method in password research. In this paper, we show that probability-threshold graphs have important advantages over guess-number graphs. They are much faster to compute, and at the same time provide information beyond what is feasible in guess-number graphs. We also observe that research in password modeling can benefit from the extensive literature in statistical language modeling. We conduct a systematic evaluation of a large number of probabilistic password models, including Markov models using different normalization and smoothing methods, and found that, among other things, Markov models, when done correctly, perform significantly better than the Probabilistic Context-Free Grammar model proposed in Weir et al., which has been used as the state-of-the-art password model in recent research.
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
Estimation of probabilities from sparse data for the language model component of a speech recognizer
Katz, S. (1987) · IEEE Transactions on Acoustics, Speech, and Signal Processing · doi:10.1109/tassp.1987.1165125 · Cited by 1,637
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
The Science of Guessing: Analyzing an Anonymized Corpus of 70 Million Passwords
Bonneau, J. (2012) · 2012 IEEE Symposium on Security and Privacy · doi:10.1109/sp.2012.49 · Cited by 687
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
Fast 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
Of passwords and people: measuring the effect of password-composition policies
Komanduri, S., Shay, R., Kelley, P. G., Mazurek, M. L., Bauer, L., Christin, N., Cranor, L. F., & Egelman, S. (2011) · Proceedings of the SIGCHI Conference on Human Factors in Computing Systems · doi:10.1145/1978942.1979321 · Cited by 345
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
Cited by
Two 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
Targeted 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
PassGAN: A Deep Learning Approach for Password Guessing
Hitaj, B., Gasti, P., Ateniese, G., & Perez-Cruz, F. (2019) · Lecture Notes in Computer Science · doi:10.1007/978-3-030-21568-2_11 · Cited by 290
Who Are You? A Statistical Approach to Measuring User Authenticity
Freeman, D., Jain, S., Duermuth, M., Biggio, B., & Giacinto, G. (2016) · Proceedings 2016 Network and Distributed System Security Symposium · doi:10.14722/ndss.2016.23240 · Cited by 123
Malik, M. N., Azam, M. A., Ehatisham-Ul-Haq, M., Ejaz, W., & Khalid, A. (2019) · Sensors · doi:10.3390/s19112466 · Cited by 39
A large-scale analysis of Wi-Fi passwords
Veroni, E., Ntantogian, C., & Xenakis, C. (2022) · Journal of Information Security and Applications · doi:10.1016/j.jisa.2022.103190 · Cited by 7
Metadata
- Authors
- Ma, J., Yang, W., Luo, M., & Li, N.
- Venue
- 2014 IEEE Symposium on Security and Privacy
- Publisher
- IEEE
- Published
- 2014-05
- Pages
- 689-704
- ISSN
- 1081-6011 (ISSN-L)
- OpenAlex
- W2007488200
- Cited by
- 261
- References
- 22
- FWCI
- 18.52
- 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.