{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,11]],"date-time":"2025-07-11T00:03:55Z","timestamp":1752192235516,"version":"3.41.2"},"publisher-location":"Singapore","reference-count":63,"publisher":"Springer Nature Singapore","isbn-type":[{"value":"9789819690978","type":"print"},{"value":"9789819690985","type":"electronic"}],"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-981-96-9098-5_1","type":"book-chapter","created":{"date-parts":[[2025,7,10]],"date-time":"2025-07-10T09:26:58Z","timestamp":1752139618000},"page":"3-22","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Towards Quantum Security of\u00a0Hirose Compression Function and\u00a0Romulus-H"],"prefix":"10.1007","author":[{"given":"Shaoxuan","family":"Zhang","sequence":"first","affiliation":[]},{"given":"Chun","family":"Guo","sequence":"additional","affiliation":[]},{"given":"Meiqin","family":"Wang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,7,7]]},"reference":[{"key":"1_CR1","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":"1_CR2","doi-asserted-by":"crossref","unstructured":"Ambainis, A., Rosmanis, A., Unruh, D.: Quantum attacks on classical proof systems - the hardness of quantum rewinding. Cryptology ePrint Archive, Report 2014\/296 (2014). https:\/\/eprint.iacr.org\/2014\/296","DOI":"10.1109\/FOCS.2014.57"},{"key":"1_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1007\/978-3-642-25385-0_13","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2011","author":"F Armknecht","year":"2011","unstructured":"Armknecht, F., Fleischmann, E., Krause, M., Lee, J., Stam, M., Steinberger, J.: The preimage security of double-block-length compression functions. In: Lee, D.H., Wang, X. (eds.) ASIACRYPT 2011. LNCS, vol. 7073, pp. 233\u2013251. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-25385-0_13"},{"key":"1_CR4","unstructured":"Bertoni, G., Daemen, J., Peeters, M., Van\u00a0Assche, G.: Sponge functions. In: ECRYPT Hash Workshop, vol.\u00a02007 (2007)"},{"key":"1_CR5","doi-asserted-by":"publisher","unstructured":"Cao, S., Xue, R.: The gap is sensitive to size of preimages: collapsing property doesn\u2019t go beyond quantum collision-resistance for preimages bounded hash functions. In: Dodis, Y., Shrimpton, T. (eds.) CRYPTO\u00a02022, Part\u00a0III. LNCS, vol. 13509, pp. 564\u2013595. Springer, Heidelberg (2022). https:\/\/doi.org\/10.1007\/978-3-031-15982-4_19","DOI":"10.1007\/978-3-031-15982-4_19"},{"key":"1_CR6","doi-asserted-by":"publisher","unstructured":"Chauhan, A.K., Kumar, A., Sanadhya, S.K.: Quantum free-start collision attacks on double block length hashing with round-reduced AES-256. IACR Trans. Symm. Cryptol. 2021(1), 316\u2013336 (2021). https:\/\/doi.org\/10.46586\/tosc.v2021.i1.316-336","DOI":"10.46586\/tosc.v2021.i1.316-336"},{"key":"1_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1007\/978-3-030-84242-0_12","volume-title":"Advances in Cryptology \u2013 CRYPTO 2021","author":"N-H Chia","year":"2021","unstructured":"Chia, N.-H., Chung, K.-M., Yamakawa, T.: A black-box approach to post-quantum zero-knowledge in constant rounds. In: Malkin, T., Peikert, C. (eds.) CRYPTO 2021, Part I. LNCS, vol. 12825, pp. 315\u2013345. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-84242-0_12"},{"key":"1_CR8","doi-asserted-by":"publisher","unstructured":"Chiesa, A., Ma, F., Spooner, N., Zhandry, M.: Post-quantum succinct arguments: breaking the quantum rewinding barrier. In: 62nd FOCS, pp. 49\u201358. IEEE Computer Society Press (2022). https:\/\/doi.org\/10.1109\/FOCS52979.2021.00014","DOI":"10.1109\/FOCS52979.2021.00014"},{"key":"1_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"430","DOI":"10.1007\/11535218_26","volume-title":"Advances in Cryptology \u2013 CRYPTO 2005","author":"J-S Coron","year":"2005","unstructured":"Coron, J.-S., Dodis, Y., Malinaud, C., Puniya, P.: Merkle-Damg\u00e5rd revisited: how to construct a hash function. In: Shoup, V. (ed.) CRYPTO 2005. LNCS, vol. 3621, pp. 430\u2013448. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11535218_26"},{"key":"1_CR10","unstructured":"Dall\u2019Agnol, M., Spooner, N.: On the necessity of collapsing for post-quantum and quantum commitments. Cryptology ePrint Archive, Paper 2022\/786 (2022). https:\/\/eprint.iacr.org\/2022\/786"},{"key":"1_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"416","DOI":"10.1007\/0-387-34805-0_39","volume-title":"Advances in Cryptology \u2014 CRYPTO\u2019 89 Proceedings","author":"IB Damg\u00e5rd","year":"1990","unstructured":"Damg\u00e5rd, I.B.: A design principle for hash functions. In: Brassard, G. (ed.) CRYPTO 1989. LNCS, vol. 435, pp. 416\u2013427. Springer, New York (1990). https:\/\/doi.org\/10.1007\/0-387-34805-0_39"},{"key":"1_CR12","unstructured":"Davies, D.W.: Digital signature-an update. In: Proceedings of International Conference on Computer Communications, Sydney. Elsevier (1985)"},{"key":"1_CR13","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, Part II. LNCS, vol. 11693, pp. 356\u2013383. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-26951-7_13"},{"key":"1_CR14","unstructured":"Dworkin, M.J.: SHA-3 standard: permutation-based hash and extendable-output functions (2015)"},{"key":"1_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"102","DOI":"10.1007\/978-3-642-16280-0_7","volume-title":"Provable Security","author":"E Fleischmann","year":"2010","unstructured":"Fleischmann, E., Forler, C., Gorski, M., Lucks, S.: Collision resistant double-length hashing. In: Heng, S.-H., Kurosawa, K. (eds.) ProvSec 2010. LNCS, vol. 6402, pp. 102\u2013118. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-16280-0_7"},{"key":"1_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"152","DOI":"10.1007\/978-3-642-31448-3_12","volume-title":"Information Security and Privacy","author":"E Fleischmann","year":"2012","unstructured":"Fleischmann, E., Forler, C., Lucks, S., Wenzel, J.: Weimar-DM: a highly secure double-length compression function. In: Susilo, W., Mu, Y., Seberry, J. (eds.) ACISP 2012. LNCS, vol. 7372, pp. 152\u2013165. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-31448-3_12"},{"key":"1_CR17","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1007\/s10623-008-9208-4","volume":"48","author":"Z Gong","year":"2008","unstructured":"Gong, Z., Lai, X., Chen, K.: A synthetic indifferentiability analysis of some block-cipher-based hash functions. Des. Codes Crypt. 48, 293\u2013305 (2008)","journal-title":"Des. Codes Crypt."},{"key":"1_CR18","doi-asserted-by":"publisher","unstructured":"Grover, L.K.: A fast quantum mechanical algorithm for database search. In: 28th ACM STOC, pp. 212\u2013219. ACM Press (1996). https:\/\/doi.org\/10.1145\/237814.237866","DOI":"10.1145\/237814.237866"},{"key":"1_CR19","unstructured":"Guo, C., Iwata, T., Khairallah, M., Minematsu, K., Peyrin, T.: Romulus v1.3. Submission to NIST Lightweight Cryptography (2021)"},{"issue":"4","key":"1_CR20","doi-asserted-by":"publisher","first-page":"262","DOI":"10.1049\/ise2.12058","volume":"16","author":"C Guo","year":"2022","unstructured":"Guo, C., Iwata, T., Minematsu, K.: New indifferentiability security proof of MDPH hash function. IET Inf. Secur. 16(4), 262\u2013281 (2022)","journal-title":"IET Inf. Secur."},{"key":"1_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"330","DOI":"10.1007\/11496618_24","volume-title":"Information Security and Cryptology \u2013 ICISC 2004","author":"S Hirose","year":"2005","unstructured":"Hirose, S.: Provably secure double-block-length hash functions in a black-box model. In: Park, C., Chee, S. (eds.) ICISC 2004. LNCS, vol. 3506, pp. 330\u2013342. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11496618_24"},{"key":"1_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"210","DOI":"10.1007\/11799313_14","volume-title":"Fast Software Encryption","author":"S Hirose","year":"2006","unstructured":"Hirose, S.: Some plausible constructions of double-block-length hash functions. In: Robshaw, M. (ed.) FSE 2006. LNCS, vol. 4047, pp. 210\u2013225. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11799313_14"},{"key":"1_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1007\/978-3-319-12475-9_6","volume-title":"Provable Security","author":"S Hirose","year":"2014","unstructured":"Hirose, S., Kuwakado, H.: A block-cipher-based hash function using an MMO-type double-block compression function. In: Chow, S., Liu, J.K., Hui, L., Yiu, S.M. (eds.) ProvSec 2014. LNCS, vol. 8782, pp. 71\u201386. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-12475-9_6"},{"key":"1_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1007\/978-3-030-92641-0_8","volume-title":"Cryptography and Coding","author":"S Hirose","year":"2021","unstructured":"Hirose, S., Kuwakado, H.: A note on\u00a0quantum collision resistance of\u00a0double-block-length compression functions. In: Paterson, M.B. (ed.) IMACC 2021. LNCS, vol. 13129, pp. 161\u2013175. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-92641-0_8"},{"key":"1_CR25","doi-asserted-by":"crossref","unstructured":"Hirose, S., Kuwakado, H.: Quantum collision resistance of double-block-length hashing. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 2023DMP0007 (2024)","DOI":"10.1587\/transfun.2023DMP0007"},{"issue":"2","key":"1_CR26","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1007\/s00145-010-9095-5","volume":"25","author":"S Hirose","year":"2012","unstructured":"Hirose, S., Park, J.H., Yun, A.: A simple variant of the Merkle-Damg\u00e5rd scheme with a permutation. J. Cryptol. 25(2), 271\u2013309 (2012). https:\/\/doi.org\/10.1007\/s00145-010-9095-5","journal-title":"J. Cryptol."},{"key":"1_CR27","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":"1_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1007\/978-3-662-53008-5_8","volume-title":"Advances in Cryptology \u2013 CRYPTO 2016","author":"M Kaplan","year":"2016","unstructured":"Kaplan, M., Leurent, G., Leverrier, A., Naya-Plasencia, M.: Breaking symmetric cryptosystems using\u00a0quantum\u00a0period finding. In: Robshaw, M., Katz, J. (eds.) CRYPTO 2016, Part II. LNCS, vol. 9815, pp. 207\u2013237. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-53008-5_8"},{"key":"1_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1007\/978-3-642-45239-0_13","volume-title":"Cryptography and Coding","author":"H Kuwakado","year":"2013","unstructured":"Kuwakado, H., Hirose, S.: Hashing mode using a lightweight blockcipher. In: Stam, M. (ed.) IMACC 2013. LNCS, vol. 8308, pp. 213\u2013231. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-45239-0_13"},{"key":"1_CR30","doi-asserted-by":"publisher","unstructured":"Lai, R.W.F., Malavolta, G., Spooner, N.: Quantum rewinding for many-round protocols. In: Kiltz, E., Vaikuntanathan, V. (eds.) TCC\u00a02022, Part\u00a0I. LNCS, vol. 13747, pp. 80\u2013109. Springer, Heidelberg (2022). https:\/\/doi.org\/10.1007\/978-3-031-22318-1_4","DOI":"10.1007\/978-3-031-22318-1_4"},{"key":"1_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1007\/3-540-47555-9_5","volume-title":"Advances in Cryptology \u2014 EUROCRYPT\u2019 92","author":"X Lai","year":"1993","unstructured":"Lai, X., Massey, J.L.: Hash functions based on block ciphers. In: Rueppel, R.A. (ed.) EUROCRYPT 1992. LNCS, vol. 658, pp. 55\u201370. Springer, Heidelberg (1993). https:\/\/doi.org\/10.1007\/3-540-47555-9_5"},{"issue":"1","key":"1_CR32","doi-asserted-by":"publisher","first-page":"104","DOI":"10.1587\/transfun.E94.A.104","volume":"94","author":"J Lee","year":"2011","unstructured":"Lee, J., Kwon, D.: The security of abreast-DM in the ideal cipher model. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 94(1), 104\u2013109 (2011)","journal-title":"IEICE Trans. Fundam. Electron. Commun. Comput. Sci."},{"key":"1_CR33","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1007\/978-3-642-19074-2_15","volume-title":"Topics in Cryptology \u2013 CT-RSA 2011","author":"J Lee","year":"2011","unstructured":"Lee, J., Stam, M.: MJH: a faster alternative to MDC-2. In: Kiayias, A. (ed.) CT-RSA 2011. LNCS, vol. 6558, pp. 213\u2013236. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-19074-2_15"},{"key":"1_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"561","DOI":"10.1007\/978-3-642-22792-9_32","volume-title":"Advances in Cryptology \u2013 CRYPTO 2011","author":"J Lee","year":"2011","unstructured":"Lee, J., Stam, M., Steinberger, J.: The collision security of tandem-DM in the ideal cipher model. In: Rogaway, P. (ed.) CRYPTO 2011. LNCS, vol. 6841, pp. 561\u2013577. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-22792-9_32"},{"key":"1_CR35","doi-asserted-by":"publisher","unstructured":"Linn, J.: Privacy enhancement for internet electronic mail: part III - algorithms, modes, and identifiers. RFC 1115 (1989). https:\/\/doi.org\/10.17487\/RFC1115","DOI":"10.17487\/RFC1115"},{"key":"1_CR36","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1007\/978-3-030-17659-4_7","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2019","author":"Q Liu","year":"2019","unstructured":"Liu, Q., Zhandry, M.: On finding quantum multi-collisions. In: Ishai, Y., Rijmen, V. (eds.) EUROCRYPT 2019, Part III. LNCS, vol. 11478, pp. 189\u2013218. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-17659-4_7"},{"key":"1_CR37","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"326","DOI":"10.1007\/978-3-030-26951-7_12","volume-title":"Advances in Cryptology \u2013 CRYPTO 2019","author":"Q Liu","year":"2019","unstructured":"Liu, Q., Zhandry, M.: Revisiting post-quantum Fiat-Shamir. In: Boldyreva, A., Micciancio, D. (eds.) CRYPTO 2019, Part II. LNCS, vol. 11693, pp. 326\u2013355. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-26951-7_12"},{"key":"1_CR38","doi-asserted-by":"publisher","unstructured":"Lombardi, A., Ma, F., Spooner, N.: Post-quantum zero knowledge, revisited or: How to do quantum rewinding undetectably. In: 63rd FOCS. pp. 851\u2013859. IEEE Computer Society Press (2022). https:\/\/doi.org\/10.1109\/FOCS54457.2022.00086","DOI":"10.1109\/FOCS54457.2022.00086"},{"key":"1_CR39","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1007\/978-3-540-24638-1_2","volume-title":"Theory of Cryptography","author":"U Maurer","year":"2004","unstructured":"Maurer, U., Renner, R., Holenstein, C.: Indifferentiability, impossibility results on reductions, and applications to the random oracle methodology. In: Naor, M. (ed.) TCC 2004. LNCS, vol. 2951, pp. 21\u201339. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-24638-1_2"},{"key":"1_CR40","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"526","DOI":"10.1007\/978-3-642-34961-4_32","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2012","author":"B Mennink","year":"2012","unstructured":"Mennink, B.: Optimal collision security in double block length hashing with single length key. In: Wang, X., Sako, K. (eds.) ASIACRYPT 2012. LNCS, vol. 7658, pp. 526\u2013543. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-34961-4_32"},{"key":"1_CR41","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"232","DOI":"10.1007\/978-3-642-45239-0_14","volume-title":"Cryptography and Coding","author":"B Mennink","year":"2013","unstructured":"Mennink, B.: Indifferentiability of double length compression functions. In: Stam, M. (ed.) IMACC 2013. LNCS, vol. 8308, pp. 232\u2013251. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-45239-0_14"},{"key":"1_CR42","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"428","DOI":"10.1007\/0-387-34805-0_40","volume-title":"Advances in Cryptology \u2014 CRYPTO\u2019 89 Proceedings","author":"RC Merkle","year":"1990","unstructured":"Merkle, R.C.: One way hash functions and DES. In: Brassard, G. (ed.) CRYPTO 1989. LNCS, vol. 435, pp. 428\u2013446. Springer, New York (1990). https:\/\/doi.org\/10.1007\/0-387-34805-0_40"},{"key":"1_CR43","doi-asserted-by":"crossref","unstructured":"Nageler, M., Pallua, F., Eichlseder, M.: Finding collisions for round-reduced Romulus-H. IACR Trans. Symmetric Cryptol. 67\u201388 (2023)","DOI":"10.46586\/tosc.v2023.i1.67-88"},{"key":"1_CR44","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"338","DOI":"10.1007\/978-3-642-28496-0_20","volume-title":"Selected Areas in Cryptography","author":"Y Naito","year":"2012","unstructured":"Naito, Y.: Blockcipher-based double-length hash functions for pseudorandom oracles. In: Miri, A., Vaudenay, S. (eds.) SAC 2011. LNCS, vol. 7118, pp. 338\u2013355. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-28496-0_20"},{"key":"1_CR45","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"38","DOI":"10.1007\/978-3-319-59870-3_3","volume-title":"Information Security and Privacy","author":"Y Naito","year":"2017","unstructured":"Naito, Y.: Indifferentiability of double-block-length hash function without feed-forward operations. In: Pieprzyk, J., Suriadi, S. (eds.) ACISP 2017, Part II. LNCS, vol. 10343, pp. 38\u201357. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-59870-3_3"},{"key":"1_CR46","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1007\/978-3-030-30530-7_4","volume-title":"Progress in Cryptology \u2013 LATINCRYPT 2019","author":"Y Naito","year":"2019","unstructured":"Naito, Y.: Optimally indifferentiable double-block-length hashing without post-processing and with support for longer key than single block. In: Schwabe, P., Th\u00e9riault, N. (eds.) LATINCRYPT 2019. LNCS, vol. 11774, pp. 65\u201385. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-30530-7_4"},{"key":"1_CR47","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"376","DOI":"10.1007\/978-3-030-92078-4_13","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2021","author":"Y Naito","year":"2021","unstructured":"Naito, Y., Sasaki, Yu., Sugawara, T.: Double-block-length hash function for minimum memory size. In: Tibouchi, M., Wang, H. (eds.) ASIACRYPT 2021. LNCS, vol. 13092, pp. 376\u2013406. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-92078-4_13"},{"key":"1_CR48","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1007\/11596219_7","volume-title":"Progress in Cryptology - INDOCRYPT 2005","author":"M Nandi","year":"2005","unstructured":"Nandi, M.: Towards optimal double-length hash functions. In: Maitra, S., Veni Madhavan, C.E., Venkatesan, R. (eds.) INDOCRYPT 2005. LNCS, vol. 3797, pp. 77\u201389. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11596219_7"},{"key":"1_CR49","doi-asserted-by":"publisher","unstructured":"Nielsen, M.A., Chuang, I.L.: Quantum Computation and Quantum Information: 10th Anniversary Edition. Cambridge University Press (2010). https:\/\/doi.org\/10.1017\/CBO9780511976667","DOI":"10.1017\/CBO9780511976667"},{"key":"1_CR50","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"176","DOI":"10.1007\/978-3-642-10868-6_11","volume-title":"Cryptography and Coding","author":"O \u00d6zen","year":"2009","unstructured":"\u00d6zen, O., Stam, M.: Another glance at double-length hashing. In: Parker, M.G. (ed.) IMACC 2009. LNCS, vol. 5921, pp. 176\u2013201. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-10868-6_11"},{"key":"1_CR51","doi-asserted-by":"crossref","unstructured":"Prencel, B., Bosselaers, A., Govaerts, R., Vandewalle, J.: Collision-free hashfunctions based on blockcipher algorithms. In: Proceedings of the International Carnahan Conference on Security Technology, pp. 203\u2013210. IEEE (1989)","DOI":"10.1109\/CCST.1989.751980"},{"key":"1_CR52","doi-asserted-by":"publisher","unstructured":"Rivest, R.L.: The MD4 message-digest algorithm. RFC 1320, 1\u201320 (1992). https:\/\/doi.org\/10.17487\/RFC1320","DOI":"10.17487\/RFC1320"},{"key":"1_CR53","doi-asserted-by":"publisher","unstructured":"Rivest, R.L.: The MD5 message-digest algorithm. RFC 1321 (1992). https:\/\/doi.org\/10.17487\/RFC1321","DOI":"10.17487\/RFC1321"},{"key":"1_CR54","doi-asserted-by":"publisher","unstructured":"Shor, P.W.: Algorithms for quantum computation: discrete logarithms and factoring. In: 35th FOCS, pp. 124\u2013134. IEEE Computer Society Press (1994). https:\/\/doi.org\/10.1109\/SFCS.1994.365700","DOI":"10.1109\/SFCS.1994.365700"},{"key":"1_CR55","doi-asserted-by":"publisher","unstructured":"Simon, D.R.: On the power of quantum computation. In: 35th FOCS, pp. 116\u2013123. IEEE Computer Society Press (1994). https:\/\/doi.org\/10.1109\/SFCS.1994.365701","DOI":"10.1109\/SFCS.1994.365701"},{"issue":"180","key":"1_CR56","first-page":"15","volume":"17","author":"SH Standard","year":"1995","unstructured":"Standard, S.H.: FIPS pub 180-1. Natl. Inst. Stand. Technol. 17(180), 15 (1995)","journal-title":"Natl. Inst. Stand. Technol."},{"key":"1_CR57","unstructured":"Standard, S.H.: Federal information processing standards (FIPS) publication FIPS-180-2. US Doc\/NIST (2002)"},{"key":"1_CR58","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1007\/978-3-540-72540-4_3","volume-title":"Advances in Cryptology - EUROCRYPT 2007","author":"JP Steinberger","year":"2007","unstructured":"Steinberger, J.P.: The collision intractability of MDC-2 in the ideal-cipher model. In: Naor, M. (ed.) EUROCRYPT 2007. LNCS, vol. 4515, pp. 34\u201351. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-72540-4_3"},{"key":"1_CR59","unstructured":"Unruh, D.: Computationally binding quantum commitments. Cryptology ePrint Archive, Report 2015\/361 (2015). https:\/\/eprint.iacr.org\/2015\/361"},{"key":"1_CR60","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"166","DOI":"10.1007\/978-3-662-53890-6_6","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2016","author":"D Unruh","year":"2016","unstructured":"Unruh, D.: Collapse-binding quantum commitments without random oracles. In: Cheon, J.H., Takagi, T. (eds.) ASIACRYPT 2016, Part II. LNCS, vol. 10032, pp. 166\u2013195. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-53890-6_6"},{"key":"1_CR61","unstructured":"Unruh, D.: Collapsing sponges: post-quantum security of the sponge construction. Cryptology ePrint Archive, Paper 2017\/282 (2017). https:\/\/eprint.iacr.org\/2017\/282"},{"issue":"7\u20138","key":"1_CR62","first-page":"557","volume":"15","author":"M Zhandry","year":"2015","unstructured":"Zhandry, M.: A note on the quantum collision and set equality problems. Quant. Inf. Comput. 15(7\u20138), 557\u2013567 (2015)","journal-title":"Quant. Inf. Comput."},{"key":"1_CR63","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, Part II. LNCS, vol. 11693, pp. 239\u2013268. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-26951-7_9"}],"container-title":["Lecture Notes in Computer Science","Information Security and Privacy"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-96-9098-5_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,10]],"date-time":"2025-07-10T09:27:06Z","timestamp":1752139626000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-96-9098-5_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9789819690978","9789819690985"],"references-count":63,"URL":"https:\/\/doi.org\/10.1007\/978-981-96-9098-5_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"7 July 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ACISP","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Australasian Conference on Information Security and Privacy","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Wollongong, NSW","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Australia","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":"14 July 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 July 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"acisp2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/uow-ic2.github.io\/acisp2025\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}