{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,29]],"date-time":"2026-01-29T12:41:25Z","timestamp":1769690485981,"version":"3.49.0"},"publisher-location":"Berlin, Heidelberg","reference-count":43,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783662530078","type":"print"},{"value":"9783662530085","type":"electronic"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-662-53008-5_9","type":"book-chapter","created":{"date-parts":[[2016,7,20]],"date-time":"2016-07-20T10:10:14Z","timestamp":1469009414000},"page":"241-271","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":39,"title":["Efficiently Computing Data-Independent Memory-Hard Functions"],"prefix":"10.1007","author":[{"given":"Jo\u00ebl","family":"Alwen","sequence":"first","affiliation":[]},{"given":"Jeremiah","family":"Blocki","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,7,21]]},"reference":[{"key":"9_CR1","unstructured":"Alwen, J., Blocki, J.: Efficiently computing data-independent memory-hard functions. Cryptology ePrint Archive, Report 2016\/115 (2016). http:\/\/eprint.iacr.org\/"},{"issue":"2","key":"9_CR2","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1145\/1064340.1064341","volume":"5","author":"M Abadi","year":"2005","unstructured":"Abadi, M., Burrows, M., Manasse, M., Wobber, T.: Moderately hard, memory-bound functions. ACM Trans. Internet Technol. 5(2), 299\u2013327 (2005)","journal-title":"ACM Trans. Internet Technol."},{"key":"9_CR3","unstructured":"Alwen, J., Chen, B., Kamath, C., Kolmogorov, V., Pietrzak, K., Tessaro, S.: On the complexity of scrypt and proofs of space in the parallel random oracle model. Cryptology ePrint Archive, Report 2016\/100 (2016). http:\/\/eprint.iacr.org\/"},{"key":"9_CR4","unstructured":"Alexander, S.: Password protection for modern operating systems. login, June 2004"},{"key":"9_CR5","unstructured":"Alwen, J., Serbinenko, V.: High parallel complexity graphs and memory-hard functions. In: Proceedings of the Eleventh Annual ACM Symposium on Theory of Computing, STOC 2015 (2015). http:\/\/eprint.iacr.org\/2014\/238"},{"key":"9_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1007\/11967668_18","volume-title":"Topics in Cryptology \u2013 CT-RSA 2007","author":"O Ac\u0131i\u00e7mez","year":"2006","unstructured":"Ac\u0131i\u00e7mez, O., Schindler, W., Ko\u00e7, \u00c7.K.: Cache based remote timing attack on the AES. In: Abe, M. (ed.) CT-RSA 2007. LNCS, vol. 4377, pp. 271\u2013286. Springer, Heidelberg (2006)"},{"key":"9_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"286","DOI":"10.1007\/978-3-642-15497-3_18","volume-title":"Computer Security \u2013 ESORICS 2010","author":"H Bojinov","year":"2010","unstructured":"Bojinov, H., Bursztein, E., Boyen, X., Boneh, D.: Kamouflage: loss-resistant password management. In: Gritzalis, D., Preneel, B., Theoharidou, M. (eds.) ESORICS 2010. LNCS, vol. 6345, pp. 286\u2013302. Springer, Heidelberg (2010)"},{"key":"9_CR8","doi-asserted-by":"crossref","unstructured":"Blocki, J., Blum, M., Datta, A.: Gotcha password hackers! In: Proceedings of the 2013 ACM Workshop on Artificial Intelligence and Security, pp. 25\u201334. ACM (2013)","DOI":"10.1145\/2517312.2517319"},{"key":"9_CR9","doi-asserted-by":"crossref","unstructured":"Blocki, J., Datta, A.: Cash: a cost asymmetric secure hash algorithm for optimal password protection. In: 29th IEEE Computer Security Foundations Symposium, CSF (2016, to appear)","DOI":"10.1109\/CSF.2016.33"},{"key":"9_CR10","unstructured":"Biryukov, A., Dinu, D., Khovratovich, D.: Fast and tradeoff-resilient memory-hard functions for cryptocurrencies and password hashing. Cryptology ePrint Archive, Report 2015\/430 (2015). http:\/\/eprint.iacr.org\/"},{"key":"9_CR11","unstructured":"Bernstein, D.J.: Cache-Timing Attacks on AES"},{"key":"9_CR12","unstructured":"Markus, B.: Dogecoin (2013)"},{"key":"9_CR13","unstructured":"Brainard, J.G., Juels, A., Kaliski, B., Szydlo, M.: A new two-server approach for authentication with short secrets. In: USENIX Security, vol. 3, pp. 201\u2013214 (2003)"},{"key":"9_CR14","unstructured":"Biryukov, A., Khovratovich, D.: Tradeoff cryptanalysis of memory-hard functions. Cryptology ePrint Archive, Report 2015\/227 (2015). http:\/\/eprint.iacr.org\/"},{"key":"9_CR15","doi-asserted-by":"crossref","unstructured":"Blocki, J., Komanduri, S., Procaccia, A., Sheffet, O.: Optimizing password composition policies. In: Proceedings of the Fourteenth ACM Conference on Electronic Commerce, pp. 105\u2013122. ACM (2013)","DOI":"10.1145\/2482540.2482552"},{"key":"9_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1007\/978-3-642-42045-0_17","volume-title":"Advances in Cryptology - ASIACRYPT 2013","author":"DJ Bernstein","year":"2013","unstructured":"Bernstein, D.J., Lange, T.: Non-uniform cracks in the concrete: the power of free precomputation. In: Sako, K., Sarkar, P. (eds.) ASIACRYPT 2013, Part II. LNCS, vol. 8270, pp. 321\u2013340. Springer, Heidelberg (2013)"},{"key":"9_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1007\/11894063_16","volume-title":"Cryptographic Hardware and Embedded Systems - CHES 2006","author":"J Bonneau","year":"2006","unstructured":"Bonneau, J., Mironov, I.: Cache-collision timing attacks against AES. In: Goubin, L., Matsui, M. (eds.) CHES 2006. LNCS, vol. 4249, pp. 201\u2013215. Springer, Heidelberg (2006)"},{"key":"9_CR18","doi-asserted-by":"crossref","unstructured":"Bonneau, J.: The science of guessing: analyzing an anonymized corpus of 70 million passwords. In: 2012 IEEE Symposium on Security and Privacy (SP), pp. 538\u2013552. IEEE (2012)","DOI":"10.1109\/SP.2012.49"},{"key":"9_CR19","unstructured":"Corrigan-Gibbs, H., Boneh, D., Schechter, S.: Balloon hashing: provably space-hard hash functions with data-independent access patterns. Cryptology ePrint Archive, Report 2016\/027 (2016). http:\/\/eprint.iacr.org\/"},{"key":"9_CR20","unstructured":"Lee, C.: Litecoin (2011)"},{"key":"9_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"160","DOI":"10.1007\/11818175_10","volume-title":"Advances in Cryptology - CRYPTO 2006","author":"R Canetti","year":"2006","unstructured":"Canetti, R., Halevi, S., Steiner, M.: Mitigating dictionary attacks on password-protected local storage. In: Dwork, C. (ed.) CRYPTO 2006. LNCS, vol. 4117, pp. 160\u2013179. Springer, Heidelberg (2006)"},{"key":"9_CR22","doi-asserted-by":"crossref","unstructured":"Camenisch, J., Lysyanskaya, A., Neven, G.: Practical yet universally composable two-server password-authenticated secret sharing. In: Proceedings of the 2012 ACM Conference on Computer and Communications Security, pp. 525\u2013536. ACM (2012)","DOI":"10.1145\/2382196.2382252"},{"key":"9_CR23","doi-asserted-by":"crossref","unstructured":"Daher, W., Canetti, R.: Posh: a generalized captcha with security applications. In: Proceedings of the 1st ACM workshop on Workshop on AISec, pp. 1\u201310. ACM (2008)","DOI":"10.1145\/1456377.1456379"},{"key":"9_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"426","DOI":"10.1007\/978-3-540-45146-4_25","volume-title":"Advances in Cryptology - CRYPTO 2003","author":"C Dwork","year":"2003","unstructured":"Dwork, C., Goldberg, A.V., Naor, M.: On memory-bound functions for fighting spam. In: Boneh, D. (ed.) CRYPTO 2003. LNCS, vol. 2729, pp. 426\u2013444. Springer, Heidelberg (2003)"},{"key":"9_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1007\/11535218_3","volume-title":"Advances in Cryptology \u2013 CRYPTO 2005","author":"C Dwork","year":"2005","unstructured":"Dwork, C., Naor, M., Wee, H.: Pebbling and proofs of work. In: Shoup, V. (ed.) CRYPTO 2005. LNCS, vol. 3621, pp. 37\u201354. Springer, Heidelberg (2005)"},{"key":"9_CR26","unstructured":"Erdoes, P., Graham, R.L., Szemeredi, E.: On sparse graphs with dense long paths. Technical report, Stanford, CA, USA (1975)"},{"key":"9_CR27","doi-asserted-by":"crossref","unstructured":"Flor\u00eancio, D., Herley, C.: Where do security policies come from? In: Proceedings of SOUPS, p. 10 (2010)","DOI":"10.1145\/1837110.1837124"},{"key":"9_CR28","unstructured":"Forler, C., Lucks, S., Wenzel, J.: Catena: A memory-consuming password scrambler. IACR Cryptology ePrint Archive 2013:525 (2013)"},{"key":"9_CR29","doi-asserted-by":"crossref","unstructured":"Juels, A., Rivest, R.L.: Honeywords: making password-cracking detectable. In: Proceedings of the 2012 ACM Conference on Computer and Communications Security. ACM (2013)","DOI":"10.1145\/2508859.2516671"},{"key":"9_CR30","doi-asserted-by":"crossref","unstructured":"Kaliski, B.: Pkcs# 5: Password-based cryptography specification version 2.0 (2000)","DOI":"10.17487\/rfc2898"},{"key":"9_CR31","doi-asserted-by":"crossref","unstructured":"Komanduri, S., Shay, R., Kelley, P.G., Mazurek, M.L., Bauer, L., Christin, N., Cranor, L.F., Egelman, S.: Of passwords and people: measuring the effect of password-composition policies. In: Proceedings of the 2011 Annual Conference on Human Factors in Computing Systems, pp. 2595\u20132604. ACM (2011)","DOI":"10.1145\/1978942.1979321"},{"issue":"4","key":"9_CR32","doi-asserted-by":"publisher","first-page":"1087","DOI":"10.1145\/322344.322354","volume":"29","author":"T Lengauer","year":"1982","unstructured":"Lengauer, T., Tarjan, R.E.: Asymptotically tight bounds on time-space trade-offs in a pebble game. J. ACM (JACM) 29(4), 1087\u20131130 (1982)","journal-title":"J. ACM (JACM)"},{"issue":"2","key":"9_CR33","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1016\/0167-4048(96)00003-X","volume":"15","author":"U Manber","year":"1996","unstructured":"Manber, U.: A simple scheme to make passwords based on one-way functions much harder to crack. Comput. Secur. 15(2), 171\u2013176 (1996)","journal-title":"Comput. Secur."},{"key":"9_CR34","doi-asserted-by":"crossref","unstructured":"Mahmoody, M., Moran, T., Vadhan, S.P.: Publicly verifiable proofs of sequential work. In: Kleinberg, R.D. (ed.) Innovations in Theoretical Computer Science, ITCS 2013, Berkeley, CA, USA, 9\u201312 January 2013, pp. 373\u2013388. ACM (2013)","DOI":"10.1145\/2422436.2422479"},{"issue":"11","key":"9_CR35","doi-asserted-by":"publisher","first-page":"594","DOI":"10.1145\/359168.359172","volume":"22","author":"R Morris","year":"1979","unstructured":"Morris, R., Thompson, K.: Password security: a case history. Commun. ACM 22(11), 594\u2013597 (1979)","journal-title":"Commun. ACM"},{"key":"9_CR36","unstructured":"Narayanan, A., Bonneau, J., Felten, E.W., Miller, A., Goldfeder, S.: Bitcoin and Cryptocurrency Technology (manuscript) (2015). Accessed 6 Aug 2015"},{"key":"9_CR37","unstructured":"Percival, C.: Stronger key derivation via sequential memory-hard functions. In: BSDCan 2009 (2009)"},{"key":"9_CR38","unstructured":"Password hashing competition. https:\/\/password-hashing.net\/"},{"key":"9_CR39","unstructured":"Provos, N., Mazieres, D.: Bcrypt algorithm"},{"key":"9_CR40","first-page":"199","volume-title":"Proceedings of the 2009 ACM Conference on Computer and Communications Security, CCS 2009","author":"T Ristenpart","year":"2009","unstructured":"Ristenpart, T., Tromer, E., Shacham, H., Savage, S.: Hey, you, get off of my cloud: exploring information leakage in third-party compute clouds. In: Al-Shaer, E., Jha, S., Keromytis, A.D. (eds.) Proceedings of the 2009 ACM Conference on Computer and Communications Security, CCS 2009, pp. 199\u2013212. ACM, New York (2009)"},{"key":"9_CR41","unstructured":"Scarfone, K., Souppaya, M.: Nist special publication 800\u2013118: Guide to enterprise password management (draft), April 2009"},{"key":"9_CR42","doi-asserted-by":"crossref","unstructured":"Thompson, C.D.: Area-time complexity for VLSI. In: Fischer, M.J., DeMillo, R.A., Lynch, N.A., Burkhard, W.A., Aho, A.V. (eds.) Proceedings of the 11h Annual ACM Symposium on Theory of Computing, 30 April - 2 May 1979, Atlanta, Georgia, USA, pp. 81\u201388. ACM, New York (1979)","DOI":"10.1145\/800135.804401"},{"key":"9_CR43","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"162","DOI":"10.1007\/3-540-08353-7_135","volume-title":"Mathematical Foundations of Computer Science 1977","author":"LG Valiant","year":"1977","unstructured":"Valiant, L.G.: Graph-theoretic arguments in low-level complexity. In: Gruska, J. (ed.) MFCS 1977. LNCS, vol. 53, pp. 162\u2013176. Springer, Heidelberg (1977)"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 CRYPTO 2016"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-53008-5_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,4]],"date-time":"2025-06-04T03:00:54Z","timestamp":1749006054000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-53008-5_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783662530078","9783662530085"],"references-count":43,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-53008-5_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016]]},"assertion":[{"value":"21 July 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CRYPTO","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Annual International Cryptology Conference","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Santa Barbara","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2016","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 August 2016","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 August 2016","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"36","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"crypto2016","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}