{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,21]],"date-time":"2025-08-21T16:50:15Z","timestamp":1755795015283,"version":"3.44.0"},"publisher-location":"Cham","reference-count":35,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783032018779"},{"type":"electronic","value":"9783032018786"}],"license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"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":[[2025]]},"DOI":"10.1007\/978-3-032-01878-6_16","type":"book-chapter","created":{"date-parts":[[2025,8,16]],"date-time":"2025-08-16T18:09:04Z","timestamp":1755367744000},"page":"481-512","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Quantum Lifting for\u00a0Invertible Permutations and\u00a0Ideal Ciphers"],"prefix":"10.1007","author":[{"given":"Alexandru","family":"Cojocaru","sequence":"first","affiliation":[]},{"given":"Minki","family":"Hhan","sequence":"additional","affiliation":[]},{"given":"Qipeng","family":"Liu","sequence":"additional","affiliation":[]},{"given":"Takashi","family":"Yamakawa","sequence":"additional","affiliation":[]},{"given":"Aaram","family":"Yun","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,8,17]]},"reference":[{"key":"16_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"310","DOI":"10.1007\/978-3-031-58716-0_11","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2024","author":"G Alagic","year":"2024","unstructured":"Alagic, G., Bai, C., Katz, J., Majenz, C., Struck, P.: Post-quantum security of tweakable even-mansour, and applications. In: Joye, M., Leander, G. (eds.) EUROCRYPT 2024. LNCS, vol. 14651, pp. 310\u2013338. Springer, Cham (2024). https:\/\/doi.org\/10.1007\/978-3-031-58716-0_11"},{"key":"16_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"458","DOI":"10.1007\/978-3-031-07082-2_17","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2022","author":"G Alagic","year":"2022","unstructured":"Alagic, G., Bai, C., Katz, J., Majenz, C.: Post-quantum security of the even-mansour cipher. In: Dunkelman, O., Dziembowski, S. (eds.) EUROCRYPT 2022. LNCS, vol. 13277, pp. 458\u2013487. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-07082-2_17"},{"key":"16_CR3","doi-asserted-by":"crossref","unstructured":"Alagic, G., Bai, C., Poremba, A., Shi, K.: On the Two-sided Permutation Inversion Problem. In: arXiv preprint arXiv:2306.13729 (2023)","DOI":"10.62056\/a0qj89n4e"},{"key":"16_CR4","unstructured":"Alagic, G., Carolan, J., Majenz, C., Tokat, S.: The sponge is quantum indifferentiable. Cryptology ePrint Archive, Paper 2025\/731 (2025). https:\/\/eprint.iacr.org\/2025\/731"},{"key":"16_CR5","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. LNCS, vol. 11693, pp. 269\u2013295. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-26951-7_10"},{"key":"16_CR6","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":"16_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1007\/978-3-540-78967-3_11","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2008","author":"G Bertoni","year":"2008","unstructured":"Bertoni, G., Daemen, J., Peeters, M., Van Assche, G.: On the indifferentiability of the sponge construction. In: Smart, N. (ed.) EUROCRYPT 2008. LNCS, vol. 4965, pp. 181\u2013197. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-78967-3_11"},{"key":"16_CR8","unstructured":"Bertoni, G., Daemen, J., Peeters, M., Van Assche, G.: Sponge functions (2011). https:\/\/keccak.team\/files\/CSF-0.1.pdf"},{"key":"16_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"328","DOI":"10.1007\/11799313_21","volume-title":"Fast Software Encryption","author":"J Black","year":"2006","unstructured":"Black, J.: The ideal-cipher model, revisited: an uninstantiable blockcipher-based hash function. In: Robshaw, M. (ed.) FSE 2006. LNCS, vol. 4047, pp. 328\u2013340. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11799313_21"},{"key":"16_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"320","DOI":"10.1007\/3-540-45708-9_21","volume-title":"Advances in Cryptology \u2014 CRYPTO 2002","author":"J Black","year":"2002","unstructured":"Black, J., Rogaway, P., Shrimpton, T.: Black-box analysis of the block-cipher-based hash-function constructions from PGV. In: Yung, M. (ed.) CRYPTO 2002. LNCS, vol. 2442, pp. 320\u2013335. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-45708-9_21"},{"issue":"4","key":"16_CR11","doi-asserted-by":"publisher","first-page":"519","DOI":"10.1007\/s00145-010-9071-0","volume":"23","author":"J Black","year":"2010","unstructured":"Black, J., Rogaway, P., Shrimpton, T., Stam, M.: An Analysis of the Blockcipher-Based Hash Functions from PGV. J. Cryptol. 23(4), 519\u2013545 (2010). https:\/\/doi.org\/10.1007\/s00145-010-9071-0","journal-title":"J. Cryptol."},{"key":"16_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"693","DOI":"10.1007\/978-3-319-96884-1_23","volume-title":"Advances in Cryptology \u2013 CRYPTO 2018","author":"S Coretti","year":"2018","unstructured":"Coretti, S., Dodis, Y., Guo, S.: Non-uniform bounds in the random-permutation, ideal-cipher, and generic-group models. In: Shacham, H., Boldyreva, A. (eds.) CRYPTO 2018, Part I. LNCS, vol. 10991, pp. 693\u2013721. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-96884-1_23"},{"key":"16_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"40","DOI":"10.1007\/978-3-540-24638-1_3","volume-title":"Theory of Cryptography","author":"R Canetti","year":"2004","unstructured":"Canetti, R., Goldreich, O., Halevi, S.: On the random-oracle methodology as applied to length-restricted signature schemes. In: Naor, M. (ed.) TCC 2004. LNCS, vol. 2951, pp. 40\u201357. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-24638-1_3"},{"key":"16_CR14","doi-asserted-by":"publisher","unstructured":"Carolan, J., Poremba, A.: Quantum one-wayness of the single-round sponge with invertible permutations. In: Reyzin, L., Stebila, D. (eds.) CRYPTO 2024, Part VI. LNCS, vol. 14925, pp. 218\u2013252. Springer, Cham (2024). https:\/\/doi.org\/10.1007\/978-3-031-68391-6_7","DOI":"10.1007\/978-3-031-68391-6_7"},{"key":"16_CR15","unstructured":"Carolan, J., Poremba, A., Zhandry, M.: (Quantum) indifferentiability and pre-computation. Cryptology ePrint Archive, Paper 2024\/1727 (2024). https:\/\/eprint.iacr.org\/2024\/1727"},{"key":"16_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"602","DOI":"10.1007\/978-3-030-56877-1_21","volume-title":"Advances in Cryptology \u2013 CRYPTO 2020","author":"J Don","year":"2020","unstructured":"Don, J., Fehr, S., Majenz, C.: The measure-and-reprogram technique 2.0: multi-round fiat-shamir and more. In: Micciancio, D., Ristenpart, T. (eds.) CRYPTO 2020. LNCS, vol. 12172, pp. 602\u2013631. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-56877-1_21"},{"key":"16_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"356","DOI":"10.1007\/978-3-030-26951-7_13","volume-title":"Advances in Cryptology \u2013 CRYPTO 2019","author":"J Don","year":"2019","unstructured":"Don, J., Fehr, S., Majenz, C., Schaffner, C.: Security of the Fiat-Shamir transformation in the quantum random-oracle model. In: Boldyreva, A., Micciancio, D. (eds.) CRYPTO 2019. LNCS, vol. 11693, pp. 356\u2013383. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-26951-7_13"},{"key":"16_CR18","doi-asserted-by":"crossref","unstructured":"Goldwasser, S., Kalai, Y.T.: On the (in) security of the Fiat-Shamir paradigm. In: 2003 Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science, pp. 102\u2013113. IEEE (2003)","DOI":"10.1109\/SFCS.2003.1238185"},{"key":"16_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1007\/978-3-319-70500-2_12","volume-title":"Theory of Cryptography","author":"D Hofheinz","year":"2017","unstructured":"Hofheinz, D., H\u00f6velmanns, K., Kiltz, E.: A modular analysis of the Fujisaki-Okamoto transformation. In: Kalai, Y., Reyzin, L. (eds.) TCC 2017, Part I. LNCS, vol. 10677, pp. 341\u2013371. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-70500-2_12"},{"key":"16_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1007\/978-3-030-03326-2_10","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2018","author":"A Hosoyamada","year":"2018","unstructured":"Hosoyamada, A., Yasuda, K.: Building quantum-one-way functions from block ciphers: Davies-Meyer and Merkle-Damg\u00e5rd constructions. In: Peyrin, T., Galbraith, S. (eds.) ASIACRYPT 2018, Part I. LNCS, vol. 11272, pp. 275\u2013304. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-030-03326-2_10"},{"key":"16_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"96","DOI":"10.1007\/978-3-319-96878-0_4","volume-title":"Advances in Cryptology \u2013 CRYPTO 2018","author":"H Jiang","year":"2018","unstructured":"Jiang, H., Zhang, Z., Chen, L., Wang, H., Ma, Z.: IND-CCA-secure key encapsulation mechanism in the quantum random oracle model, revisited. In: Shacham, H., Boldyreva, A. (eds.) CRYPTO 2018, Part III. LNCS, vol. 10993, pp. 96\u2013125. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-96878-0_4"},{"key":"16_CR22","unstructured":"Khovratovich, D., Rothblum, R.D., Soukhanov, L.: How to prove false statements: practical attacks on Fiat-Shamir. In: Cryptology ePrint Archive (2025)"},{"key":"16_CR23","doi-asserted-by":"crossref","unstructured":"Liu, Q., Zhandry, M.: Revisiting post-quantum Fiat- Shamir. In: IACR Cryptol. ePrint Arch. 2019, 262 (2019)","DOI":"10.1007\/978-3-030-26951-7_12"},{"key":"16_CR24","unstructured":"Majenz, C., Malavolta, G., Walter, M.: Permutation superposition oracles for quantum query lower bounds. Cryptology ePrint Archive, Paper 2024\/1140 (2024). https:\/\/eprint.iacr.org\/2024\/1140"},{"key":"16_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"368","DOI":"10.1007\/3-540-48329-2_31","volume-title":"Advances in Cryptology \u2014 CRYPTO\u2019 93","author":"B Preneel","year":"1994","unstructured":"Preneel, B., Govaerts, R., Vandewalle, J.: Hash functions based on block ciphers: a synthetic approach. In: Stinson, D.R. (ed.) CRYPTO 1993. LNCS, vol. 773, pp. 368\u2013378. Springer, Heidelberg (1994). https:\/\/doi.org\/10.1007\/3-540-48329-2_31"},{"key":"16_CR26","unstructured":"Rosmanis, A.: Tight bounds for inverting permutations via compressed oracle arguments. arXiv preprint arXiv:2103.08975 (2021)"},{"key":"16_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"192","DOI":"10.1007\/978-3-662-53644-5_8","volume-title":"Theory of Cryptography","author":"EE Targhi","year":"2016","unstructured":"Targhi, E.E., Unruh, D.: Post-quantum security of the Fujisaki-Okamoto and OAEP transforms. In: Hirt, M., Smith, A. (eds.) TCC 2016, Part II. LNCS, vol. 9986, pp. 192\u2013216. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-53644-5_8"},{"key":"16_CR28","doi-asserted-by":"publisher","unstructured":"Unruh, D.: Towards compressed permutation oracles. In: Guo, J., Steinfeld, R. (eds.) ASIACRYPT 2023, Part IV. LNCS, vol. 14441, pp. 369\u2013400. SPringer, Cham (2023). https:\/\/doi.org\/10.1007\/978-981-99-8730-6_12","DOI":"10.1007\/978-981-99-8730-6_12"},{"key":"16_CR29","doi-asserted-by":"publisher","unstructured":"Winternitz, R.S.: A secure one-way hash function built from DES. In: 1984 IEEE Symposium on Security and Privacy, p. 88 (1984). https:\/\/doi.org\/10.1109\/SP.1984.10027","DOI":"10.1109\/SP.1984.10027"},{"key":"16_CR30","unstructured":"Yuen, H.: A quantum lower bound for distinguishing random functions from random permutations. In: arXiv preprint arXiv:1310.2885 (2013)"},{"key":"16_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"568","DOI":"10.1007\/978-3-030-77886-6_20","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2021","author":"T Yamakawa","year":"2021","unstructured":"Yamakawa, T., Zhandry, M.: Classical vs quantum random oracles. In: Canteaut, A., Standaert, F.-X. (eds.) EUROCRYPT 2021. LNCS, vol. 12697, pp. 568\u2013597. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-77886-6_20"},{"issue":"3","key":"16_CR32","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1145\/3658665","volume":"71","author":"T Yamakawa","year":"2024","unstructured":"Yamakawa, T., Zhandry, M.: Verifiable quantum advantage without structure. J. ACM 71(3), 20 (2024). https:\/\/doi.org\/10.1145\/3658665","journal-title":"J. ACM"},{"key":"16_CR33","unstructured":"Zhandry, M.: A note on the quantum collision and set equality problems. arXiv preprint arXiv:1312.1027 (2013)"},{"key":"16_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1007\/978-3-030-26951-7_9","volume-title":"Advances in Cryptology \u2013 CRYPTO 2019","author":"M Zhandry","year":"2019","unstructured":"Zhandry, M.: How to record quantum queries, and applications to quantum indifferentiability. In: Boldyreva, A., Micciancio, D. (eds.) CRYPTO 2019. LNCS, vol. 11693, pp. 239\u2013268. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-26951-7_9"},{"key":"16_CR35","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"518","DOI":"10.1007\/978-3-030-92062-3_18","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2021","author":"M Zhandry","year":"2021","unstructured":"Zhandry, M.: Redeeming reset indifferentiability and applications to post-quantum security. In: Tibouchi, M., Wang, H. (eds.) ASIACRYPT 2021, Part I. LNCS, vol. 13090, pp. 518\u2013548. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-92062-3_18"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 CRYPTO 2025"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-01878-6_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,16]],"date-time":"2025-08-16T18:09:06Z","timestamp":1755367746000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-01878-6_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9783032018779","9783032018786"],"references-count":35,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-01878-6_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"17 August 2025","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":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 August 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 August 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"45","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"crypto2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/crypto.iacr.org\/2025\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}