The DOI matches its Crossref record; 28 of the 28 references it cites were found in a registry or an index.
Fast dictionary attacks on passwords using time-space tradeoff
Abstract
Human-memorable passwords are a mainstay of computer security. To decrease vulnerability of passwords to brute-force dictionary attacks, many organizations enforce complicated password-creation rules and require that passwords include numerals and special characters. We demonstrate that as long as passwords remain human-memorable, they are vulnerable to "smart-dictionary" attacks even when the space of potential passwords is large.Our first insight is that the distribution of letters in easy-to-remember passwords is likely to be similar to the distribution of letters in the users' native language. Using standard Markov modeling techniques from natural language processing, this can be used to dramatically reduce the size of the password space to be searched. Our second contribution is an algorithm for efficient enumeration of the remaining password space. This allows application of time-space tradeoff techniques, limiting memory accesses to a relatively small table of "partial dictionary" sizes and enabling a very fast dictionary attack.We evaluated our method on a database of real-world user password hashes. Our algorithm successfully recovered 67.6% of the passwords using a 2 x 109 search space. This is a much higher percentage than Oechslin's "rainbow" attack, which is the fastest currently known technique for searching large keyspaces. These results call into question viability of human-memorable character-sequence passwords as an authentication mechanism.
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 tutorial on hidden Markov models and selected applications in speech recognition
Rabiner, L. R. (1989) · Proceedings of the IEEE · doi:10.1109/5.18626 · Cited by 22,743
The magical number seven, plus or minus two: Some limits on our capacity for processing information.
Miller, G. A. (1956) · Psychological Review · doi:10.1037/h0043158 · Cited by 17,812
The magical number seven, plus or minus two: Some limits on our capacity for processing information.
Miller, G. A. (1994) · Psychological Review · doi:10.1037/0033-295x.101.2.343 · Cited by 17,161
Forney, G. D. (1973) · Proceedings of the IEEE · doi:10.1109/proc.1973.9030 · Cited by 5,647
An Introduction to Kolmogorov Complexity and Its Applications
Li, M., & Vitányi, P. (2019) · Texts in Computer Science · doi:10.1007/978-3-030-11298-1 · Cited by 3,681
Cryptography and data security
Denning, D. E. (1982) · Calhoun: The Naval Postgraduate School Institutional Archive (Naval Postgraduate School) · Cited by 1,904
Authenticated Key Exchange Secure against Dictionary Attacks
Bellare, M., Pointcheval, D., & Rogaway, P. (2000) · Lecture Notes in Computer Science · doi:10.1007/3-540-45539-6_11 · Cited by 1,503
Encrypted key exchange: password-based protocols secure against dictionary attacks
Bellovin, S. M., & Merritt, M. (2003) · Proceedings 1992 IEEE Computer Society Symposium on Research in Security and Privacy · doi:10.1109/risp.1992.213269 · Cited by 1,353
Password security: a case history
Morris, R., & Thompson, K. (1979) · Communications of the ACM · doi:10.1145/359168.359172 · Cited by 926
Proceedings of the 26th annual conference of the cognitive science society
Dieussaert, K., Ford, M., & Horsten, L. (2004) · Cited by 853
The design and analysis of graphical passwords
Jermyn, I. H., Mayer, A. J., Monrose, F., Reiter, M. K., & Rubin, A. D. (1999) · Durham Research Online (Durham University) · Cited by 755
Provably Secure Password-Authenticated Key Exchange Using Diffie-Hellman
Boyko, V., MacKenzie, P., & Patel, S. (2000) · Lecture Notes in Computer Science · doi:10.1007/3-540-45539-6_12 · Cited by 729
A cryptanalytic time-memory trade-off
Hellman, M. (1980) · IEEE Transactions on Information Theory · doi:10.1109/tit.1980.1056220 · Cited by 701
Making a Faster Cryptanalytic Time-Memory Trade-Off
Oechslin, P. (2003) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-45146-4_36 · Cited by 494
On User Choice in Graphical Password Schemes
Davis, D., Monrose, F., & Reiter, M. K. (2004) · Cited by 471
Efficient Password-Authenticated Key Exchange Using Human-Memorable Passwords
Katz, J., Ostrovsky, R., & Yung, M. (2001) · Lecture Notes in Computer Science · doi:10.1007/3-540-44987-6_29 · Cited by 398
Securing passwords against dictionary attacks
Pinkas, B., & Sander, T. (2002) · Proceedings of the 9th ACM conference on Computer and communications security · doi:10.1145/586110.586133 · Cited by 307
Password hardening based on keystroke dynamics
Monrose, F., Reiter, M. K., & Wetzel, S. (2002) · International Journal of Information Security · doi:10.1007/s102070100006 · Cited by 254
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
Session-Key Generation Using Human Passwords Only
Goldreich, O., & Lindell, Y. (2001) · Lecture Notes in Computer Science · doi:10.1007/3-540-44647-8_24 · Cited by 205
UNIX Password Security - Ten Years Later
Feldmeier, D. C., & Karn, P. R. (2007) · Lecture Notes in Computer Science · doi:10.1007/0-387-34805-0_6 · Cited by 172
Open key exchange: How to defeat dictionary attacks without encrypting public keys
Lucks, S. (1998) · Lecture notes in computer science · doi:10.1007/bfb0028161 · Cited by 114
Rigorous time/space tradeoffs for inverting functions
Fiat, A., & Naor, M. (1991) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/103418.103473 · Cited by 60
A Time-Memory Tradeo. Using Distinguished Points: New Analysis & FPGA Results
Standaert, F., Rouvroy, G., Quisquater, J.-J., & Legat, J.-D. (2003) · Lecture notes in computer science · doi:10.1007/3-540-36400-5_43 · Cited by 53
Password authenticated key exchange using hidden smooth subgroups
Gentry, C., MACKENZIE, P. D., & Ramzan, Z. (2005) · ACM SIGSAC Conference on Computer and Communications Security (CCS) · doi:10.1145/1102120.1102160 · Cited by 37
Probability, algorithmic complexity, and subjective randomness
Griffiths, T. L., & Tenenbaum, J. B. (2003) · eScholarship (California Digital Library) · Cited by 34
From Algorithmic to Subjective Randomness
Griffiths, T. L., & Tenenbaum, J. B. (2003) · Cited by 22
Addressing Online Dictionary Attacks with Login Histories and Humans-in-the-Loop
Stubblebine, S. G., & van Oorschot, P. C. (2004) · Lecture notes in computer science · doi:10.1007/978-3-540-27809-2_5 · Cited by 13
Cited by
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
Graphical passwords: Learning from the first twelve years
Biddle, R., Chiasson, S., & Van Oorschot, P. C. (2012) · ACM Computing Surveys · doi:10.1145/2333112.2333114 · Cited by 563
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
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
Cyber-physical systems security: Limitations, issues and future trends
Yaacoub, J.-P. A., Salman, O., Noura, H. N., Kaaniche, N., Chehab, A., & Malli, M. (2020) · Microprocessors and Microsystems · doi:10.1016/j.micpro.2020.103201 · Cited by 491
Metadata
- Authors
- Narayanan, A., & Shmatikov, V.
- Venue
- Proceedings of the 12th ACM conference on Computer and communications security
- Publisher
- ACM
- Published
- 2005-11-07
- Pages
- 364-372
- ISSN
- 1543-7221 (ISSN-L)
- OpenAlex
- W2086553822
- Cited by
- 447
- References
- 28
- FWCI
- 6.50
- 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.