{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,17]],"date-time":"2026-08-17T15:01:08Z","timestamp":1786978868448,"version":"3.56.0"},"publisher-location":"Cham","reference-count":47,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031577208","type":"print"},{"value":"9783031577185","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-57718-5_9","type":"book-chapter","created":{"date-parts":[[2024,4,12]],"date-time":"2024-04-12T18:01:17Z","timestamp":1712944877000},"page":"259-288","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":10,"title":["Probabilistic Hash-and-Sign with\u00a0Retry in\u00a0the\u00a0Quantum Random Oracle Model"],"prefix":"10.1007","author":[{"given":"Haruhisa","family":"Kosuge","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6832-9940","authenticated-orcid":false,"given":"Keita","family":"Xagawa","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2024,4,13]]},"reference":[{"key":"9_CR1","doi-asserted-by":"publisher","unstructured":"Ambainis, A., Hamburg, M., Unruh, D.: Quantum security proofs using semi-classical oracles. In: Boldyreva and Micciancio [8], pp. 269\u2013295. https:\/\/doi.org\/10.1007\/978-3-030-26951-7_10","DOI":"10.1007\/978-3-030-26951-7_10"},{"key":"9_CR2","unstructured":"Banegas, G., et al.: Wave. Technical report, National Institute of Standards and Technology (2023). https:\/\/wave-sign.org\/wave_documentation.pdf"},{"key":"9_CR3","doi-asserted-by":"publisher","unstructured":"Barbosa, M., et al.: Fixing and mechanizing the security proof of fiat-shamir with aborts and dilithium. In: Handschuh and Lysyanskaya [26], pp. 358\u2013389. https:\/\/doi.org\/10.1007\/978-3-031-38554-4_12","DOI":"10.1007\/978-3-031-38554-4_12"},{"key":"9_CR4","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, pp. 62\u201373. ACM Press (1993). https:\/\/doi.org\/10.1145\/168588.168596","DOI":"10.1145\/168588.168596"},{"key":"9_CR5","doi-asserted-by":"publisher","unstructured":"Bellare, M., Rogaway, P.: The exact security of digital signatures: how to sign with RSA and Rabin. In: Maurer [34], pp. 399\u2013416. https:\/\/doi.org\/10.1007\/3-540-68339-9_34","DOI":"10.1007\/3-540-68339-9_34"},{"key":"9_CR6","unstructured":"Beullens, W., Campos, F., Celi, S., Hess, B., Kannwischer, M.: MAYO. Technical report, National Institute of Standards and Technology (2023). https:\/\/pqmayo.org\/assets\/specs\/mayo.pdf"},{"key":"9_CR7","doi-asserted-by":"publisher","unstructured":"Bindel, N., Hamburg, M., H\u00f6velmanns, K., H\u00fclsing, A., Persichetti, E.: Tighter proofs of CCA security in the quantum random oracle model. In: Hofheinz, D., Rosen, A. (eds.) TCC\u00a02019, Part\u00a0II. LNCS, vol. 11892, pp. 61\u201390. Springer, Heidelberg (2019). https:\/\/doi.org\/10.1007\/978-3-030-36033-7_3","DOI":"10.1007\/978-3-030-36033-7_3"},{"key":"9_CR8","unstructured":"Boldyreva, A., Micciancio, D. (eds.): CRYPTO 2019, Part II. LNCS, vol. 11693. Springer, Heidelberg (2019)"},{"key":"9_CR9","doi-asserted-by":"publisher","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\u00a02011. LNCS, vol.\u00a07073, pp. 41\u201369. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-25385-0_3","DOI":"10.1007\/978-3-642-25385-0_3"},{"key":"9_CR10","unstructured":"Casanova, A., Faug\u00e8re, J.C., Macario-Rat, G., Patarin, J., Perret, L., Ryckeghem, J.: GeMSS. Technical report, National Institute of Standards and Technology (2020). https:\/\/csrc.nist.gov\/projects\/post-quantum-cryptography\/post-quantum-cryptography-standardization\/round-3-submissions"},{"key":"9_CR11","doi-asserted-by":"publisher","unstructured":"Chailloux, A., Debris-Alazard, T.: Tight and optimal reductions for signatures based on average trapdoor preimage sampleable functions and applications to code-based signatures. In: Kiayias, A., Kohlweiss, M., Wallden, P., Zikas, V. (eds.) PKC\u00a02020, Part\u00a0II. LNCS, vol. 12111, pp. 453\u2013479. Springer, Heidelberg (2020). https:\/\/doi.org\/10.1007\/978-3-030-45388-6_16","DOI":"10.1007\/978-3-030-45388-6_16"},{"key":"9_CR12","doi-asserted-by":"publisher","unstructured":"Chatterjee, S., Das, M.P.L., Pandit, T.: Revisiting the security of salted UOV signature. In: Isobe, T., Sarkar, S. (eds.) Progress in Cryptology \u2013 INDOCRYPT 2022. LNCS, vol. 13774, pp. 697\u2013719. Springer, Heidelberg (2022). https:\/\/doi.org\/10.1007\/978-3-031-22912-1_31","DOI":"10.1007\/978-3-031-22912-1_31"},{"key":"9_CR13","doi-asserted-by":"publisher","unstructured":"Courtois, N., Finiasz, M., Sendrier, N.: How to achieve a McEliece-based digital signature scheme. In: Boyd, C. (ed.) ASIACRYPT\u00a02001. LNCS, vol.\u00a02248, pp. 157\u2013174. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-45682-1_10","DOI":"10.1007\/3-540-45682-1_10"},{"key":"9_CR14","doi-asserted-by":"publisher","unstructured":"Dallot, L.: Towards a concrete security proof of Courtois, Finiasz and Sendrier signature scheme. In: Lucks, S., Sadeghi, AR., Wolf, C. (eds.) WEWoRC 2007. LNCS, vol.\u00a04945, pp. 65\u201377. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-88353-1_6","DOI":"10.1007\/978-3-540-88353-1_6"},{"key":"9_CR15","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 and Lysyanskaya [26], pp. 327\u2013357. https:\/\/doi.org\/10.1007\/978-3-031-38554-4_11","DOI":"10.1007\/978-3-031-38554-4_11"},{"key":"9_CR16","unstructured":"Ding, J., et al.: Rainbow. Technical report, National Institute of Standards and Technology (2020). https:\/\/csrc.nist.gov\/projects\/post-quantum-cryptography\/post-quantum-cryptography-standardization\/round-3-submissions"},{"key":"9_CR17","doi-asserted-by":"publisher","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\u00a02020, Part\u00a0III. LNCS, vol. 12172, pp. 602\u2013631. Springer, Heidelberg (2020). https:\/\/doi.org\/10.1007\/978-3-030-56877-1_21","DOI":"10.1007\/978-3-030-56877-1_21"},{"key":"9_CR18","doi-asserted-by":"publisher","unstructured":"Don, J., Fehr, S., Majenz, C., Schaffner, C.: Security of the Fiat-Shamir transformation in the quantum random-oracle model. In: Boldyreva and Micciancio [8], pp. 356\u2013383. https:\/\/doi.org\/10.1007\/978-3-030-26951-7_13","DOI":"10.1007\/978-3-030-26951-7_13"},{"key":"9_CR19","doi-asserted-by":"publisher","unstructured":"Duman, J., H\u00f6velmanns, K., Kiltz, E., Lyubashevsky, V., Seiler, G.: Faster lattice-based KEMs via a generic fujisaki-okamoto transform using prefix hashing. In: Vigna, G., Shi, E. (eds.) ACM CCS 2021, pp. 2722\u20132737. ACM Press (2021). https:\/\/doi.org\/10.1145\/3460120.3484819","DOI":"10.1145\/3460120.3484819"},{"key":"9_CR20","unstructured":"Faugere, J.C., Fouque, P.A., Macario-Rat, G., Minaud, B., Patarin, J.: PROV. Technical report, National Institute of Standards and Technology (2023). https:\/\/csrc.nist.gov\/csrc\/media\/Projects\/pqc-dig-sig\/documents\/round-1\/spec-files\/prov-spec-web.pdf"},{"key":"9_CR21","doi-asserted-by":"publisher","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.\u00a0263, pp. 186\u2013194. Springer, Heidelberg (1987). https:\/\/doi.org\/10.1007\/3-540-47721-7_12","DOI":"10.1007\/3-540-47721-7_12"},{"key":"9_CR22","unstructured":"Furue, H., Ikematsu, Y., Hoshino, F., Kiyomura, Y., Saito, T., Takagi, T.: QR-UOV. Technical report, National Institute of Standards and Technology (2023). http:\/\/info.isl.ntt.co.jp\/crypt\/qruov\/files\/NISTPQC_QRUOV.pdf"},{"key":"9_CR23","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.) 40th ACM STOC, pp. 197\u2013206. ACM Press (2008). https:\/\/doi.org\/10.1145\/1374376.1374407","DOI":"10.1145\/1374376.1374407"},{"issue":"2","key":"9_CR24","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1137\/0217017","volume":"17","author":"S Goldwasser","year":"1988","unstructured":"Goldwasser, S., Micali, S., Rivest, R.L.: A digital signature scheme secure against adaptive chosen-message attacks. SIAM J. Comput. 17(2), 281\u2013308 (1988). https:\/\/doi.org\/10.1137\/0217017","journal-title":"SIAM J. Comput."},{"key":"9_CR25","doi-asserted-by":"publisher","unstructured":"Grilo, A.B., H\u00f6velmanns, K., H\u00fclsing, A., Majenz, C.: Tight adaptive reprogramming in the QROM. In: Tibouchi, M., Wang, H. (eds.) ASIACRYPT\u00a02021, Part\u00a0I. LNCS, vol. 13090, pp. 637\u2013667. Springer, Heidelberg (2021). https:\/\/doi.org\/10.1007\/978-3-030-92062-3_22","DOI":"10.1007\/978-3-030-92062-3_22"},{"key":"9_CR26","unstructured":"Handschuh, H., Lysyanskaya, A. (eds.): CRYPTO 2023, Part V. LNCS, vol. 14085. Springer, Heidelberg (2023)"},{"key":"9_CR27","doi-asserted-by":"publisher","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\u00a02018, Part\u00a0I. LNCS, vol. 11272, pp. 275\u2013304. Springer, Heidelberg (2018). https:\/\/doi.org\/10.1007\/978-3-030-03326-2_10","DOI":"10.1007\/978-3-030-03326-2_10"},{"key":"9_CR28","doi-asserted-by":"publisher","unstructured":"H\u00fclsing, A., Rijneveld, J., Song, F.: Mitigating multi-target attacks in hash-based signatures. In: Cheng, C.M., Chung, K.M., Persiano, G., Yang, B.Y. (eds.) PKC\u00a02016, Part\u00a0I. LNCS, vol.\u00a09614, pp. 387\u2013416. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-49384-7_15","DOI":"10.1007\/978-3-662-49384-7_15"},{"key":"9_CR29","doi-asserted-by":"publisher","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\u00a02018, Part\u00a0III. LNCS, vol. 10822, pp. 552\u2013586. Springer, Heidelberg (2018). https:\/\/doi.org\/10.1007\/978-3-319-78372-7_18","DOI":"10.1007\/978-3-319-78372-7_18"},{"key":"9_CR30","doi-asserted-by":"publisher","unstructured":"Kiltz, E., Masny, D., Pan, J.: Optimal security proofs for signatures from identification schemes. In: Robshaw, M., Katz, J. (eds.) CRYPTO\u00a02016, Part\u00a0II. LNCS, vol.\u00a09815, pp. 33\u201361. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-53008-5_2","DOI":"10.1007\/978-3-662-53008-5_2"},{"key":"9_CR31","doi-asserted-by":"publisher","unstructured":"Kipnis, A., Patarin, J., Goubin, L.: Unbalanced Oil and Vinegar signature schemes. In: Stern, J. (ed.) EUROCRYPT 1999. LNCS, vol.\u00a01592, pp. 206\u2013222. Springer, Heidelberg (1999). https:\/\/doi.org\/10.1007\/3-540-48910-X_15","DOI":"10.1007\/3-540-48910-X_15"},{"key":"9_CR32","unstructured":"Liu, Y., Jiang, H., Zhao, Y.: Tighter post-quantum proof for plain FDH, PFDH and GPV-IBE. Cryptology ePrint Archive, Report 2022\/1441 (2022). https:\/\/eprint.iacr.org\/2022\/1441"},{"key":"9_CR33","doi-asserted-by":"publisher","unstructured":"Lyubashevsky, V.: Fiat-Shamir with aborts: applications to lattice and factoring-based signatures. In: Matsui, M. (ed.) ASIACRYPT\u00a02009. LNCS, vol.\u00a05912, pp. 598\u2013616. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-10366-7_35","DOI":"10.1007\/978-3-642-10366-7_35"},{"key":"9_CR34","unstructured":"Maurer, U.M. (ed.): EUROCRYPT 1996. LNCS, vol. 1070. Springer, Heidelberg (1996)"},{"key":"9_CR35","doi-asserted-by":"crossref","unstructured":"Menezes, A., Smart, N.: Security of signature schemes in a multi-user setting. Des. Codes Cryptogr. 33(3), 261\u2013274 (2004). https:\/\/link.springer.com\/article\/10.1023\/B:DESI.0000036250.18062.3f","DOI":"10.1023\/B:DESI.0000036250.18062.3f"},{"key":"9_CR36","unstructured":"NIST: Submission requirements and evaluation criteria for the post-quantum cryptography standardization process (2017). https:\/\/csrc.nist.gov\/CSRC\/media\/Projects\/Post-Quantum-Cryptography\/documents\/call-for-proposals-final-dec-2016.pdf"},{"key":"9_CR37","unstructured":"NIST: Call for additional digital signature schemes for the post-quantum cryptography standardization process (2022). https:\/\/csrc.nist.gov\/csrc\/media\/Projects\/pqc-dig-sig\/documents\/call-for-proposals-dig-sig-sept-2022.pdf"},{"key":"9_CR38","unstructured":"NIST: Status report on the third round of the NIST post-quantum cryptography standardization process (2022). https:\/\/csrc.nist.gov\/publications\/detail\/nistir\/8413\/final"},{"key":"9_CR39","doi-asserted-by":"publisher","unstructured":"Patarin, J.: Hidden fields equations (HFE) and isomorphisms of polynomials (IP): two new families of asymmetric algorithms. In: Maurer [34], pp. 33\u201348. https:\/\/doi.org\/10.1007\/3-540-68339-9_4","DOI":"10.1007\/3-540-68339-9_4"},{"key":"9_CR40","doi-asserted-by":"publisher","unstructured":"Patarin, J., Goubin, L., Courtois, N.: Improved algorithms for isomorphisms of polynomials. In: Nyberg, K. (ed.) EUROCRYPT 1998. LNCS, vol.\u00a01403, pp. 184\u2013200. Springer, Heidelberg (1998). https:\/\/doi.org\/10.1007\/BFb0054126","DOI":"10.1007\/BFb0054126"},{"key":"9_CR41","doi-asserted-by":"crossref","unstructured":"Petrank, E., Roth, R.M.: Is code equivalence easy to decide? IEEE Trans. Inf. Theory 43(5), 1602\u20131604 (1997). https:\/\/ieeexplore.ieee.org\/document\/623157","DOI":"10.1109\/18.623157"},{"key":"9_CR42","doi-asserted-by":"publisher","unstructured":"Sakumoto, K., Shirai, T., Hiwatari, H.: On provable security of UOV and HFE signature schemes against chosen-message attack. In: Yang, B.Y. (ed.) PQCrypto 2011, pp. 68\u201382. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-25405-5_5","DOI":"10.1007\/978-3-642-25405-5_5"},{"key":"9_CR43","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":"9_CR44","doi-asserted-by":"publisher","unstructured":"Unruh, D.: Quantum position verification in the random oracle model. In: Garay, J.A., Gennaro, R. (eds.) CRYPTO\u00a02014, Part\u00a0II. LNCS, vol.\u00a08617, pp. 1\u201318. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-662-44381-1_1","DOI":"10.1007\/978-3-662-44381-1_1"},{"key":"9_CR45","doi-asserted-by":"publisher","unstructured":"Yamakawa, T., Zhandry, M.: Classical vs quantum random oracles. In: Canteaut, A., Standaert, F.X. (eds.) EUROCRYPT\u00a02021, Part\u00a0II. LNCS, vol. 12697, pp. 568\u2013597. Springer, Heidelberg (2021). https:\/\/doi.org\/10.1007\/978-3-030-77886-6_20","DOI":"10.1007\/978-3-030-77886-6_20"},{"key":"9_CR46","doi-asserted-by":"publisher","unstructured":"Yamakawa, T., Zhandry, M.: Verifiable quantum advantage without structure. In: 63rd FOCS, pp. 69\u201374. IEEE Computer Society Press (2022). https:\/\/doi.org\/10.1109\/FOCS54457.2022.00014","DOI":"10.1109\/FOCS54457.2022.00014"},{"key":"9_CR47","doi-asserted-by":"crossref","unstructured":"Zhandry, M.: Secure identity-based encryption in the quantum random oracle model. Cryptology ePrint Archive, Report 2012\/076 (2012). https:\/\/eprint.iacr.org\/2012\/076","DOI":"10.1007\/978-3-642-32009-5_44"}],"container-title":["Lecture Notes in Computer Science","Public-Key Cryptography \u2013 PKC 2024"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-57718-5_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,4,12]],"date-time":"2024-04-12T18:01:53Z","timestamp":1712944913000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-57718-5_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031577208","9783031577185"],"references-count":47,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-57718-5_9","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":"13 April 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"PKC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"IACR International Conference on Public-Key Cryptography","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Sydney, 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":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 April 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 April 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"pkc2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}