{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,11]],"date-time":"2026-01-11T22:58:58Z","timestamp":1768172338043,"version":"3.49.0"},"publisher-location":"Cham","reference-count":37,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031587337","type":"print"},{"value":"9783031587344","type":"electronic"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2024]]},"DOI":"10.1007\/978-3-031-58734-4_11","type":"book-chapter","created":{"date-parts":[[2024,4,30]],"date-time":"2024-04-30T15:12:08Z","timestamp":1714489928000},"page":"315-344","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Trapdoor Memory-Hard Functions"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7553-6606","authenticated-orcid":false,"given":"Benedikt","family":"Auerbach","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0009-0001-5790-695X","authenticated-orcid":false,"given":"Christoph U.","family":"G\u00fcnther","sequence":"additional","affiliation":[]},{"given":"Krzysztof","family":"Pietrzak","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,5,1]]},"reference":[{"key":"11_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"357","DOI":"10.1007\/978-3-319-70697-9_13","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2017","author":"H Abusalah","year":"2017","unstructured":"Abusalah, H., Alwen, J., Cohen, B., Khilko, D., Pietrzak, K., Reyzin, L.: Beyond Hellman\u2019s time-memory trade-offs with applications to proofs of space. In: Takagi, T., Peyrin, T. (eds.) ASIACRYPT 2017. LNCS, vol. 10625, pp. 357\u2013379. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-70697-9_13"},{"key":"11_CR2","doi-asserted-by":"publisher","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, pp. 1001\u20131017. ACM Press (2017). https:\/\/doi.org\/10.1145\/3133956.3134031","DOI":"10.1145\/3133956.3134031"},{"key":"11_CR3","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. LNCS, vol. 10212, pp. 3\u201332. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-56617-7_1"},{"key":"11_CR4","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. LNCS, vol. 10821, pp. 99\u2013130. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-78375-8_4"},{"key":"11_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"358","DOI":"10.1007\/978-3-662-49896-5_13","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2016","author":"J Alwen","year":"2016","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. In: Fischlin, M., Coron, J.-S. (eds.) EUROCRYPT 2016. LNCS, vol. 9666, pp. 358\u2013387. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-49896-5_13"},{"key":"11_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. LNCS, vol. 10212, pp. 33\u201362. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-56617-7_2"},{"key":"11_CR7","doi-asserted-by":"publisher","unstructured":"Alwen, J., Serbinenko, V.: High parallel complexity graphs and memory-hard functions. In: Servedio, R.A., Rubinfeld, R. (eds.) 47th ACM STOC, pp. 595\u2013603. ACM Press (2015). https:\/\/doi.org\/10.1145\/2746539.2746622","DOI":"10.1145\/2746539.2746622"},{"key":"11_CR8","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1007\/978-3-031-14791-3_3","volume-title":"Security and Cryptography for Networks","author":"MH Ameri","year":"2022","unstructured":"Ameri, M.H., Block, A.R., Blocki, J.: Memory-hard puzzles in the standard model with applications to memory-hard functions and resource-bounded locally decodable codes. In: Galdi, C., Jarecki, S. (eds.) Security and Cryptography for Networks, pp. 45\u201368. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-14791-3_3"},{"key":"11_CR9","doi-asserted-by":"publisher","unstructured":"Ameri, M.H., Blocki, J., Zhou, S.: Computationally data-independent memory hard functions. In: Vidick, T. (ed.) ITCS 2020. vol.\u00a0151, pp. 36:1\u201336:28. LIPIcs (2020). https:\/\/doi.org\/10.4230\/LIPIcs.ITCS.2020.36","DOI":"10.4230\/LIPIcs.ITCS.2020.36"},{"key":"11_CR10","unstructured":"Auerbach, B., G\u00fcnther, C.U., Pietrzak, K.: Trapdoor memory-hard functions. Cryptology ePrint Archive, Paper 2024\/312 (2024). https:\/\/eprint.iacr.org\/2024\/312"},{"key":"11_CR11","doi-asserted-by":"publisher","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 (2016). https:\/\/doi.org\/10.1109\/EuroSP.2016.31","DOI":"10.1109\/EuroSP.2016.31"},{"key":"11_CR12","unstructured":"Biryukov, A., Lombard-Platet, M.: Pured: a unified framework for resource-hard functions. Cryptology ePrint Archive, Paper 2023\/1809 (2023). https:\/\/eprint.iacr.org\/2023\/1809"},{"key":"11_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"417","DOI":"10.1007\/978-3-319-70700-6_15","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2017","author":"A Biryukov","year":"2017","unstructured":"Biryukov, A., Perrin, L.: Symmetrically and asymmetrically hard cryptography. In: Takagi, T., Peyrin, T. (eds.) ASIACRYPT 2017. LNCS, vol. 10626, pp. 417\u2013445. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-70700-6_15"},{"key":"11_CR14","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. LNCS, vol. 11693, pp. 573\u2013607. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-26951-7_20"},{"key":"11_CR15","doi-asserted-by":"publisher","unstructured":"Blocki, J., Holman, B.: Sustained space and cumulative complexity trade-offs for data-dependent memory-hard functions. In: Dodis, Y., Shrimpton, T. (eds.) CRYPTO\u00a02022, Part\u00a0III. LNCS, vol. 13509, pp. 222\u2013251. Springer, Heidelberg (2022). https:\/\/doi.org\/10.1007\/978-3-031-15982-4_8","DOI":"10.1007\/978-3-031-15982-4_8"},{"key":"11_CR16","doi-asserted-by":"publisher","unstructured":"Blocki, J., Ren, L., Zhou, S.: Bandwidth-hard functions: reductions and lower bounds. In: Lie, D., Mannan, M., Backes, M., Wang, X. (eds.) ACM CCS 2018, pp. 1820\u20131836. ACM Press (2018). https:\/\/doi.org\/10.1145\/3243734.3243773","DOI":"10.1145\/3243734.3243773"},{"key":"11_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"220","DOI":"10.1007\/978-3-662-53887-6_8","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2016","author":"D Boneh","year":"2016","unstructured":"Boneh, D., Corrigan-Gibbs, H., Schechter, S.: Balloon hashing: a memory-hard function providing provable protection against sequential attacks. In: Cheon, J.H., Takagi, T. (eds.) ASIACRYPT 2016. LNCS, vol. 10031, pp. 220\u2013248. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-53887-6_8"},{"key":"11_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"415","DOI":"10.1007\/978-3-319-78375-8_14","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2018","author":"H Corrigan-Gibbs","year":"2018","unstructured":"Corrigan-Gibbs, H., Kogan, D.: The discrete-logarithm problem with\u00a0preprocessing. In: Nielsen, J.B., Rijmen, V. (eds.) EUROCRYPT 2018. LNCS, vol. 10821, pp. 415\u2013447. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-78375-8_14"},{"key":"11_CR19","doi-asserted-by":"publisher","unstructured":"Costa, S., Dalai, M., Della Fiore, S.: Variations on the Erd\u0151s distinct-sums problem. Discrete Appl. Math. 325, 172\u2013185 (2021). https:\/\/doi.org\/10.1016\/j.dam.2022.10.015, https:\/\/www.sciencedirect.com\/science\/article\/pii\/S0166218X22004103","DOI":"10.1016\/j.dam.2022.10.015"},{"key":"11_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"649","DOI":"10.1007\/978-3-642-14623-7_35","volume-title":"Advances in Cryptology \u2013 CRYPTO 2010","author":"A De","year":"2010","unstructured":"De, A., Trevisan, L., Tulsiani, M.: Time space tradeoffs for attacks against one-way functions and PRGs. In: Rabin, T. (ed.) CRYPTO 2010. LNCS, vol. 6223, pp. 649\u2013665. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-14623-7_35"},{"key":"11_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1007\/3-540-48071-4_10","volume-title":"Advances in Cryptology \u2014 CRYPTO\u2019 92","author":"C Dwork","year":"1993","unstructured":"Dwork, C., Naor, M.: Pricing via processing or combatting junk mail. In: Brickell, E.F. (ed.) CRYPTO 1992. LNCS, vol. 740, pp. 139\u2013147. Springer, Heidelberg (1993). https:\/\/doi.org\/10.1007\/3-540-48071-4_10"},{"key":"11_CR22","doi-asserted-by":"publisher","unstructured":"von\u00a0zur Gathen, J., Shparlinski, I.E.: Generating safe primes. J. Math. Cryptol. 7(4), 333\u2013365 (2013). https:\/\/doi.org\/10.1515\/jmc-2013-5011","DOI":"10.1515\/jmc-2013-5011"},{"key":"11_CR23","doi-asserted-by":"publisher","unstructured":"Guy, R.K.: Unsolved Problems in Number Theory. Problem Books in Mathematics. Springer, New York, NY, 2 edn. (1994). https:\/\/doi.org\/10.1007\/978-1-4899-3585-4","DOI":"10.1007\/978-1-4899-3585-4"},{"key":"11_CR24","doi-asserted-by":"publisher","unstructured":"Hermite, C.: Sur l\u2019introduction des variables continues dans la th\u00e9orie des nombres, Cambridge Library Collection - Mathematics, vol.\u00a01, pp. 164\u2013192. Cambridge University Press (2009). https:\/\/doi.org\/10.1017\/CBO9780511702754.015","DOI":"10.1017\/CBO9780511702754.015"},{"key":"11_CR25","doi-asserted-by":"crossref","unstructured":"Kaliski, B.: Pkcs# 5: Password-based cryptography specification version 2.0. Request for Comments\u00a02898, Internet Engineering Task Force (September 2000). https:\/\/www.rfc-editor.org\/rfc\/rfc2898.html","DOI":"10.17487\/rfc2898"},{"key":"11_CR26","doi-asserted-by":"crossref","unstructured":"Katz, J., Lindell, Y.: Introduction to Modern Cryptography, 2nd edn. Chapman & Hall\/CRC (2014)","DOI":"10.1201\/b17668"},{"key":"11_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"390","DOI":"10.1007\/978-3-030-64381-2_14","volume-title":"Theory of Cryptography","author":"J Katz","year":"2020","unstructured":"Katz, J., Loss, J., Xu, J.: On the security of time-lock puzzles and timed commitments. In: Pass, R., Pietrzak, K. (eds.) TCC 2020. LNCS, vol. 12552, pp. 390\u2013413. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-64381-2_14"},{"key":"11_CR28","doi-asserted-by":"publisher","unstructured":"Lazebnik, F.: On systems of linear diophantine equations. Math. Mag. 69(4), 261\u2013266 (1996). https:\/\/doi.org\/10.2307\/2690528, http:\/\/www.jstor.org\/stable\/2690528","DOI":"10.2307\/2690528"},{"key":"11_CR29","doi-asserted-by":"publisher","unstructured":"Micciancio, D., Warinschi, B.: A linear space algorithm for computing the hermite normal form. In: Proceedings of the 2001 International Symposium on Symbolic and Algebraic Computation, pp. 231\u2013236. ISSAC 2001. Association for Computing Machinery, New York (2001). https:\/\/doi.org\/10.1145\/384101.384133","DOI":"10.1145\/384101.384133"},{"key":"11_CR30","unstructured":"Percival, C.: Stronger key derivation via sequential memory-hard functions. In: BSDCan 2009 (2009)"},{"key":"11_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"262","DOI":"10.1007\/978-3-662-53641-4_11","volume-title":"Theory of Cryptography","author":"L Ren","year":"2016","unstructured":"Ren, L., Devadas, S.: Proof of space from stacked expanders. In: Hirt, M., Smith, A. (eds.) TCC 2016. LNCS, vol. 9985, pp. 262\u2013285. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-53641-4_11"},{"key":"11_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"466","DOI":"10.1007\/978-3-319-70500-2_16","volume-title":"Theory of Cryptography","author":"L Ren","year":"2017","unstructured":"Ren, L., Devadas, S.: Bandwidth hard functions for ASIC resistance. In: Kalai, Y., Reyzin, L. (eds.) TCC 2017. LNCS, vol. 10677, pp. 466\u2013492. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-70500-2_16"},{"key":"11_CR33","unstructured":"Rivest, R.L., Shamir, A., Wagner, D.A.: Time-lock puzzles and timed-release crypto. Tech. rep, USA (1996)"},{"key":"11_CR34","doi-asserted-by":"publisher","unstructured":"Rotem, L.: Revisiting the uber assumption in the algebraic group model: Fine-grained bounds in hidden-order groups and improved reductions in bilinear groups. In: Dachman-Soled, D. (ed.) 3rd Conference on Information-Theoretic Cryptography (ITC 2022). Leibniz International Proceedings in Informatics (LIPIcs), vol.\u00a0230, pp. 13:1\u201313:13. Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik, Dagstuhl, Germany (2022). https:\/\/doi.org\/10.4230\/LIPIcs.ITC.2022.13, https:\/\/drops.dagstuhl.de\/opus\/volltexte\/2022\/16491","DOI":"10.4230\/LIPIcs.ITC.2022.13"},{"key":"11_CR35","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"481","DOI":"10.1007\/978-3-030-56877-1_17","volume-title":"Advances in Cryptology \u2013 CRYPTO 2020","author":"L Rotem","year":"2020","unstructured":"Rotem, L., Segev, G.: Generically speeding-up repeated squaring is equivalent to factoring: sharp thresholds for all generic-ring delay functions. In: Micciancio, D., Ristenpart, T. (eds.) CRYPTO 2020. LNCS, vol. 12172, pp. 481\u2013509. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-56877-1_17"},{"key":"11_CR36","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"256","DOI":"10.1007\/3-540-69053-0_18","volume-title":"Advances in Cryptology \u2014 EUROCRYPT \u201997","author":"V Shoup","year":"1997","unstructured":"Shoup, V.: Lower bounds for discrete logarithms and related problems. In: Fumy, W. (ed.) EUROCRYPT 1997. LNCS, vol. 1233, pp. 256\u2013266. Springer, Heidelberg (1997). https:\/\/doi.org\/10.1007\/3-540-69053-0_18"},{"key":"11_CR37","doi-asserted-by":"publisher","unstructured":"Yao, A.C.C.: Coherent functions and program checkers (extended abstract). In: 22nd ACM STOC, pp. 84\u201394. ACM Press (1990). https:\/\/doi.org\/10.1145\/100216.100226","DOI":"10.1145\/100216.100226"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 EUROCRYPT 2024"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-58734-4_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,12]],"date-time":"2024-05-12T23:06:23Z","timestamp":1715555183000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-58734-4_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031587337","9783031587344"],"references-count":37,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-58734-4_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"1 May 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"EUROCRYPT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Annual International Conference on the Theory and Applications of Cryptographic Techniques","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Zurich","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Switzerland","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 May 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30 May 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"43","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"eurocrypt2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/eurocrypt.iacr.org\/2024\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}