{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T22:49:37Z","timestamp":1725835777570},"publisher-location":"Cham","reference-count":6,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319241913"},{"type":"electronic","value":"9783319241920"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-24192-0_9","type":"book-chapter","created":{"date-parts":[[2015,10,27]],"date-time":"2015-10-27T05:05:35Z","timestamp":1445922335000},"page":"138-145","source":"Crossref","is-referenced-by-count":0,"title":["Private Password Auditing"],"prefix":"10.1007","author":[{"given":"Amrit","family":"Kumar","sequence":"first","affiliation":[]},{"given":"C\u00e9dric","family":"Lauradoux","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,12,9]]},"reference":[{"unstructured":"Tilley, R.B.: Blackhash software. \n                      http:\/\/16s.us\/software\/Blackhash\/","key":"9_CR1"},{"key":"9_CR2","doi-asserted-by":"publisher","first-page":"422","DOI":"10.1145\/362686.362692","volume":"13","author":"BH Bloom","year":"1970","unstructured":"Bloom, B.H.: Space\/time trade-offs in hash coding with allowable errors. Commun. ACM 13, 422\u2013426 (1970)","journal-title":"Commun. ACM"},{"key":"9_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"218","DOI":"10.1007\/978-3-642-35404-5_17","volume-title":"Cryptology and Network Security","author":"E Cristofaro De","year":"2012","unstructured":"De Cristofaro, E., Gasti, P., Tsudik, G.: Fast and private computation of cardinality of set intersection and union. In: Pieprzyk, J., Sadeghi, A.-R., Manulis, M. (eds.) CANS 2012. LNCS, vol. 7712, pp. 218\u2013231. Springer, Heidelberg (2012)"},{"key":"9_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1007\/978-3-642-30921-2_4","volume-title":"Trust and Trustworthy Computing","author":"E De Cristofaro","year":"2012","unstructured":"De Cristofaro, E., Tsudik, G.: Experimenting with fast private set intersection. In: Katzenbeisser, S., Weippl, E., Camp, L.J., Volkamer, M., Reiter, M., Zhang, X. (eds.) Trust 2012. LNCS, vol. 7344, pp. 55\u201373. Springer, Heidelberg (2012)"},{"key":"9_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1007\/978-3-319-15618-7_10","volume-title":"Engineering Secure Software and Systems","author":"M D\u00fcrmuth","year":"2015","unstructured":"D\u00fcrmuth, M., Angelstorf, F., Castelluccia, C., Perito, D., Chaabane, A.: OMEN: faster password guessing using an ordered Markov enumerator. In: Piessens, F., Caballero, J., Bielova, N. (eds.) ESSoS 2015. LNCS, vol. 8978, pp. 119\u2013132. Springer, Heidelberg (2015)"},{"doi-asserted-by":"crossref","unstructured":"Narayanan, A., Shmatikov, V.: Fast dictionary attacks on passwords using time-space tradeoff. In: Proceedings of the 12th ACM Conference on Computer and Communications Security, CCS 2005, pp. 364\u2013372. ACM, New York (2005)","key":"9_CR6","DOI":"10.1145\/1102120.1102168"}],"container-title":["Lecture Notes in Computer Science","Technology and Practice of Passwords"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-24192-0_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T05:58:49Z","timestamp":1559282329000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-24192-0_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319241913","9783319241920"],"references-count":6,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-24192-0_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]}}}