{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,21]],"date-time":"2025-12-21T01:36:56Z","timestamp":1766281016572,"version":"build-2065373602"},"publisher-location":"Cham","reference-count":19,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031159817"},{"type":"electronic","value":"9783031159824"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-15982-4_8","type":"book-chapter","created":{"date-parts":[[2022,10,11]],"date-time":"2022-10-11T04:40:54Z","timestamp":1665463254000},"page":"222-251","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Sustained Space and\u00a0Cumulative Complexity Trade-Offs for\u00a0Data-Dependent Memory-Hard Functions"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5542-4674","authenticated-orcid":false,"given":"Jeremiah","family":"Blocki","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3638-163X","authenticated-orcid":false,"given":"Blake","family":"Holman","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,10,12]]},"reference":[{"key":"8_CR1","unstructured":"Password hashing competition (2015). https:\/\/www.password-hashing.net\/"},{"key":"8_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1007\/978-3-662-53008-5_9","volume-title":"Advances in Cryptology \u2013 CRYPTO 2016","author":"J Alwen","year":"2016","unstructured":"Alwen, J., Blocki, J.: Efficiently computing data-independent memory-hard functions. In: Robshaw, M., Katz, J. (eds.) CRYPTO 2016, Part II. LNCS, vol. 9815, pp. 241\u2013271. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-53008-5_9"},{"key":"8_CR3","doi-asserted-by":"crossref","unstructured":"Alwen, J., Blocki, J., Harsha, B.: Practical graphs for optimal side-channel resistant memory-hard functions. In: Thuraisingham, B.M., Evans, D., Malkin, T., Xu, D. (eds.) ACM CCS 2017: 24th Conference on Computer and Communications Security, 31 October\u20132 November 2017, pp. 1001\u20131017. ACM Press (2017)","DOI":"10.1145\/3133956.3134031"},{"key":"8_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-319-56617-7_1","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2017","author":"J Alwen","year":"2017","unstructured":"Alwen, J., Blocki, J., Pietrzak, K.: Depth-robust graphs and their cumulative memory complexity. In: Coron, J.-S., Nielsen, J.B. (eds.) EUROCRYPT 2017, Part III. LNCS, vol. 10212, pp. 3\u201332. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-56617-7_1"},{"key":"8_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1007\/978-3-319-78375-8_4","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2018","author":"J Alwen","year":"2018","unstructured":"Alwen, J., Blocki, J., Pietrzak, K.: Sustained space complexity. In: Nielsen, J.B., Rijmen, V. (eds.) EUROCRYPT 2018, Part II. LNCS, vol. 10821, pp. 99\u2013130. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-78375-8_4"},{"key":"8_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/978-3-319-56617-7_2","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2017","author":"J Alwen","year":"2017","unstructured":"Alwen, J., Chen, B., Pietrzak, K., Reyzin, L., Tessaro, S.: Scrypt is maximally memory-hard. In: Coron, J.-S., Nielsen, J.B. (eds.) EUROCRYPT 2017, Part III. LNCS, vol. 10212, pp. 33\u201362. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-56617-7_2"},{"key":"8_CR7","doi-asserted-by":"crossref","unstructured":"Alwen, J., Serbinenko, V.: High parallel complexity graphs and memory-hard functions. In: Servedio, R.A., Rubinfeld, R. (eds.) 47th Annual ACM Symposium on Theory of Computing, 14\u201317 June 2015, pp. 595\u2013603. ACM Press (2015)","DOI":"10.1145\/2746539.2746622"},{"key":"8_CR8","doi-asserted-by":"publisher","unstructured":"Alwen, J., Blocki, J.: Towards practical attacks on argon2i and balloon hashing. In: 2017 IEEE European Symposium on Security and Privacy (EuroS P), pp. 142\u2013157 (2017). https:\/\/doi.org\/10.1109\/EuroSP.2017.47","DOI":"10.1109\/EuroSP.2017.47"},{"key":"8_CR9","unstructured":"Ameri, M.H., Blocki, J., Zhou, S.: Computationally data-independent memory hard functions. In: Vidick, T. (ed.) ITCS 2020: 11th Innovations in Theoretical Computer Science Conference, 12\u201314 January 2020, vol. 151, pp. 36:1\u201336:28. LIPIcs (2020)"},{"key":"8_CR10","doi-asserted-by":"crossref","unstructured":"Biryukov, A., Dinu, D., Khovratovich, D.: Argon2: new generation of memory-hard functions for password hashing and other applications. In: 2016 IEEE European Symposium on Security and Privacy (EuroS &P), pp. 292\u2013302. IEEE (2016)","DOI":"10.1109\/EuroSP.2016.31"},{"key":"8_CR11","unstructured":"Blocki, J., Cinkoske, M.: A new connection between node and edge depth robust graphs. In: Lee, J.R. (ed.) ITCS 2021: 12th Innovations in Theoretical Computer Science Conference, 6\u20138 January 2021, vol. 185, pp. 64:1\u201364:18. LIPIcs (2021)"},{"key":"8_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"573","DOI":"10.1007\/978-3-030-26951-7_20","volume-title":"Advances in Cryptology \u2013 CRYPTO 2019","author":"J Blocki","year":"2019","unstructured":"Blocki, J., Harsha, B., Kang, S., Lee, S., Xing, L., Zhou, S.: Data-independent memory hard functions: new attacks and stronger constructions. In: Boldyreva, A., Micciancio, D. (eds.) CRYPTO 2019, Part II. LNCS, vol. 11693, pp. 573\u2013607. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-26951-7_20"},{"key":"8_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"445","DOI":"10.1007\/978-3-319-70500-2_15","volume-title":"Theory of Cryptography","author":"J Blocki","year":"2017","unstructured":"Blocki, J., Zhou, S.: On the depth-robustness and cumulative pebbling cost of Argon2i. In: Kalai, Y., Reyzin, L. (eds.) TCC 2017, Part I. LNCS, vol. 10677, pp. 445\u2013465. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-70500-2_15"},{"issue":"3\u20134","key":"8_CR14","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1016\/0898-1221(75)90037-1","volume":"1","author":"P Erd\u00f6s","year":"1975","unstructured":"Erd\u00f6s, P., Graham, R.L., Szemer\u00e9di, E.: On sparse graphs with dense long paths. Comput. Math. Appl. 1(3\u20134), 365\u2013369 (1975)","journal-title":"Comput. Math. Appl."},{"issue":"2","key":"8_CR15","doi-asserted-by":"publisher","first-page":"332","DOI":"10.1145\/322003.322015","volume":"24","author":"J Hopcroft","year":"1977","unstructured":"Hopcroft, J., Paul, W., Valiant, L.: On time versus space. J. ACM (JACM) 24(2), 332\u2013337 (1977)","journal-title":"J. ACM (JACM)"},{"key":"8_CR16","unstructured":"Lee, C.: Litecoin (2011)"},{"key":"8_CR17","doi-asserted-by":"publisher","unstructured":"Lengauer, T., Tarjan, R.E.: Upper and lower bounds on time-space tradeoffs. In: Proceedings of the Eleventh Annual ACM Symposium on Theory of Computing, STOC 1979, New York, NY, USA, pp. 262\u2013277. Association for Computing Machinery (1979). https:\/\/doi.org\/10.1145\/800135.804420","DOI":"10.1145\/800135.804420"},{"key":"8_CR18","unstructured":"Percival, C.: Stronger key derivation via sequential memory-hard functions, January 2009"},{"key":"8_CR19","doi-asserted-by":"crossref","unstructured":"Schnitger, G.: On depth-reduction and grates. In: 24th Annual Symposium on Foundations of Computer Science, 7\u20139 November 1983, pp. 323\u2013328. IEEE Computer Society Press (1983)","DOI":"10.1109\/SFCS.1983.38"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 CRYPTO 2022"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-15982-4_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T22:04:30Z","timestamp":1760133870000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-15982-4_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031159817","9783031159824"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-15982-4_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"12 October 2022","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, CA","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":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 August 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 August 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"42","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"crypto2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/crypto.iacr.org\/2022\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}