{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,9]],"date-time":"2026-07-09T16:10:58Z","timestamp":1783613458147,"version":"3.55.0"},"publisher-location":"New York, NY, USA","reference-count":36,"publisher":"ACM","license":[{"start":{"date-parts":[[2005,11,7]],"date-time":"2005-11-07T00:00:00Z","timestamp":1131321600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2005,11,7]]},"DOI":"10.1145\/1102120.1102168","type":"proceedings-article","created":{"date-parts":[[2006,2,6]],"date-time":"2006-02-06T15:52:40Z","timestamp":1139241160000},"page":"364-372","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":287,"title":["Fast dictionary attacks on passwords using time-space tradeoff"],"prefix":"10.1145","author":[{"given":"Arvind","family":"Narayanan","sequence":"first","affiliation":[{"name":"University of Texas at Austin"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Vitaly","family":"Shmatikov","sequence":"additional","affiliation":[{"name":"University of Texas at Austin"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2005,11,7]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"MD5 online cracking using rainbow tables. http:\/\/www.passcracking.com\/.]]  MD5 online cracking using rainbow tables. http:\/\/www.passcracking.com\/.]]"},{"key":"e_1_3_2_1_2_1","series-title":"LNCS","first-page":"139","volume-title":"Proc. EUROCRYPT '00","author":"Bellare M.","year":"2000","unstructured":"M. Bellare , D. Pointcheval , and P. Rogaway . Authenticated key exchange secure against dictionary attacks . In Proc. EUROCRYPT '00 , volume 1807 of LNCS , pages 139 -- 155 . Springer , 2000 .]] M. Bellare, D. Pointcheval, and P. Rogaway. Authenticated key exchange secure against dictionary attacks. In Proc. EUROCRYPT '00, volume 1807 of LNCS, pages 139--155. Springer, 2000.]]"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.5555\/882488.884178"},{"key":"e_1_3_2_1_4_1","unstructured":"A. Booker. The Nth prime algorithm. http:\/\/primes.utm.edu\/nthprime\/algorithm.php 2005.]]  A. Booker. The Nth prime algorithm. http:\/\/primes.utm.edu\/nthprime\/algorithm.php 2005.]]"},{"key":"e_1_3_2_1_5_1","first-page":"111","volume-title":"Proc. 19th Symposium on Information Theory in the Benelux","author":"Borst J.","year":"1998","unstructured":"J. Borst , B. Preneel , and J. Vandewalle . On the time-memory tradeoff between exhaustive key search and table precomputation . In Proc. 19th Symposium on Information Theory in the Benelux , pages 111 -- 118 , 1998 .]] J. Borst, B. Preneel, and J. Vandewalle. On the time-memory tradeoff between exhaustive key search and table precomputation. In Proc. 19th Symposium on Information Theory in the Benelux, pages 111--118, 1998.]]"},{"key":"e_1_3_2_1_6_1","series-title":"LNCS","first-page":"156","volume-title":"Proc. EUROCRYPT '00","author":"Boyko V.","year":"2000","unstructured":"V. Boyko , P. MacKenzie , and S. Patel . Provably secure password-authenticated key exchange using Diffie-Hellman . In Proc. EUROCRYPT '00 , volume 1807 of LNCS , pages 156 -- 171 . Springer , 2000 .]] V. Boyko, P. MacKenzie, and S. Patel. Provably secure password-authenticated key exchange using Diffie-Hellman. In Proc. EUROCRYPT '00, volume 1807 of LNCS, pages 156--171. Springer, 2000.]]"},{"key":"e_1_3_2_1_7_1","first-page":"800","article-title":"Electronic authentication guideline","author":"Burr W.","year":"2004","unstructured":"W. Burr , D. Dodson , and W. Polk . Electronic authentication guideline . NIST Special Publication 800 - 863 , 2004 .]] W. Burr, D. Dodson, and W. Polk. Electronic authentication guideline. NIST Special Publication 800-63, 2004.]]","journal-title":"NIST Special Publication"},{"key":"e_1_3_2_1_8_1","first-page":"151","volume-title":"Proc. 13th USENIX Security Symposium","author":"Davis D.","year":"2004","unstructured":"D. Davis , F. Monrose , and M. Reiter . On user choice in graphic password schemes . In Proc. 13th USENIX Security Symposium , pages 151 -- 164 . USENIX, 2004 .]] D. Davis, F. Monrose, and M. Reiter. On user choice in graphic password schemes. In Proc. 13th USENIX Security Symposium, pages 151--164. USENIX, 2004.]]"},{"key":"e_1_3_2_1_9_1","volume-title":"Cryptography and Data Security","author":"Denning D.","year":"1982","unstructured":"D. Denning . Cryptography and Data Security . Addison-Wesley , 1982 .]] D. Denning. Cryptography and Data Security. Addison-Wesley, 1982.]]"},{"key":"e_1_3_2_1_10_1","series-title":"LNCS","first-page":"44","volume-title":"Proc. CRYPTO '89","author":"Feldmeier D. C.","year":"1989","unstructured":"D. C. Feldmeier and P. R. Karn . UNIX password security - ten years later . In Proc. CRYPTO '89 , volume 435 of LNCS , pages 44 -- 63 . Springer , 1989 .]] D. C. Feldmeier and P. R. Karn. UNIX password security - ten years later. In Proc. CRYPTO '89, volume 435 of LNCS, pages 44--63. Springer, 1989.]]"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/103418.103473"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/PROC.1973.9030"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/1102120.1102160"},{"key":"e_1_3_2_1_14_1","series-title":"LNCS","first-page":"408","volume-title":"Proc. CRYPTO '01","author":"Goldreich O.","year":"2001","unstructured":"O. Goldreich and Y. Lindell . Session-key generation using human random passwords . In Proc. CRYPTO '01 , volume 2139 of LNCS , pages 408 -- 432 . Springer , 2001 .]] O. Goldreich and Y. Lindell. Session-key generation using human random passwords. In Proc. CRYPTO '01, volume 2139 of LNCS, pages 408--432. Springer, 2001.]]"},{"key":"e_1_3_2_1_15_1","volume-title":"Proceedings of the 25th Annual Conference of the Cognitive Science Society","author":"Griffiths T. L.","year":"2003","unstructured":"T. L. Griffiths and J. B. Tenenbaum . Probability, algorithmic complexity, and subjective randomness . In Proceedings of the 25th Annual Conference of the Cognitive Science Society , 2003 .]] T. L. Griffiths and J. B. Tenenbaum. Probability, algorithmic complexity, and subjective randomness. In Proceedings of the 25th Annual Conference of the Cognitive Science Society, 2003.]]"},{"key":"e_1_3_2_1_16_1","first-page":"16","article-title":"From algorithmic to subjective randomness","author":"Griffiths T. L.","year":"2004","unstructured":"T. L. Griffiths and J. B. Tenenbaum . From algorithmic to subjective randomness . In Advances in Neural Information Processing Systems 16 , 2004 .]] T. L. Griffiths and J. B. Tenenbaum. From algorithmic to subjective randomness. In Advances in Neural Information Processing Systems 16, 2004.]]","journal-title":"Advances in Neural Information Processing Systems"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1980.1056220"},{"key":"e_1_3_2_1_18_1","first-page":"135","volume-title":"Proc. 8th USENIX Security Symposium","author":"Jermyn I.","year":"1999","unstructured":"I. Jermyn , A. Mayer , F. Monrose , M. Reiter , and A. Rubin . The design and analysis of graphical passwords . In Proc. 8th USENIX Security Symposium , pages 135 -- 150 . USENIX, 1999 .]] I. Jermyn, A. Mayer, F. Monrose, M. Reiter, and A. Rubin. The design and analysis of graphical passwords. In Proc. 8th USENIX Security Symposium, pages 135--150. USENIX, 1999.]]"},{"key":"e_1_3_2_1_19_1","series-title":"LNCS","first-page":"475","volume-title":"Proc. EUROCRYPT '01","author":"Katz J.","year":"2001","unstructured":"J. Katz , R. Ostrovsky , and M. Yung . Efficient password-authenticated key exchange using human-memorable passwords . In Proc. EUROCRYPT '01 , volume 2045 of LNCS , pages 475 -- 494 . Springer , 2001 .]] J. Katz, R. Ostrovsky, and M. Yung. Efficient password-authenticated key exchange using human-memorable passwords. In Proc. EUROCRYPT '01, volume 2045 of LNCS, pages 475--494. Springer, 2001.]]"},{"key":"e_1_3_2_1_20_1","volume-title":"The Washington Post","author":"Kerbs B.","year":"2005","unstructured":"B. Kerbs . DNA key to decoding human factor . The Washington Post , March 28, 2005 . http:\/\/www.washingtonpost.com\/wp-dyn\/articles\/A6098-2005Mar28.html.]] B. Kerbs. DNA key to decoding human factor. The Washington Post, March 28, 2005. http:\/\/www.washingtonpost.com\/wp-dyn\/articles\/A6098-2005Mar28.html.]]"},{"key":"e_1_3_2_1_21_1","volume-title":"FEAL-32 and Skipjack. IEICE Transactions on Fundamentals, E79-A(1):35--48","author":"Kusuda K.","year":"1996","unstructured":"K. Kusuda and T. Matsumoto . Optimization of time-memory trade-off cryptanalysis and its application to DES , FEAL-32 and Skipjack. IEICE Transactions on Fundamentals, E79-A(1):35--48 , 1996 .]] K. Kusuda and T. Matsumoto. Optimization of time-memory trade-off cryptanalysis and its application to DES, FEAL-32 and Skipjack. IEICE Transactions on Fundamentals, E79-A(1):35--48, 1996.]]"},{"key":"e_1_3_2_1_22_1","volume-title":"TIEICE: IEICE Transactions on Communications\/Electronics\/Information and Systems","author":"Kusuda K.","year":"1999","unstructured":"K. Kusuda and T. Matsumoto . Achieving higher success probability in time-memory trade-off cryptanalysis without increasing memory size . TIEICE: IEICE Transactions on Communications\/Electronics\/Information and Systems , 1999 .]] K. Kusuda and T. Matsumoto. Achieving higher success probability in time-memory trade-off cryptanalysis without increasing memory size. TIEICE: IEICE Transactions on Communications\/Electronics\/Information and Systems, 1999.]]"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.5555\/261084"},{"key":"e_1_3_2_1_24_1","volume-title":"Proc. Security Protocols Workshop","volume":"1361","author":"Lucks S.","year":"1997","unstructured":"S. Lucks . Open key exchange: how to defeat dictionary attacks without encrypting public keys . In Proc. Security Protocols Workshop , volume 1361 of em LNCS. Springer , 1997 .]] S. Lucks. Open key exchange: how to defeat dictionary attacks without encrypting public keys. In Proc. Security Protocols Workshop, volume 1361 of em LNCS. Springer, 1997.]]"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1037\/h0043158"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1007\/s102070100006"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/359168.359172"},{"key":"e_1_3_2_1_28_1","series-title":"LNCS","first-page":"617","volume-title":"Proc. CRYPTO '03","author":"Oechslin P.","year":"2003","unstructured":"P. Oechslin . Making a faster cryptanalytic time-memory trade-off . In Proc. CRYPTO '03 , volume 2729 of LNCS , pages 617 -- 630 . Springer , 2003 .]] P. Oechslin. Making a faster cryptanalytic time-memory trade-off. In Proc. CRYPTO '03, volume 2729 of LNCS, pages 617--630. Springer, 2003.]]"},{"key":"e_1_3_2_1_29_1","unstructured":"Openwall Project. John the Ripper password cracker. http:\/\/www.openwall.com\/john\/ 2005.]]  Openwall Project. John the Ripper password cracker. http:\/\/www.openwall.com\/john\/ 2005.]]"},{"key":"e_1_3_2_1_30_1","unstructured":"Openwall Project. Wordlists collection. http:\/\/www.openwall.com\/wordlists\/ 2005.]]  Openwall Project. Wordlists collection. http:\/\/www.openwall.com\/wordlists\/ 2005.]]"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/586110.586133"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1109\/5.18626"},{"key":"e_1_3_2_1_33_1","volume-title":"http:\/\/www.antsight.com\/zsl\/rainbowcrack\/","author":"Shuanglei Zhu","year":"2005","unstructured":"Zhu Shuanglei . Project RainbowCrack . http:\/\/www.antsight.com\/zsl\/rainbowcrack\/ , 2005 .]] Zhu Shuanglei. Project RainbowCrack. http:\/\/www.antsight.com\/zsl\/rainbowcrack\/, 2005.]]"},{"key":"e_1_3_2_1_34_1","first-page":"593","volume-title":"Proc. CHES 2002","volume":"2523","author":"Standaert F.","year":"2002","unstructured":"F. Standaert , G. Rouvroy , J.J. Quisquater , and J. Legat . A time\/memory tradeoff using distinguished points: new analysis and FPGA results . In Proc. CHES 2002 , volume 2523 of LNCS, pages 593 -- 609 . Springer , 2002 .]] F. Standaert, G. Rouvroy, J.J. Quisquater, and J. Legat. A time\/memory tradeoff using distinguished points: new analysis and FPGA results. In Proc. CHES 2002, volume 2523 of LNCS, pages 593--609. Springer, 2002.]]"},{"key":"e_1_3_2_1_35_1","series-title":"LNCS","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1007\/978-3-540-27809-2_5","volume-title":"Proc. Financial Cryptography","author":"Stubblebine S.","year":"2004","unstructured":"S. Stubblebine and P. van Oorschot . Addressing online dictionary attacks with login histories and humans-in-the-loop . In Proc. Financial Cryptography , volume 3110 of LNCS , pages 39 -- 53 . Springer , 2004 .]] S. Stubblebine and P. van Oorschot. Addressing online dictionary attacks with login histories and humans-in-the-loop. In Proc. Financial Cryptography, volume 3110 of LNCS, pages 39--53. Springer, 2004.]]"},{"key":"e_1_3_2_1_36_1","first-page":"135","volume-title":"Proc. 13th USENIX Security Symposium","author":"Thorpe J.","year":"2004","unstructured":"J. Thorpe and P. van Oorschot . Graphical dictionary and the memorable space of graphical passwords . In Proc. 13th USENIX Security Symposium , pages 135 -- 150 . USENIX, 2004 .]] J. Thorpe and P. van Oorschot. Graphical dictionary and the memorable space of graphical passwords. In Proc. 13th USENIX Security Symposium, pages 135--150. USENIX, 2004.]]"}],"event":{"name":"CCS05: 12th ACM Conference on Computer and Communications Security 2005","location":"Alexandria VA USA","acronym":"CCS05","sponsor":["SIGSAC ACM Special Interest Group on Security, Audit, and Control","ACM Association for Computing Machinery"]},"container-title":["Proceedings of the 12th ACM conference on Computer and communications security"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1102120.1102168","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1102120.1102168","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T16:08:07Z","timestamp":1750262887000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1102120.1102168"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,11,7]]},"references-count":36,"alternative-id":["10.1145\/1102120.1102168","10.1145\/1102120"],"URL":"https:\/\/doi.org\/10.1145\/1102120.1102168","relation":{},"subject":[],"published":{"date-parts":[[2005,11,7]]},"assertion":[{"value":"2005-11-07","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}