{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,7]],"date-time":"2025-12-07T13:10:20Z","timestamp":1765113020483,"version":"3.40.3"},"publisher-location":"Cham","reference-count":44,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031587535"},{"type":"electronic","value":"9783031587542"}],"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-58754-2_2","type":"book-chapter","created":{"date-parts":[[2024,4,27]],"date-time":"2024-04-27T19:01:54Z","timestamp":1714244514000},"page":"30-58","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Signatures with\u00a0Memory-Tight Security in\u00a0the\u00a0Quantum Random Oracle Model"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6832-9940","authenticated-orcid":false,"given":"Keita","family":"Xagawa","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,4,28]]},"reference":[{"key":"2_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"572","DOI":"10.1007\/978-3-642-29011-4_34","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2012","author":"M Abdalla","year":"2012","unstructured":"Abdalla, M., Fouque, P.-A., Lyubashevsky, V., Tibouchi, M.: Tightly-secure signatures from lossy identification schemes. In: Pointcheval, D., Johansson, T. (eds.) EUROCRYPT 2012. LNCS, vol. 7237, pp. 572\u2013590. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-29011-4_34"},{"issue":"3","key":"2_CR2","doi-asserted-by":"publisher","first-page":"597","DOI":"10.1007\/s00145-015-9203-7","volume":"29","author":"M Abdalla","year":"2016","unstructured":"Abdalla, M., Fouque, P.A., Lyubashevsky, V., Tibouchi, M.: Tightly secure signatures from lossy identification schemes. J. Cryptol. 29(3), 597\u2013631 (2016). https:\/\/doi.org\/10.1007\/s00145-015-9203-7","journal-title":"J. Cryptol."},{"doi-asserted-by":"publisher","unstructured":"Alagic, G., et al.: Status report on the third round of the NIST post-quantum cryptography standardization process. Technical report, NIST (2022). https:\/\/doi.org\/10.6028\/NIST.IR.8413-upd1","key":"2_CR3","DOI":"10.6028\/NIST.IR.8413-upd1"},{"unstructured":"Alagic, G., Majenz, C., Russell, A., Song, F.: Quantum-secure message authentication via blind-unforgeability. Cryptology ePrint Archive, Report 2018\/1150 (2018). https:\/\/eprint.iacr.org\/2018\/1150","key":"2_CR4"},{"key":"2_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"788","DOI":"10.1007\/978-3-030-45727-3_27","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2020","author":"G Alagic","year":"2020","unstructured":"Alagic, G., Majenz, C., Russell, A., Song, F.: Quantum-access-secure message authentication via blind-unforgeability. In: Canteaut, A., Ishai, Y. (eds.) EUROCRYPT 2020, Part III. LNCS, vol. 12107, pp. 788\u2013817. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-45727-3_27"},{"key":"2_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1007\/978-3-030-26951-7_10","volume-title":"Advances in Cryptology \u2013 CRYPTO 2019","author":"A Ambainis","year":"2019","unstructured":"Ambainis, A., Hamburg, M., Unruh, D.: Quantum security proofs using semi-classical oracles. In: Boldyreva, A., Micciancio, D. (eds.) CRYPTO 2019, Part II. LNCS, vol. 11693, pp. 269\u2013295. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-26951-7_10"},{"key":"2_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1007\/978-3-319-63688-7_4","volume-title":"Advances in Cryptology \u2013 CRYPTO 2017","author":"B Auerbach","year":"2017","unstructured":"Auerbach, B., Cash, D., Fersch, M., Kiltz, E.: Memory-tight reductions. In: Katz, J., Shacham, H. (eds.) CRYPTO 2017, Part I. LNCS, vol. 10401, pp. 101\u2013132. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-63688-7_4"},{"doi-asserted-by":"publisher","unstructured":"Barbosa, M., et al.: Fixing and mechanizing the security proof of Fiat-Shamir with aborts and Dilithium. In: Handschuh, H., Lysyanskaya, A. (eds.) Advances in Cryptology, CRYPTO 2023. LNCS, vol. 14085, pp. 358\u2013389. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-38554-4_12","key":"2_CR8","DOI":"10.1007\/978-3-031-38554-4_12"},{"key":"2_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"435","DOI":"10.1007\/978-3-662-53890-6_15","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2016","author":"M Bellare","year":"2016","unstructured":"Bellare, M., Poettering, B., Stebila, D.: From identification to signatures, tightly: a framework and generic transforms. In: Cheon, J.H., Takagi, T. (eds.) ASIACRYPT 2016, Part II. LNCS, vol. 10032, pp. 435\u2013464. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-53890-6_15"},{"doi-asserted-by":"publisher","unstructured":"Bellare, M., Rogaway, P.: Random oracles are practical: a paradigm for designing efficient protocols. In: Denning, D.E., Pyle, R., Ganesan, R., Sandhu, R.S., Ashby, V. (eds.) ACM CCS 1993, November 1993, pp. 62\u201373. ACM Press (1993). https:\/\/doi.org\/10.1145\/168588.168596","key":"2_CR10","DOI":"10.1145\/168588.168596"},{"key":"2_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"399","DOI":"10.1007\/3-540-68339-9_34","volume-title":"Advances in Cryptology \u2014 EUROCRYPT \u201996","author":"M Bellare","year":"1996","unstructured":"Bellare, M., Rogaway, P.: The exact security of digital signatures-how to sign with RSA and Rabin. In: Maurer, U. (ed.) EUROCRYPT 1996. LNCS, vol. 1070, pp. 399\u2013416. Springer, Heidelberg (1996). https:\/\/doi.org\/10.1007\/3-540-68339-9_34"},{"doi-asserted-by":"publisher","unstructured":"Bernstein, D.J.: Extending the Salsa20 nonce. In: SKEW 2011 (Symmetric Key Encryption Workshop 2011) (2011). https:\/\/doi.org\/10.1109\/SP46215.2023.10179342. See the authors\u2019 website or http:\/\/skew2011.mat.dtu.dk\/program.html","key":"2_CR12","DOI":"10.1109\/SP46215.2023.10179342"},{"key":"2_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1007\/978-3-030-45374-9_9","volume-title":"Public-Key Cryptography \u2013 PKC 2020","author":"R Bhattacharyya","year":"2020","unstructured":"Bhattacharyya, R.: Memory-tight reductions for practical key encapsulation mechanisms. In: Kiayias, A., Kohlweiss, M., Wallden, P., Zikas, V. (eds.) PKC 2020, Part I. LNCS, vol. 12110, pp. 249\u2013278. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-45374-9_9"},{"key":"2_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/978-3-642-25385-0_3","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2011","author":"D Boneh","year":"2011","unstructured":"Boneh, D., Dagdelen, \u00d6., Fischlin, M., Lehmann, A., Schaffner, C., Zhandry, M.: Random oracles in a quantum world. In: Lee, D.H., Wang, X. (eds.) ASIACRYPT 2011. LNCS, vol. 7073, pp. 41\u201369. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-25385-0_3"},{"key":"2_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"514","DOI":"10.1007\/3-540-45682-1_30","volume-title":"Advances in Cryptology \u2014 ASIACRYPT 2001","author":"D Boneh","year":"2001","unstructured":"Boneh, D., Lynn, B., Shacham, H.: Short signatures from the Weil pairing. In: Boyd, C. (ed.) ASIACRYPT 2001. LNCS, vol. 2248, pp. 514\u2013532. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-45682-1_30"},{"key":"2_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1007\/978-3-642-40084-1_21","volume-title":"Advances in Cryptology \u2013 CRYPTO 2013","author":"D Boneh","year":"2013","unstructured":"Boneh, D., Zhandry, M.: Secure signatures and chosen ciphertext security in a quantum computing world. In: Canetti, R., Garay, J.A. (eds.) CRYPTO 2013, Part II. LNCS, vol. 8043, pp. 361\u2013379. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-40084-1_21"},{"doi-asserted-by":"publisher","unstructured":"Chatterjee, R., Chung, K.M., Liang, X., Malavolta, G.: A note on the post-quantum security of (ring) signatures. In: Hanaoka, G., Shikata, J., Watanabe, Y. (eds.) PKC\u00a02022, Part\u00a0II. LNCS, March 2022, vol. 13178, pp. 407\u2013436. Springer, Heidelberg (2022). https:\/\/doi.org\/10.1007\/978-3-030-97131-1_14","key":"2_CR17","DOI":"10.1007\/978-3-030-97131-1_14"},{"key":"2_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"282","DOI":"10.1007\/978-3-030-84242-0_11","volume-title":"Advances in Cryptology \u2013 CRYPTO 2021","author":"R Chatterjee","year":"2021","unstructured":"Chatterjee, R., et al.: Compact ring signatures from learning with errors. In: Malkin, T., Peikert, C. (eds.) CRYPTO 2021, Part I. LNCS, vol. 12825, pp. 282\u2013312. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-84242-0_11"},{"key":"2_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1007\/978-3-319-61273-7_3","volume-title":"Paradigms in Cryptology \u2013 Mycrypt 2016. Malicious and Exploratory Cryptology","author":"S Chatterjee","year":"2017","unstructured":"Chatterjee, S., Koblitz, N., Menezes, A., Sarkar, P.: Another look at tightness II: practical issues in cryptography. In: Phan, R.C.-W., Yung, M. (eds.) Mycrypt 2016. LNCS, vol. 10311, pp. 21\u201355. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-61273-7_3"},{"key":"2_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1007\/978-3-642-28496-0_18","volume-title":"Selected Areas in Cryptography","author":"S Chatterjee","year":"2012","unstructured":"Chatterjee, S., Menezes, A., Sarkar, P.: Another look at tightness. In: Miri, A., Vaudenay, S. (eds.) SAC 2011. LNCS, vol. 7118, pp. 293\u2013319. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-28496-0_18"},{"key":"2_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1007\/3-540-44598-6_14","volume-title":"Advances in Cryptology \u2014 CRYPTO 2000","author":"J-S Coron","year":"2000","unstructured":"Coron, J.-S.: On the exact security of full domain hash. In: Bellare, M. (ed.) CRYPTO 2000. LNCS, vol. 1880, pp. 229\u2013235. Springer, Heidelberg (2000). https:\/\/doi.org\/10.1007\/3-540-44598-6_14"},{"doi-asserted-by":"publisher","unstructured":"Devevey, J., Fallahpour, P., Passel\u00e8gue, A., Stehl\u00e9, D.: A detailed analysis of Fiat-Shamir with aborts. In: Handschuh, H., Lysyanskaya, A. (eds) Advances in Cryptology, CRYPTO 2023. LNCS, vol. 14085, pp. 327\u2013357. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-38554-4_11","key":"2_CR22","DOI":"10.1007\/978-3-031-38554-4_11"},{"doi-asserted-by":"publisher","unstructured":"Devevey, J., Passel\u00e8gue, A., Stehl\u00e9, D.: G+G: a Fiat-Shamir lattice signature based on convolved Gaussians. In: Guo, J., Steinfeld, R. (eds.) ASIACRYPT 2023, Part VII. LNCS, December 2023, vol. 14444, pp. 37\u201364. Springer, Heidelberg (2023). https:\/\/doi.org\/10.1007\/978-981-99-8739-9_2","key":"2_CR23","DOI":"10.1007\/978-981-99-8739-9_2"},{"key":"2_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"403","DOI":"10.1007\/978-3-030-92068-5_14","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2021","author":"D Diemert","year":"2021","unstructured":"Diemert, D., Gellert, K., Jager, T., Lyu, L.: Digital signatures with\u00a0memory-tight security in\u00a0the\u00a0multi-challenge setting. In: Tibouchi, M., Wang, H. (eds.) ASIACRYPT 2021, Part IV. LNCS, vol. 13093, pp. 403\u2013433. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-92068-5_14"},{"key":"2_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"405","DOI":"10.1007\/978-3-030-45721-1_15","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2020","author":"I Dinur","year":"2020","unstructured":"Dinur, I.: Tight time-space lower bounds for finding multiple collision pairs and their applications. In: Canteaut, A., Ishai, Y. (eds.) EUROCRYPT 2020, Part I. LNCS, vol. 12105, pp. 405\u2013434. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-45721-1_15"},{"unstructured":"Doosti, M., Delavar, M., Kashefi, E., Arapinis, M.: A unified framework for quantum unforgeability. CoRR abs\/2103.13994 (2021). https:\/\/arxiv.org\/abs\/2103.13994","key":"2_CR26"},{"key":"2_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"186","DOI":"10.1007\/3-540-47721-7_12","volume-title":"Advances in Cryptology \u2014 CRYPTO\u2019 86","author":"A Fiat","year":"1987","unstructured":"Fiat, A., Shamir, A.: How To prove yourself: practical solutions to identification and signature problems. In: Odlyzko, A.M. (ed.) CRYPTO 1986. LNCS, vol. 263, pp. 186\u2013194. Springer, Heidelberg (1987). https:\/\/doi.org\/10.1007\/3-540-47721-7_12"},{"doi-asserted-by":"publisher","unstructured":"Gentry, C., Peikert, C., Vaikuntanathan, V.: Trapdoors for hard lattices and new cryptographic constructions. In: Ladner, R.E., Dwork, C. (eds.) STOC 2008, May 2008, pp. 197\u2013206. ACM Press (2008). https:\/\/doi.org\/10.1145\/1374376.1374407","key":"2_CR28","DOI":"10.1145\/1374376.1374407"},{"doi-asserted-by":"publisher","unstructured":"Ghoshal, A., Ghosal, R., Jaeger, J., Tessaro, S.: Hiding in plain sight: memory-tight proofs via randomness programming. In: Dunkelman, O., Dziembowski, S. (eds.) EUROCRYPT\u00a02022, Part\u00a0II. LNCS, May\/June 2022, vol. 13276, pp. 706\u2013735. Springer, Heidelberg (2022). https:\/\/doi.org\/10.1007\/978-3-031-07085-3_24","key":"2_CR29","DOI":"10.1007\/978-3-031-07085-3_24"},{"key":"2_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1007\/978-3-030-56784-2_5","volume-title":"Advances in Cryptology \u2013 CRYPTO 2020","author":"A Ghoshal","year":"2020","unstructured":"Ghoshal, A., Jaeger, J., Tessaro, S.: The memory-tightness of authenticated encryption. In: Micciancio, D., Ristenpart, T. (eds.) CRYPTO 2020, Part I. LNCS, vol. 12170, pp. 127\u2013156. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-56784-2_5"},{"key":"2_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/978-3-030-45724-2_2","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2020","author":"A Ghoshal","year":"2020","unstructured":"Ghoshal, A., Tessaro, S.: On the memory-tightness of hashed ElGamal. In: Canteaut, A., Ishai, Y. (eds.) EUROCRYPT 2020, Part II. LNCS, vol. 12106, pp. 33\u201362. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-45724-2_2"},{"key":"2_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"637","DOI":"10.1007\/978-3-030-92062-3_22","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2021","author":"AB Grilo","year":"2021","unstructured":"Grilo, A.B., H\u00f6velmanns, K., H\u00fclsing, A., Majenz, C.: Tight adaptive reprogramming in\u00a0the\u00a0QROM. In: Tibouchi, M., Wang, H. (eds.) ASIACRYPT 2021, Part I. LNCS, vol. 13090, pp. 637\u2013667. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-92062-3_22"},{"doi-asserted-by":"publisher","unstructured":"Jaeger, J., Kumar, A.: Memory-tight multi-challenge security of public-key encryption. In: Agrawal, S., Lin, D. (eds.) ASIACRYPT\u00a02022, Part\u00a0III. LNCS, December 2022, vol. 13793, pp. 454\u2013484. Springer, Heidelberg (2022). https:\/\/doi.org\/10.1007\/978-3-031-22969-5_16","key":"2_CR33","DOI":"10.1007\/978-3-031-22969-5_16"},{"key":"2_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"552","DOI":"10.1007\/978-3-319-78372-7_18","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2018","author":"E Kiltz","year":"2018","unstructured":"Kiltz, E., Lyubashevsky, V., Schaffner, C.: A concrete treatment of Fiat-Shamir signatures in the quantum random-oracle model. In: Nielsen, J.B., Rijmen, V. (eds.) EUROCRYPT 2018, Part III. LNCS, vol. 10822, pp. 552\u2013586. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-78372-7_18"},{"issue":"1","key":"2_CR35","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/s00145-005-0432-z","volume":"20","author":"N Koblitz","year":"2007","unstructured":"Koblitz, N., Menezes, A.J.: Another look at \u201cprovable security\u2019\u2019. J. Cryptol. 20(1), 3\u201337 (2007). https:\/\/doi.org\/10.1007\/s00145-005-0432-z","journal-title":"J. Cryptol."},{"key":"2_CR36","doi-asserted-by":"publisher","first-page":"587","DOI":"10.1007\/s10623-015-0094-2","volume":"77","author":"N Koblitz","year":"2015","unstructured":"Koblitz, N., Menezes, A.J.: The random oracle model: a twenty-year retrospective. Des. Codes Cryptogr. 77, 587\u2013610 (2015). https:\/\/doi.org\/10.1007\/s10623-015-0094-2","journal-title":"Des. Codes Cryptogr."},{"doi-asserted-by":"crossref","unstructured":"Kosuge, H., Xagawa, K.: Probabilistic hash-and-sign with retry in the quantum random oracle model. In: PKC 2024 (2024, to appear). https:\/\/eprint.iacr.org\/2022\/1359","key":"2_CR37","DOI":"10.1007\/978-3-031-57718-5_9"},{"key":"2_CR38","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"598","DOI":"10.1007\/978-3-642-10366-7_35","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2009","author":"V Lyubashevsky","year":"2009","unstructured":"Lyubashevsky, V.: Fiat-Shamir with aborts: applications to lattice and factoring-based signatures. In: Matsui, M. (ed.) ASIACRYPT 2009. LNCS, vol. 5912, pp. 598\u2013616. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-10366-7_35"},{"doi-asserted-by":"publisher","unstructured":"Majenz, C., Manfouo, C.M., Ozols, M.: Quantum-access security of the Winternitz one-time signature scheme. In: Tessaro, S. (ed.) ITC\u00a02021. LIPIcs, vol.\u00a0199, pp. 21:1\u201321:22. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2021). https:\/\/doi.org\/10.4230\/LIPICS.ITC.2021.21","key":"2_CR39","DOI":"10.4230\/LIPICS.ITC.2021.21"},{"key":"2_CR40","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"72","DOI":"10.1007\/3-540-48892-8_6","volume-title":"Selected Areas in Cryptography","author":"D M\u2019Ra\u00efhi","year":"1999","unstructured":"M\u2019Ra\u00efhi, D., Naccache, D., Pointcheval, D., Vaudenay, S.: Computational alternatives to random number generators. In: Tavares, S., Meijer, H. (eds.) SAC 1998. LNCS, vol. 1556, pp. 72\u201380. Springer, Heidelberg (1999). https:\/\/doi.org\/10.1007\/3-540-48892-8_6"},{"issue":"2","key":"2_CR41","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1145\/359340.359342","volume":"21","author":"RL Rivest","year":"1978","unstructured":"Rivest, R.L., Shamir, A., Adleman, L.M.: A method for obtaining digital signatures and public-key cryptosystems. Commun. Assoc. Comput. Mach. 21(2), 120\u2013126 (1978). https:\/\/doi.org\/10.1145\/359340.359342","journal-title":"Commun. Assoc. Comput. Mach."},{"key":"2_CR42","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1007\/978-3-319-78381-9_3","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2018","author":"Y Wang","year":"2018","unstructured":"Wang, Y., Matsuda, T., Hanaoka, G., Tanaka, K.: Memory lower bounds of reductions revisited. In: Nielsen, J.B., Rijmen, V. (eds.) EUROCRYPT 2018. LNCS, vol. 10820, pp. 61\u201390. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-78381-9_3"},{"doi-asserted-by":"publisher","unstructured":"Yuan, Q., Tibouchi, M., Abe, M.: Quantum-access security of hash-based signature schemes. In: Simpson, L., Baee, M.A.R. (eds.) ACISP 2023. LNCS, July 2023, vol. 13915, pp. 343\u2013380. Springer, Heidelberg (2023). https:\/\/doi.org\/10.1007\/978-3-031-35486-1_16","key":"2_CR43","DOI":"10.1007\/978-3-031-35486-1_16"},{"doi-asserted-by":"publisher","unstructured":"Zhandry, M.: How to construct quantum random functions. In: FOCS 2012, October 2012, pp. 679\u2013687. IEEE Computer Society Press (2012). https:\/\/doi.org\/10.1109\/FOCS.2012.37","key":"2_CR44","DOI":"10.1109\/FOCS.2012.37"}],"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-58754-2_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,12]],"date-time":"2024-05-12T23:09:18Z","timestamp":1715555358000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-58754-2_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031587535","9783031587542"],"references-count":44,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-58754-2_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"28 April 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"}}]}}