{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,9]],"date-time":"2026-01-09T21:04:44Z","timestamp":1767992684492,"version":"3.49.0"},"publisher-location":"Cham","reference-count":21,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032018861","type":"print"},{"value":"9783032018878","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-3-032-01887-8_4","type":"book-chapter","created":{"date-parts":[[2025,8,16]],"date-time":"2025-08-16T19:17:09Z","timestamp":1755371829000},"page":"93-123","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["At the\u00a0Top of\u00a0the\u00a0Hypercube - Better Size-Time Tradeoffs for\u00a0Hash-Based Signatures"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0009-0001-0347-3378","authenticated-orcid":false,"given":"Dmitry","family":"Khovratovich","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8555-4891","authenticated-orcid":false,"given":"Mikhail","family":"Kudinov","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4620-7264","authenticated-orcid":false,"given":"Benedikt","family":"Wagner","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,8,17]]},"reference":[{"key":"4_CR1","doi-asserted-by":"publisher","unstructured":"Bernstein, D.J., H\u00fclsing, A., K\u00f6lbl, S., Niederhagen, R., Rijneveld, J., Schwabe, P.: The SPHINCS$$^+$$ signature framework. In: Cavallaro, L., Kinder, J., Wang, X., Katz, J. (eds.) ACM CCS 2019, pp. 2129\u20132146. ACM Press (2019). https:\/\/doi.org\/10.1145\/3319535.3363229","DOI":"10.1145\/3319535.3363229"},{"key":"4_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1007\/3-540-48658-5_9","volume-title":"Advances in Cryptology \u2014 CRYPTO \u201994","author":"D Bleichenbacher","year":"1994","unstructured":"Bleichenbacher, D., Maurer, U.M.: Directed acyclic graphs, one-way functions and digital signatures. In: Desmedt, Y.G. (ed.) CRYPTO 1994. LNCS, vol. 839, pp. 75\u201382. Springer, Heidelberg (1994). https:\/\/doi.org\/10.1007\/3-540-48658-5_9"},{"key":"4_CR3","unstructured":"Boneh, D., Shoup, V.: A graduate course in applied cryptography. Draft 0.5 (2020)"},{"key":"4_CR4","doi-asserted-by":"publisher","unstructured":"Bos, J.W., H\u00fclsing, A., Renes, J., van Vredendaal, C.: Rapidly verifiable XMSS signatures. IACR TCHES 2021(1), 137\u2013168 (2021). https:\/\/doi.org\/10.46586\/tches.v2021.i1.137-168, https:\/\/tches.iacr.org\/index.php\/TCHES\/article\/view\/8730","DOI":"10.46586\/tches.v2021.i1.137-168"},{"key":"4_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/3-540-48071-4_1","volume-title":"Advances in Cryptology \u2014 CRYPTO\u2019 92","author":"JNE Bos","year":"1993","unstructured":"Bos, J.N.E., Chaum, D.: Provably unforgeable signatures. In: Brickell, E.F. (ed.) CRYPTO 1992. LNCS, vol. 740, pp. 1\u201314. Springer, Heidelberg (1993). https:\/\/doi.org\/10.1007\/3-540-48071-4_1"},{"key":"4_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1007\/978-3-642-25405-5_8","volume-title":"Post-Quantum Cryptography","author":"J Buchmann","year":"2011","unstructured":"Buchmann, J., Dahmen, E., H\u00fclsing, A.: XMSS - a practical forward secure signature scheme based on minimal security assumptions. In: Yang, B.-Y. (ed.) PQCrypto 2011. LNCS, vol. 7071, pp. 117\u2013129. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-25405-5_8"},{"key":"4_CR7","unstructured":"Cruz, J.P., Yatani, Y., Kaji, Y.: Constant-sum fingerprinting for winternitz one-time signature. In: 2016 International Symposium on Information Theory and Its Applications (ISITA), pp. 703\u2013707. IEEE (2016)"},{"key":"4_CR8","doi-asserted-by":"crossref","unstructured":"Drake, J., Khovratovich, D., Kudinov, M., Wagner, B.: Hash-based multi-signatures for post-quantum ethereum. Cryptology ePrint Archive, Paper 2025\/055 (2025). https:\/\/eprint.iacr.org\/2025\/055","DOI":"10.62056\/aey7qjp10"},{"key":"4_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"104","DOI":"10.1007\/3-540-47721-7_8","volume-title":"Advances in Cryptology \u2014 CRYPTO\u2019 86","author":"O Goldreich","year":"1987","unstructured":"Goldreich, O.: Two remarks concerning the Goldwasser-Micali-Rivest signature scheme. In: Odlyzko, A.M. (ed.) CRYPTO 1986. LNCS, vol. 263, pp. 104\u2013110. Springer, Heidelberg (1987). https:\/\/doi.org\/10.1007\/3-540-47721-7_8"},{"key":"4_CR10","doi-asserted-by":"publisher","unstructured":"Huelsing, A., Butin, D., Gazdag, S.L., Rijneveld, J., Mohaisen, A.: XMSS: eXtended Merkle Signature Scheme. RFC 8391 (2018). https:\/\/doi.org\/10.17487\/RFC8391, https:\/\/www.rfc-editor.org\/info\/rfc8391","DOI":"10.17487\/RFC8391"},{"key":"4_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1007\/978-3-642-38553-7_10","volume-title":"Progress in Cryptology \u2013 AFRICACRYPT 2013","author":"A H\u00fclsing","year":"2013","unstructured":"H\u00fclsing, A.: W-OTS+ \u2013 shorter signatures for hash-based signature schemes. In: Youssef, A., Nitaj, A., Hassanien, A.E. (eds.) AFRICACRYPT 2013. LNCS, vol. 7918, pp. 173\u2013188. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-38553-7_10"},{"key":"4_CR12","unstructured":"H\u00fclsing, A., et al.: SPHINCS+. Tech. rep., National Institute of Standards and Technology (2022). https:\/\/csrc.nist.gov\/Projects\/post-quantum-cryptography\/selected-algorithms-2022"},{"key":"4_CR13","doi-asserted-by":"publisher","unstructured":"H\u00fclsing, A., Kudinov, M.A.: Recovering the tight security proof of SPHINCS. In: Agrawal, S., Lin, D. (eds.) Advances in Cryptology \u2013 ASIACRYPT 2022. ASIACRYPT 2022. LNCS, vol. 13794, pp. 3\u201333. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-22972-5_1","DOI":"10.1007\/978-3-031-22972-5_1"},{"key":"4_CR14","doi-asserted-by":"publisher","unstructured":"H\u00fclsing, A., Kudinov, M.A., Ronen, E., Yogev, E.: SPHINCS+C: compressing SPHINCS+ with (almost) no cost. In: 2023 IEEE Symposium on Security and Privacy, pp. 1435\u20131453. IEEE Computer Society Press (2023). https:\/\/doi.org\/10.1109\/SP46215.2023.10179381","DOI":"10.1109\/SP46215.2023.10179381"},{"key":"4_CR15","doi-asserted-by":"publisher","unstructured":"Khaburzaniya, I., Chalkias, K., Lewi, K., Malvai, H.: Aggregating and thresholdizing hash-based signatures using STARKs. In: Suga, Y., Sakurai, K., Ding, X., Sako, K. (eds.) ASIACCS 22, pp. 393\u2013407. ACM Press (2022). https:\/\/doi.org\/10.1145\/3488932.3524128","DOI":"10.1145\/3488932.3524128"},{"key":"4_CR16","unstructured":"Lamport, L.: Constructing digital signatures from a one-way function. Technical Report SRI-CSL-98, SRI International Computer Science Laboratory (1979)"},{"key":"4_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"369","DOI":"10.1007\/3-540-48184-2_32","volume-title":"Advances in Cryptology \u2014 CRYPTO \u201987","author":"RC Merkle","year":"1988","unstructured":"Merkle, R.C.: A digital signature based on a conventional encryption function. In: Pomerance, C. (ed.) CRYPTO 1987. LNCS, vol. 293, pp. 369\u2013378. Springer, Heidelberg (1988). https:\/\/doi.org\/10.1007\/3-540-48184-2_32"},{"key":"4_CR18","unstructured":"Merkle, R.C.: Secrecy, authentication, and public key systems. Stanford university (1979)"},{"issue":"4","key":"4_CR19","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1007\/s13389-021-00264-9","volume":"11","author":"LP Perin","year":"2021","unstructured":"Perin, L.P., Zambonin, G., Cust\u00f3dio, R., Moura, L., Panario, D.: Improved constant-sum encodings for hash-based signatures. J. Cryptogr. Eng. 11(4), 329\u2013351 (2021). https:\/\/doi.org\/10.1007\/s13389-021-00264-9","journal-title":"J. Cryptogr. Eng."},{"key":"4_CR20","doi-asserted-by":"crossref","unstructured":"Vaudenay, S.: One-time identification with low memory. In: Eurocode\u201992: International Symposium on Coding Theory and Applications, pp. 217\u2013228. Springer (1993)","DOI":"10.1007\/978-3-7091-2786-5_19"},{"key":"4_CR21","doi-asserted-by":"publisher","unstructured":"Zhang, K., Cui, H., Yu, Y.: Revisiting the constant-sum winternitz one-time signature with applications to SPHINCS+ and XMSS. In: Handschuh, H., Lysyanskaya, A. (eds.) CRYPTO\u00a02023, Part\u00a0V. LNCS, vol. 14085, pp. 455\u2013483. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-38554-4_15","DOI":"10.1007\/978-3-031-38554-4_15"}],"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-01887-8_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,16]],"date-time":"2025-08-16T19:17:13Z","timestamp":1755371833000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-01887-8_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9783032018861","9783032018878"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-01887-8_4","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":"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"}}]}}