{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T17:49:57Z","timestamp":1725731397564},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642390586"},{"type":"electronic","value":"9783642390593"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-39059-3_27","type":"book-chapter","created":{"date-parts":[[2013,6,13]],"date-time":"2013-06-13T21:33:17Z","timestamp":1371159197000},"page":"388-402","source":"Crossref","is-referenced-by-count":0,"title":["Count-Min Sketches for Estimating Password Frequency within Hamming Distance Two"],"prefix":"10.1007","author":[{"given":"Leah","family":"South","sequence":"first","affiliation":[]},{"given":"Douglas","family":"Stebila","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"1","key":"27_CR1","first-page":"67","volume":"4","author":"F. Bergadano","year":"1997","unstructured":"Bergadano, F., Crispo, B., Ruffo, G.: Proactive password checking with decision trees. Computer and Communications Security\u00a04(1), 67\u201377 (1997)","journal-title":"Computer and Communications Security"},{"issue":"7","key":"27_CR2","doi-asserted-by":"publisher","first-page":"422","DOI":"10.1145\/362686.362692","volume":"13","author":"B.H. Bloom","year":"1970","unstructured":"Bloom, B.H.: Space\/time trade-offs in hash coding with allowable errors. Communications of the ACM\u00a013(7), 422\u2013426 (1970)","journal-title":"Communications of the ACM"},{"key":"27_CR3","doi-asserted-by":"crossref","unstructured":"Bonneau, J.: The science of guessing: analyzing an anonymized corpus of 70 million passwords. In: Proc. 2012 IEEE Symposium on Security and Privacy, S&P (2012)","DOI":"10.1109\/SP.2012.49"},{"issue":"2","key":"27_CR4","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1016\/0022-0000(79)90044-8","volume":"18","author":"J. Lawrence Carter","year":"1979","unstructured":"Lawrence Carter, J., Wegman, M.N.: Universal classes of hash functions. Journal of Computer and System Sciences\u00a018(2), 143\u2013154 (1979)","journal-title":"Journal of Computer and System Sciences"},{"issue":"1","key":"27_CR5","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1016\/j.jalgor.2003.12.001","volume":"55","author":"G. Cormode","year":"2005","unstructured":"Cormode, G., Muthukrishnan, S.: An improved data stream summary: the count-min sketch and its applications. Journal of Algorithms\u00a055(1), 58\u201375 (2005)","journal-title":"Journal of Algorithms"},{"issue":"1","key":"27_CR6","doi-asserted-by":"publisher","first-page":"64","DOI":"10.1109\/MS.2011.127","volume":"29","author":"G. Cormode","year":"2012","unstructured":"Cormode, G., Muthukrishnan, S.: Approximating data with the count-min sketch. IEEE Software\u00a029(1), 64\u201369 (2012)","journal-title":"IEEE Software"},{"issue":"1","key":"27_CR7","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1016\/0020-0190(94)00032-8","volume":"50","author":"U. Manber","year":"1994","unstructured":"Manber, U., Wu, S.: An algorithm for approximate membership checking with application to password security. Information Processing Letters\u00a050(1), 191\u2013197 (1994)","journal-title":"Information Processing Letters"},{"key":"27_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1007\/3-540-44495-5_7","volume-title":"Progress in Cryptology - INDOCRYPT 2000","author":"J.O. Pliam","year":"2000","unstructured":"Pliam, J.O.: On the incomparability of entropy and marginal guesswork in brute-force attacks. In: Roy, B., Okamoto, E. (eds.) INDOCRYPT 2000. LNCS, vol.\u00a01977, pp. 67\u201379. Springer, Heidelberg (2000)"},{"key":"27_CR9","unstructured":"Schechter, S., Herley, C., Mitzenmacher, M.: Popularity is everything: A new approach to protecting passwords from statistical guessing attacks. In: Proc. 5th USENIX Conference on Hot Topics in Security, HotSec (2010)"},{"key":"27_CR10","unstructured":"Spafford, E.: Preventing weak password choices. Purdue University Computer Science Technical Reports, paper 875, report number 91-028 (1991), \n                    \n                      http:\/\/docs.lib.purdue.edu\/cstech\/875"}],"container-title":["Lecture Notes in Computer Science","Information Security and Privacy"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-39059-3_27","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,13]],"date-time":"2019-05-13T23:49:00Z","timestamp":1557791340000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-39059-3_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642390586","9783642390593"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-39059-3_27","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}