{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,15]],"date-time":"2026-08-15T09:27:21Z","timestamp":1786786041126,"version":"build-2736575974"},"publisher-location":"Cham","reference-count":32,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032353979","type":"print"},{"value":"9783032353986","type":"electronic"}],"license":[{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"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":[[2026]]},"DOI":"10.1007\/978-3-032-35398-6_19","type":"book-chapter","created":{"date-parts":[[2026,8,15]],"date-time":"2026-08-15T08:44:51Z","timestamp":1786783491000},"page":"573-602","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Shorter Hash-Based Signatures Using Forced Pruning"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0009-0001-4558-7373","authenticated-orcid":false,"given":"Mehdi","family":"Abri","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6084-9303","authenticated-orcid":false,"given":"Jonathan","family":"Katz","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2026,8,16]]},"reference":[{"key":"19_CR1","unstructured":"Alagic, G., et al.: Status report on the third round of the NIST post-quantum cryptography standardization process. Tech. Rep. NIST IR 8413-upd1, National Institute of Standards and Technology (2022). https:\/\/nvlpubs.nist.gov\/nistpubs\/ir\/2022\/NIST.IR.8413-upd1.pdf"},{"key":"19_CR2","unstructured":"Aumasson, J.P., Endignoux, G.: Clarifying the subset-resilience problem (2017). https:\/\/eprint.iacr.org\/2017\/909"},{"key":"19_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1007\/978-3-319-76953-0_12","volume-title":"Topics in Cryptology \u2013 CT-RSA 2018","author":"J-P Aumasson","year":"2018","unstructured":"Aumasson, J.-P., Endignoux, G.: Improving stateless hash-based signatures. In: Smart, N.P. (ed.) CT-RSA 2018. LNCS, vol. 10808, pp. 219\u2013242. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-76953-0_12"},{"key":"19_CR4","doi-asserted-by":"publisher","unstructured":"Bernstein, D.J., et al.: SPHINCS: practical stateless hash-based signatures. In: Oswald, E., Fischlin, M. (eds.) EUROCRYPT 2015. LNCS, vol. 9056, pp. 368\u2013397. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-46800-5_15","DOI":"10.1007\/978-3-662-46800-5_15"},{"key":"19_CR5","doi-asserted-by":"crossref","unstructured":"Bernstein, D.J., H\u00fclsing, A., K\u00f6lbl, S., Niederhagen, R., Rijneveld, J., Schwabe, P.: The SPHINCS$$^+$$ signature framework. In: 24th ACM Conference on Computer and Communications Security, pp. 2129\u20132146. ACM (2019). https:\/\/eprint.iacr.org\/2019\/1086","DOI":"10.1145\/3319535.3363229"},{"issue":"1","key":"19_CR6","doi-asserted-by":"publisher","first-page":"84","DOI":"10.1504\/IJACT.2013.053435","volume":"3","author":"J Buchmann","year":"2013","unstructured":"Buchmann, J., Dahmen, E., Ereth, S., H\u00fclsing, A., R\u00fcckert, M.: On the security of the Winternitz one-time signature scheme. Intl. J. Applied Cryptography 3(1), 84\u201396 (2013)","journal-title":"Intl. J. Applied Cryptography"},{"key":"19_CR7","doi-asserted-by":"crossref","unstructured":"Buchmann, J., Dahmen, E., H\u00fclsing, A.: XMSS: a practical forward secure signature scheme based on minimal security assumptions. In: International Workshop on Post-Quantum Cryptography (PQCrypto). LNCS, vol.\u00a07071, pp. 117\u2013129. Springer (2011). https:\/\/eprint.iacr.org\/2011\/484","DOI":"10.1007\/978-3-642-25405-5_8"},{"issue":"208","key":"19_CR8","first-page":"800","volume":"800","author":"DA Cooper","year":"2020","unstructured":"Cooper, D.A., Apon, D.C., Dang, Q.H., Davidson, M.S., Dworkin, M.J., Miller, C.A., et al.: Recommendation for stateful hash-based signature schemes. NIST Spec. Publ. 800(208), 800\u2013208 (2020)","journal-title":"NIST Spec. Publ."},{"key":"19_CR9","unstructured":"Dang, Q.: Smaller SLH-DSA (2025). https:\/\/csrc.nist.gov\/csrc\/media\/presentations\/2025\/sphincs-smaller-parameter-sets\/sphincs-dang_2.2.pdf"},{"key":"19_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"96","DOI":"10.1007\/11586821_8","volume-title":"Cryptography and Coding","author":"C Dods","year":"2005","unstructured":"Dods, C., Smart, N.P., Stam, M.: Hash based digital signature schemes. In: Smart, N.P. (ed.) Cryptography and Coding 2005. LNCS, vol. 3796, pp. 96\u2013115. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11586821_8"},{"key":"19_CR11","unstructured":"Fluhrer, S., Dang, Q.: Smaller SPHINCS$$^+$$ (2025). https:\/\/eprint.iacr.org\/2024\/018. all references are to the version dated Jan 14, 2025"},{"key":"19_CR12","doi-asserted-by":"crossref","unstructured":"Goldreich, O.: Two remarks concerning the Goldwasser-Micali-Rivest signature scheme. In: Advance in Cryptology-Crypto \u201986. LNCS, vol. 263, pp. 104\u2013110. Springer (1986)","DOI":"10.1007\/3-540-47721-7_8"},{"key":"19_CR13","doi-asserted-by":"crossref","unstructured":"H\u00fclsing, A.: W-OTS$$^+$$: shorter signatures for hash-based signature schemes. In: Progress in Cryptology\u2014Africacrypt 2013. LNCS, vol.\u00a07918, pp. 173\u2013188. Springer (2013). https:\/\/eprint.iacr.org\/2017\/965","DOI":"10.1007\/978-3-642-38553-7_10"},{"key":"19_CR14","doi-asserted-by":"crossref","unstructured":"H\u00fclsing, A., Kudinov, M.A.: Recovering the tight security proof of SPHINCS$$^+$$. In: Advance in Cryptology\u2014Asiacrypt 2022, Part\u00a0IV. LNCS, vol. 13794, pp. 3\u201333. Springer (2022)","DOI":"10.1007\/978-3-031-22972-5_1"},{"key":"19_CR15","doi-asserted-by":"crossref","unstructured":"H\u00fclsing, A., Kudinov, M.A., Ronen, E., Yogev, E.: SPHINCS+C: compressing SPHINCS+ with (almost) no cost. In: 44th IEEE Symposium on Security and Privacy, pp. 1435\u20131453. IEEE (2023). https:\/\/eprint.iacr.org\/2022\/778","DOI":"10.1109\/SP46215.2023.10179381"},{"key":"19_CR16","doi-asserted-by":"crossref","unstructured":"H\u00fclsing, A., Rausch, L., Buchmann, J.: Optimal parameters for XMSS$$^{{\\rm MT}}$$. In: Proceedings of Security Engineering and Intelligence Informatics\u2014CD-ARES 2013. LNCS, vol.\u00a08128, pp. 194\u2013208. Springer (2013). https:\/\/eprint.iacr.org\/2017\/966","DOI":"10.1007\/978-3-642-40588-4_14"},{"key":"19_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1007\/978-3-319-49100-4_12","volume-title":"Security Standardisation Research","author":"J Katz","year":"2016","unstructured":"Katz, J.: Analysis of a proposed hash-based signature standard. In: Chen, L., McGrew, D., Mitchell, C. (eds.) SSR 2016. LNCS, vol. 10074, pp. 261\u2013273. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-49100-4_12"},{"key":"19_CR18","doi-asserted-by":"crossref","unstructured":"Khovratovich, D., Kudinov, M.A., Wagner, B.: At the top of the hypercube\u2014better size-time tradeoffs for hash-based signatures. In: Adv. in Cryptology\u2014Crypto 2025, Part\u00a0VI. LNCS, vol. 16005, pp. 93\u2013123. Springer (2025). https:\/\/eprint.iacr.org\/2025\/889","DOI":"10.1007\/978-3-032-01887-8_4"},{"key":"19_CR19","unstructured":"K\u00f6lbl, S., Philipoom, J.: A note on SPHINCS$$^+$$ parameter sets (2024). https:\/\/eprint.iacr.org\/2022\/1725"},{"key":"19_CR20","unstructured":"Lamport, L.: Constructing digital signatures from a one way function. Tech. Rep. CSL-98, SRI Intl. Computer Science Laboratory (1979)"},{"key":"19_CR21","unstructured":"Leighton, F.T., Micali, S.: Large provably fast and secure digital signature schemes based on secure hash functions. In: US Patent 5, vol. 432, p. 852 (1995)"},{"key":"19_CR22","doi-asserted-by":"crossref","unstructured":"McGrew, D., Curcio, M., Fluhrer, S.: Leighton-Micali hash-based signatures. RFC\u00a08554, Internet Engineering Task Force (IETF) (2019). https:\/\/www.rfc-editor.org\/rfc\/rfc8554","DOI":"10.17487\/RFC8554"},{"key":"19_CR23","doi-asserted-by":"crossref","unstructured":"Merkle, R.C.: A digital signature based on a conventional encryption function. In: Adv. in Cryptology-Crypto \u201987. LNCS, vol. 293, pp. 369\u2013378. Springer (1987)","DOI":"10.1007\/3-540-48184-2_32"},{"key":"19_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"218","DOI":"10.1007\/0-387-34805-0_21","volume-title":"Advances in Cryptology \u2014 CRYPTO\u2019 89 Proceedings","author":"RC Merkle","year":"1990","unstructured":"Merkle, R.C.: A certified digital signature. In: Brassard, G. (ed.) CRYPTO 1989. LNCS, vol. 435, pp. 218\u2013238. Springer, New York (1990). https:\/\/doi.org\/10.1007\/0-387-34805-0_21"},{"key":"19_CR25","unstructured":"Merkle, R.C.: Secrecy, authentication, and public key systems. Tech. Rep. 1979-1, Stanford University (1979)"},{"key":"19_CR26","doi-asserted-by":"crossref","unstructured":"Naor, M., Yung, M.: Universal one-way hash functions and their cryptographic applications. In: Proceedings of 21st ACM Symposium on Theory of Computing, pp. 33\u201343. ACM (1989)","DOI":"10.1145\/73007.73011"},{"key":"19_CR27","unstructured":"Stateless hash-based digital signature standard. FIPS Publication\u00a0205, NIST (2024). https:\/\/nvlpubs.nist.gov\/nistpubs\/FIPS\/NIST.FIPS.205.pdf"},{"key":"19_CR28","doi-asserted-by":"crossref","unstructured":"Pieprzyk, J., Wang, H., Xing, C.: Multiple-time signature schemes against adaptive chosen message attacks. In: Selected Areas in Cryptography (SAC) 2003. LNCS, vol. 3006, pp. 88\u2013100. Springer (2003)","DOI":"10.1007\/978-3-540-24654-1_7"},{"key":"19_CR29","doi-asserted-by":"publisher","unstructured":"Reyzin, L., Reyzin, N.: Better than BiBa: short one-time signatures with fast signing and verifying. In: Batten, L., Seberry, J. (eds.) ACISP 2002. LNCS, vol. 2384, pp. 144\u2013153. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-45450-0_11","DOI":"10.1007\/3-540-45450-0_11"},{"key":"19_CR30","doi-asserted-by":"crossref","unstructured":"Rompel, J.: One-way functions are necessary and sufficient for secure signatures. In: Proceedings of 22nd Annual ACM Symposium on Theory of Computing, pp. 387\u2013394. ACM (1990)","DOI":"10.1145\/100216.100269"},{"key":"19_CR31","unstructured":"Zhang, K., Cui, H., Yu, Y.: SPHINCS-$$\\alpha $$: a compact stateless hash-based signature scheme (2022). https:\/\/eprint.iacr.org\/2022\/059. subsumed by [32]"},{"key":"19_CR32","doi-asserted-by":"crossref","unstructured":"Zhang, K., Cui, H., Yu, Y.: Revisiting the constant-sum Winternitz one-time signature with applications to SPHINCS$$^+$$ and XMSS. In: Adv. in Cryptology\u2014Crypto 2023, Part V. LNCS, vol. 14085, pp. 455\u2013483. Springer (2023). https:\/\/eprint.iacr.org\/2023\/850","DOI":"10.1007\/978-3-031-38554-4_15"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 CRYPTO 2026"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-35398-6_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,8,15]],"date-time":"2026-08-15T08:44:54Z","timestamp":1786783494000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-35398-6_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9783032353979","9783032353986"],"references-count":32,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-35398-6_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026]]},"assertion":[{"value":"16 August 2026","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":"2026","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 August 2026","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 August 2026","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"46","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"crypto2026","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/crypto.iacr.org\/2026\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}