{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,10]],"date-time":"2026-08-10T12:31:49Z","timestamp":1786365109159,"version":"build-2736575974"},"publisher-location":"Cham","reference-count":54,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032354112","type":"print"},{"value":"9783032354129","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-35412-9_1","type":"book-chapter","created":{"date-parts":[[2026,8,10]],"date-time":"2026-08-10T11:59:38Z","timestamp":1786363178000},"page":"3-34","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Aborting Random Oracles: How to Build Them, How to Use Them"],"prefix":"10.1007","author":[{"given":"Gottfried","family":"Herold","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Dmitry","family":"Khovratovich","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Mikhail","family":"Kudinov","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Stefano","family":"Tessaro","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Benedikt","family":"Wagner","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2026,8,11]]},"reference":[{"key":"1_CR1","unstructured":"Abdalla, M., Bellare, M., Rogaway, P.: DHIES: an encryption scheme based on the Diffie-Hellman problem. Contributions to IEEE P1363a (1998)"},{"key":"1_CR2","doi-asserted-by":"publisher","unstructured":"Andreeva, E., Bogdanov, A., Dodis, Y., Mennink, B., Steinberger, J.P.: On the indifferentiability of key-alternating ciphers. In: Canetti, R., Garay, J.A. (eds.) CRYPTO\u00a02013, Part\u00a0I. LNCS, vol.\u00a08042, pp. 531\u2013550. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-40041-4_29","DOI":"10.1007\/978-3-642-40041-4_29"},{"key":"1_CR3","doi-asserted-by":"publisher","unstructured":"Andreeva, E., Mennink, B., Preneel, B.: On the indifferentiability of the Gr\u00f8stl hash function. In: Garay, J.A., De Prisco, R. (eds.) SCN 2010. LNCS, vol.\u00a06280, pp. 88\u2013105. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-15317-4_7","DOI":"10.1007\/978-3-642-15317-4_7"},{"key":"1_CR4","unstructured":"Barbosa, M., et al.: Fixing and mechanizing the security proof of Fiat-Shamir with aborts and Dilithium. Cryptology ePrint Archive, Report 2023\/246 (2023). https:\/\/eprint.iacr.org\/2023\/246"},{"key":"1_CR5","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":"1_CR6","doi-asserted-by":"publisher","unstructured":"Ben-Sasson, E., Bentov, I., Horesh, Y., Riabzev, M.: Fast reed-solomon interactive oracle proofs of proximity. In: Chatzigiannakis, I., Kaklamanis, C., Marx, D., Sannella, D. (eds.) ICALP 2018. LIPIcs, vol.\u00a0107, pp. 14:1\u201314:17. Schloss Dagstuhl (2018). https:\/\/doi.org\/10.4230\/LIPIcs.ICALP.2018.14","DOI":"10.4230\/LIPIcs.ICALP.2018.14"},{"key":"1_CR7","doi-asserted-by":"publisher","unstructured":"Ben-Sasson, E., Chiesa, A., Spooner, N.: Interactive oracle proofs. In: Hirt, M., Smith, A.D. (eds.) TCC\u00a02016-B, Part\u00a0II. LNCS, vol.\u00a09986, pp. 31\u201360. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-53644-5_2","DOI":"10.1007\/978-3-662-53644-5_2"},{"key":"1_CR8","doi-asserted-by":"publisher","unstructured":"Bertoni, G., Daemen, J., Peeters, M., Van Assche, G.: On the indifferentiability of the Sponge construction. In: Smart, N.P. (ed.) EUROCRYPT\u00a02008. LNCS, vol.\u00a04965, pp. 181\u2013197. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-78967-3_11","DOI":"10.1007\/978-3-540-78967-3_11"},{"key":"1_CR9","doi-asserted-by":"publisher","unstructured":"Bitansky, N., Kalai, Y.T., Paneth, O.: Multi-collision resistance: a paradigm for keyless hash functions. In: Diakonikolas, I., Kempe, D., Henzinger, M. (eds.) 50th ACM STOC, pp. 671\u2013684. ACM Press (2018). https:\/\/doi.org\/10.1145\/3188745.3188870","DOI":"10.1145\/3188745.3188870"},{"key":"1_CR10","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":"1_CR11","doi-asserted-by":"publisher","unstructured":"Boneh, D., Franklin, M.K.: Identity-based encryption from the Weil pairing. In: Kilian, J. (ed.) CRYPTO\u00a02001. LNCS, vol.\u00a02139, pp. 213\u2013229. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-44647-8_13","DOI":"10.1007\/3-540-44647-8_13"},{"key":"1_CR12","doi-asserted-by":"publisher","unstructured":"Boneh, D., Lynn, B., Shacham, H.: Short signatures from the Weil pairing. In: Boyd, C. (ed.) ASIACRYPT\u00a02001. LNCS, vol.\u00a02248, pp. 514\u2013532. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-45682-1_30","DOI":"10.1007\/3-540-45682-1_30"},{"key":"1_CR13","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":"1_CR14","doi-asserted-by":"publisher","unstructured":"Brier, E., Coron, J.S., Icart, T., Madore, D., Randriam, H., Tibouchi, M.: Efficient indifferentiable hashing into ordinary elliptic curves. In: Rabin, T. (ed.) CRYPTO\u00a02010. LNCS, vol.\u00a06223, pp. 237\u2013254. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-14623-7_13","DOI":"10.1007\/978-3-642-14623-7_13"},{"key":"1_CR15","doi-asserted-by":"publisher","unstructured":"Buchmann, J.A., Dahmen, E., H\u00fclsing, A.: XMSS - a practical forward secure signature scheme based on minimal security assumptions. In: Yang, B.Y. (ed.) Post-Quantum Cryptography - 4th International Workshop, PQCrypto 2011, pp. 117\u2013129. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-25405-5_8","DOI":"10.1007\/978-3-642-25405-5_8"},{"key":"1_CR16","unstructured":"Carolan, J., Poremba, A., Zhandry, M.: (Quantum) indifferentiability and pre-computation. Cryptology ePrint Archive, Report 2024\/1727 (2024). https:\/\/eprint.iacr.org\/2024\/1727"},{"key":"1_CR17","unstructured":"Carstens, T.V., Ebrahimi, E., Tabia, G.N., Unruh, D.: On quantum indifferentiability. Cryptology ePrint Archive, Report 2018\/257 (2018). https:\/\/eprint.iacr.org\/2018\/257"},{"key":"1_CR18","doi-asserted-by":"publisher","unstructured":"Chen, M., Chiesa, A., Gur, T., O\u2019Connor, J., Spooner, N.: Proof-carrying data from arithmetized random oracles. In: Hazay, C., Stam, M. (eds.) EUROCRYPT\u00a02023, Part\u00a0II. LNCS, vol. 14005, pp. 379\u2013404. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-30617-4_13","DOI":"10.1007\/978-3-031-30617-4_13"},{"key":"1_CR19","unstructured":"Chiesa, A., Tromer, E.: Proof-carrying data and hearsay arguments from signature cards. In: Yao, A.C.C. (ed.) ICS 2010, pp. 310\u2013331. Tsinghua University Press (2010)"},{"key":"1_CR20","doi-asserted-by":"publisher","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\u00a02005. LNCS, vol.\u00a03621, pp. 430\u2013448. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11535218_26","DOI":"10.1007\/11535218_26"},{"issue":"1","key":"1_CR21","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1007\/s00145-014-9189-6","volume":"29","author":"J-S Coron","year":"2014","unstructured":"Coron, J.-S., et al.: How to build an ideal cipher: the indifferentiability of the feistel construction. J. Cryptol. 29(1), 61\u2013114 (2014). https:\/\/doi.org\/10.1007\/s00145-014-9189-6","journal-title":"J. Cryptol."},{"key":"1_CR22","doi-asserted-by":"publisher","unstructured":"Dodis, Y., Stam, M., Steinberger, J.P., Liu, T.: Indifferentiability of confusion-diffusion networks. In: Fischlin, M., Coron, J.S. (eds.) EUROCRYPT\u00a02016, Part\u00a0II. LNCS, vol.\u00a09666, pp. 679\u2013704. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-49896-5_24","DOI":"10.1007\/978-3-662-49896-5_24"},{"key":"1_CR23","doi-asserted-by":"publisher","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:\/\/doi.org\/10.62056\/aey7qjp10. https:\/\/eprint.iacr.org\/2025\/055","DOI":"10.62056\/aey7qjp10"},{"key":"1_CR24","unstructured":"Drake, J., Khovratovich, D., Kudinov, M., Wagner, B.: Technical note: LeanSig for post-quantum ethereum. Cryptology ePrint Archive, Paper 2025\/1332 (2025). https:\/\/eprint.iacr.org\/2025\/1332"},{"key":"1_CR25","doi-asserted-by":"publisher","unstructured":"Drake, J., Khovratovich, D., Kudinov, M.A., Wagner, B.: Hash-based multi-signatures for post-quantum ethereum. CiC 2(1), 13 (2025). https:\/\/doi.org\/10.62056\/aey7qjp10","DOI":"10.62056\/aey7qjp10"},{"key":"1_CR26","unstructured":"Ducas, L., Lepoint, T., Lyubashevsky, V., Schwabe, P., Seiler, G., Stehl\u00e9, D.: CRYSTALS \u2013 Dilithium: digital signatures from module lattices. Cryptology ePrint Archive, Report 2017\/633 (2017), https:\/\/eprint.iacr.org\/2017\/633"},{"issue":"7","key":"1_CR27","doi-asserted-by":"publisher","first-page":"420","DOI":"10.1145\/364520.364540","volume":"7","author":"R Durstenfeld","year":"1964","unstructured":"Durstenfeld, R.: Algorithm 235: random permutation. Commun. ACM 7(7), 420 (1964)","journal-title":"Commun. ACM"},{"issue":"281","key":"1_CR28","doi-asserted-by":"publisher","first-page":"491","DOI":"10.1090\/S0025-5718-2012-02606-8","volume":"82","author":"R Farashahi","year":"2013","unstructured":"Farashahi, R., Fouque, P., Shparlinski, I., Tibouchi, M., Voloch, J.: Indifferentiable deterministic hashing to elliptic and hyperelliptic curves. Math. Comput. 82(281), 491\u2013512 (2013). https:\/\/doi.org\/10.1090\/S0025-5718-2012-02606-8","journal-title":"Math. Comput."},{"key":"1_CR29","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":"1_CR30","doi-asserted-by":"publisher","unstructured":"Fujisaki, E., Okamoto, T.: Secure integration of asymmetric and symmetric encryption schemes. In: Wiener, M.J. (ed.) CRYPTO 1999. LNCS, vol.\u00a01666, pp. 537\u2013554. Springer, Heidelberg (1999). https:\/\/doi.org\/10.1007\/3-540-48405-1_34","DOI":"10.1007\/3-540-48405-1_34"},{"key":"1_CR31","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"},{"key":"1_CR32","doi-asserted-by":"publisher","unstructured":"Grassi, L., Khovratovich, D., Schofnegger, M.: Poseidon2: a faster version of the poseidon hash function. In: El Mrabet, N., De Feo, L., Duquesne, S. (eds.) AFRICACRYPT 2023. LNCS, vol. 14064, pp. 177\u2013203. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-37679-5_8","DOI":"10.1007\/978-3-031-37679-5_8"},{"key":"1_CR33","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, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-92062-3_22","DOI":"10.1007\/978-3-030-92062-3_22"},{"key":"1_CR34","unstructured":"Herold, G., Khovratovich, D., Kudinov, M., Tessaro, S., Wagner, B.: Aborting random oracles: how to build them, how to use them. Cryptology ePrint Archive, Paper 2026\/016 (2026). https:\/\/eprint.iacr.org\/2026\/016"},{"key":"1_CR35","doi-asserted-by":"publisher","unstructured":"Hofheinz, D., Jager, T., Khurana, D., Sahai, A., Waters, B., Zhandry, M.: How to generate and use universal samplers. In: Cheon, J.H., Takagi, T. (eds.) ASIACRYPT\u00a02016, Part\u00a0II. LNCS, vol. 10032, pp. 715\u2013744. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-53890-6_24","DOI":"10.1007\/978-3-662-53890-6_24"},{"key":"1_CR36","unstructured":"H\u00fclsing, A., et al.: SPHINCS+. Technical report, National Institute of Standards and Technology (2022). https:\/\/csrc.nist.gov\/Projects\/post-quantum-cryptography\/selected-algorithms-2022"},{"key":"1_CR37","doi-asserted-by":"publisher","unstructured":"H\u00fclsing, A., Kudinov, M.A.: Recovering the tight security proof of SPHINCS$$^+$$. In: Agrawal, S., Lin, D. (eds.) ASIACRYPT\u00a02022, Part\u00a0IV. 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":"1_CR38","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":"1_CR39","doi-asserted-by":"publisher","unstructured":"Jain, A., Lin, H., Luo, J., Wichs, D.: The pseudorandom oracle model and ideal obfuscation. In: Handschuh, H., Lysyanskaya, A. (eds.) CRYPTO\u00a02023, Part\u00a0IV. LNCS, vol. 14084, pp. 233\u2013262. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-38551-3_8","DOI":"10.1007\/978-3-031-38551-3_8"},{"key":"1_CR40","doi-asserted-by":"publisher","unstructured":"Khovratovich, D., Kudinov, M.A., Wagner, B.: At the top of the hypercube - better size-time tradeoffs for hash-based signatures. In: Kalai, Y.T., Kamara, S.F. (eds.) CRYPTO\u00a02025, Part\u00a0VI. LNCS, vol. 16005, pp. 93\u2013123. Springer, Cham (2025). https:\/\/doi.org\/10.1007\/978-3-032-01887-8_4","DOI":"10.1007\/978-3-032-01887-8_4"},{"key":"1_CR41","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, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-78372-7_18","DOI":"10.1007\/978-3-319-78372-7_18"},{"key":"1_CR42","unstructured":"Knuth, D.E., Yao, A.C.: The complexity of nonuniform random number generation (1976). https:\/\/api.semanticscholar.org\/CorpusID:115400979"},{"key":"1_CR43","doi-asserted-by":"publisher","unstructured":"Lu, G., Waters, B.: How to sample a discrete gaussian (and more) from a random oracle. In: Kiltz, E., Vaikuntanathan, V. (eds.) TCC\u00a02022, Part\u00a0II. LNCS, vol. 13748, pp. 653\u2013682. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-22365-5_23","DOI":"10.1007\/978-3-031-22365-5_23"},{"key":"1_CR44","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":"1_CR45","doi-asserted-by":"crossref","unstructured":"Maller, M., Mohnblatt, N., Zapico, A.: IVC in the open-and-sign random oracle model. In: International Conference on the Theory and Application of Cryptology and Information Security, pp. 333\u2013365. Springer (2025)","DOI":"10.1007\/978-981-95-5122-4_11"},{"key":"1_CR46","doi-asserted-by":"publisher","unstructured":"Maurer, U.M., Renner, R., Holenstein, C.: Indifferentiability, impossibility results on reductions, and applications to the random oracle methodology. In: Naor, M. (ed.) TCC\u00a02004. LNCS, vol.\u00a02951, pp. 21\u201339. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-24638-1_2","DOI":"10.1007\/978-3-540-24638-1_2"},{"key":"1_CR47","unstructured":"Merkle, R.C.: Secrecy, authentication, and public key systems. Stanford university (1979)"},{"key":"1_CR48","unstructured":"National Institute of Standards and Technology: SHA-3 Standard: Permutation-based hash and extendable-output functions. Federal Information Processing Standards Publication (FIPS) (2015)"},{"key":"1_CR49","doi-asserted-by":"publisher","unstructured":"Ristenpart, T., Shacham, H., Shrimpton, T.: Careful with composition: limitations of the indifferentiability framework. In: Paterson, K.G. (ed.) EUROCRYPT\u00a02011. LNCS, vol.\u00a06632, pp. 487\u2013506. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-20465-4_27","DOI":"10.1007\/978-3-642-20465-4_27"},{"key":"1_CR50","doi-asserted-by":"publisher","unstructured":"Schnorr, C.P.: Efficient identification and signatures for smart cards. In: Brassard, G. (ed.) CRYPTO 1989. LNCS, vol.\u00a0435, pp. 239\u2013252. Springer, New York (1990). https:\/\/doi.org\/10.1007\/0-387-34805-0_22","DOI":"10.1007\/0-387-34805-0_22"},{"key":"1_CR51","unstructured":"StarkWare: ethSTARK documentation. Cryptology ePrint Archive, Report 2021\/582 (2021). https:\/\/eprint.iacr.org\/2021\/582"},{"key":"1_CR52","doi-asserted-by":"publisher","unstructured":"Zhandry, M.: How to record quantum queries, and applications to quantum indifferentiability. In: Boldyreva, A., Micciancio, D. (eds.) CRYPTO\u00a02019, Part\u00a0II. LNCS, vol. 11693, pp. 239\u2013268. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-26951-7_9","DOI":"10.1007\/978-3-030-26951-7_9"},{"key":"1_CR53","doi-asserted-by":"publisher","unstructured":"Zhandry, M.: Augmented random oracles. In: Dodis, Y., Shrimpton, T. (eds.) CRYPTO\u00a02022, Part\u00a0III. LNCS, vol. 13509, pp. 35\u201365. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-15982-4_2","DOI":"10.1007\/978-3-031-15982-4_2"},{"key":"1_CR54","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 2026"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-35412-9_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,8,10]],"date-time":"2026-08-10T11:59:42Z","timestamp":1786363182000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-35412-9_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9783032354112","9783032354129"],"references-count":54,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-35412-9_1","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":"11 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"}}]}}