{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,7]],"date-time":"2025-12-07T13:10:47Z","timestamp":1765113047490,"version":"3.40.5"},"publisher-location":"Cham","reference-count":46,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031918193","type":"print"},{"value":"9783031918209","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-031-91820-9_10","type":"book-chapter","created":{"date-parts":[[2025,5,7]],"date-time":"2025-05-07T06:03:10Z","timestamp":1746597790000},"page":"284-316","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["One Bit to\u00a0Rule Them All \u2013 Imperfect Randomness Harms Lattice Signatures"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-4584-1765","authenticated-orcid":false,"given":"Simon","family":"Damm","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0008-7037-4311","authenticated-orcid":false,"given":"Nicolai","family":"Kraus","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5965-5675","authenticated-orcid":false,"given":"Alexander","family":"May","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3066-0133","authenticated-orcid":false,"given":"Julian","family":"Nowakowski","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0001-9388-5324","authenticated-orcid":false,"given":"Jonas","family":"Thietke","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,5,5]]},"reference":[{"key":"10_CR1","unstructured":"Albrecht, M.R., et al.: Classic mceliece: conservative code-based cryptography (2022)"},{"key":"10_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"528","DOI":"10.1007\/978-3-030-77870-5_19","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2021","author":"MR Albrecht","year":"2021","unstructured":"Albrecht, M.R., Heninger, N.: On bounded distance decoding with predicate: breaking the \u201clattice barrier\u2019\u2019 for the hidden number problem. In: Canteaut, A., Standaert, F.-X. (eds.) EUROCRYPT 2021. LNCS, vol. 12696, pp. 528\u2013558. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-77870-5_19"},{"key":"10_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1007\/978-3-642-03356-8_20","volume-title":"Advances in Cryptology - CRYPTO 2009","author":"A Akavia","year":"2009","unstructured":"Akavia, A.: Solving hidden number problem with one bit oracle and advice. In: Halevi, S. (ed.) CRYPTO 2009. LNCS, vol. 5677, pp. 337\u2013354. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-03356-8_20"},{"key":"10_CR4","doi-asserted-by":"crossref","unstructured":"Aranha, D.F., Novaes, F.R., Takahashi, A., Tibouchi, M., Yarom, Y.: LadderLeak: breaking ECDSA with less than one bit of nonce leakage. In: Ligatti, J., Ou, X., Katz, J., Vigna, G. (eds.) ACM CCS 2020, pp. 225\u2013242. ACM Press (2020)","DOI":"10.1145\/3372297.3417268"},{"key":"10_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"494","DOI":"10.1007\/978-3-030-03326-2_17","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2018","author":"J Bootle","year":"2018","unstructured":"Bootle, J., Delaplace, C., Espitau, T., Fouque, P.-A., Tibouchi, M.: LWE without modular reduction and improved side-channel attacks against BLISS. In: Peyrin, T., Galbraith, S. (eds.) ASIACRYPT 2018, Part I. LNCS, vol. 11272, pp. 494\u2013524. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-030-03326-2_17"},{"key":"10_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1007\/3-540-68697-5_11","volume-title":"Advances in Cryptology \u2014 CRYPTO \u201996","author":"D Boneh","year":"1996","unstructured":"Boneh, D., Venkatesan, R.: Hardness of computing the most significant bits of secret keys in Diffie-Hellman and related schemes. In: Koblitz, N. (ed.) CRYPTO 1996. LNCS, vol. 1109, pp. 129\u2013142. Springer, Heidelberg (1996). https:\/\/doi.org\/10.1007\/3-540-68697-5_11"},{"key":"10_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1007\/3-540-45682-1_10","volume-title":"Advances in Cryptology \u2014 ASIACRYPT 2001","author":"NT Courtois","year":"2001","unstructured":"Courtois, N.T., Finiasz, M., Sendrier, N.: How to achieve a McEliece-based digital signature scheme. In: Boyd, C. (ed.) ASIACRYPT 2001. LNCS, vol. 2248, pp. 157\u2013174. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-45682-1_10"},{"key":"10_CR8","unstructured":"Checkoway, S., et al.: On the practical exploitability of dual EC in TLS implementations. In: Fu, K., Jung, J. (eds.) USENIX Security 2014, pp. 319\u2013335. USENIX Association (2014)"},{"key":"10_CR9","unstructured":"CVE-2024-31497. https:\/\/nvd.nist.gov\/vuln\/detail\/CVE-2024-31497. Accessed 30 Apr 2024"},{"key":"10_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1007\/978-3-030-56880-1_12","volume-title":"Advances in Cryptology \u2013 CRYPTO 2020","author":"D Dachman-Soled","year":"2020","unstructured":"Dachman-Soled, D., Ducas, L., Gong, H., Rossi, M.: LWE with side information: attacks and concrete security estimation. In: Micciancio, D., Ristenpart, T. (eds.) CRYPTO 2020, Part II. LNCS, vol. 12171, pp. 329\u2013358. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-56880-1_12"},{"key":"10_CR11","doi-asserted-by":"crossref","unstructured":"Devevey, J., Fallahpour, P., Passel\u00e8gue, A., Stehl\u00e9, D.: A detailed analysis of Fiat-Shamir with aborts. In: Handschuh, H., Lysyanskaya, A. (eds.) CRYPTO 2023, Part V. LNCS, vol. 14085, pp. 327\u2013357. Springer, Cham (2023)","DOI":"10.1007\/978-3-031-38554-4_11"},{"key":"10_CR12","doi-asserted-by":"crossref","unstructured":"Dachman-Soled, D., Gong, H., Hanson, T., Kippen, H.: Revisiting security estimation for LWE with hints from a geometric perspective. In: Handschuh, H., Lysyanskaya, A. (eds.) CRYPTO 2023, Part V. LNCS, vol. 14085, pp. 748\u2013781. Springer, Cham (2023)","DOI":"10.1007\/978-3-031-38554-4_24"},{"key":"10_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"435","DOI":"10.1007\/978-3-642-40349-1_25","volume-title":"Cryptographic Hardware and Embedded Systems - CHES 2013","author":"E De Mulder","year":"2013","unstructured":"De Mulder, E., Hutter, M., Marson, M.E., Pearson, P.: Using Bleichenbacher\u2019s solution to the hidden number problem to attack nonce leaks in 384-bit ECDSA. In: Bertoni, G., Coron, J.-S. (eds.) CHES 2013. LNCS, vol. 8086, pp. 435\u2013452. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-40349-1_25"},{"key":"10_CR14","doi-asserted-by":"crossref","unstructured":"Espitau, T., Fouque, P.A., G\u00e9rard, B., Tibouchi, M.: Side-channel attacks on BLISS lattice-based signatures: exploiting branch tracing against strongSwan and electromagnetic emanations in microcontrollers. In: Thuraisingham, B.M., Evans, D., Malkin, T., Xu, D. (eds.) ACM CCS 2017, pp. 1857\u20131874. ACM Press (2017)","DOI":"10.1145\/3133956.3134028"},{"key":"10_CR15","unstructured":"Feller, W.: An introduction to probability theory and its applications, Volume 2, vol.\u00a081. Wiley (1991)"},{"issue":"10","key":"10_CR16","doi-asserted-by":"publisher","first-page":"6830","DOI":"10.1109\/TIT.2013.2272036","volume":"59","author":"J-C Faugere","year":"2013","unstructured":"Faugere, J.-C., Gauthier-Umana, V., Otmani, A., Perret, L., Tillich, J.-P.: A distinguisher for high-rate mceliece cryptosystems. IEEE Trans. Inf. Theory 59(10), 6830\u20136844 (2013)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"10_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"88","DOI":"10.1007\/978-3-642-10366-7_6","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2009","author":"M Finiasz","year":"2009","unstructured":"Finiasz, M., Sendrier, N.: Security bounds for the design of code-based cryptosystems. In: Matsui, M. (ed.) ASIACRYPT 2009. LNCS, vol. 5912, pp. 88\u2013105. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-10366-7_6"},{"key":"10_CR18","unstructured":"Galbraith, S.D.: Space-efficient variants of cryptosystems based on learning with errors (2013). https:\/\/wwwmath.auckland.ac.nz\/~sgal018\/compact-LWE.pdf"},{"key":"10_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"112","DOI":"10.1007\/BFb0052231","volume-title":"Advances in Cryptology \u2014 CRYPTO \u201997","author":"O Goldreich","year":"1997","unstructured":"Goldreich, O., Goldwasser, S., Halevi, S.: Public-key cryptosystems from lattice reduction problems. In: Kaliski, B.S. (ed.) CRYPTO 1997. LNCS, vol. 1294, pp. 112\u2013131. Springer, Heidelberg (1997). https:\/\/doi.org\/10.1007\/BFb0052231"},{"key":"10_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/3-540-45682-1_1","volume-title":"Advances in Cryptology \u2014 ASIACRYPT 2001","author":"C Gentry","year":"2001","unstructured":"Gentry, C., Jonsson, J., Stern, J., Szydlo, M.: Cryptanalysis of the NTRU signature scheme (NSS) from Eurocrypt 2001. In: Boyd, C. (ed.) ASIACRYPT 2001. LNCS, vol. 2248, pp. 1\u201320. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-45682-1_1"},{"key":"10_CR21","doi-asserted-by":"crossref","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)","DOI":"10.1145\/1374376.1374407"},{"key":"10_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1007\/3-540-46035-7_20","volume-title":"Advances in Cryptology \u2014 EUROCRYPT 2002","author":"C Gentry","year":"2002","unstructured":"Gentry, C., Szydlo, M.: Cryptanalysis of the revised NTRU signature scheme. In: Knudsen, L.R. (ed.) EUROCRYPT 2002. LNCS, vol. 2332, pp. 299\u2013320. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-46035-7_20"},{"key":"10_CR23","doi-asserted-by":"crossref","unstructured":"Howgrave-Graham, N.A., Smart, N.P.: Lattice attacks on digital signature schemes. Des. Codes Cryptogr. 23, 283\u2013290 (2001)","DOI":"10.1023\/A:1011214926272"},{"key":"10_CR24","doi-asserted-by":"crossref","unstructured":"Hoffstein, J., Howgrave-Graham, N., Pipher, J., Silverman, J.H., Whyte, W.: NTRUSIGN: digital signatures using the NTRU lattice. In: Joye, M. (ed.) CT-RSA 2003. LNCS, vol. 2612, pp. 122\u2013140. Springer, Heidelberg (2003)","DOI":"10.1007\/3-540-36563-X_9"},{"key":"10_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-662-54365-8_1","volume-title":"Public-Key Cryptography \u2013 PKC 2017","author":"G Herold","year":"2017","unstructured":"Herold, G., May, A.: LP solutions of vectorial integer subset sums \u2013 cryptanalysis of galbraith\u2019s binary matrix LWE. In: Fehr, S. (ed.) PKC 2017. LNCS, vol. 10174, pp. 3\u201315. Springer, Heidelberg (2017). https:\/\/doi.org\/10.1007\/978-3-662-54365-8_1"},{"key":"10_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1007\/BFb0054868","volume-title":"Algorithmic Number Theory","author":"J Hoffstein","year":"1998","unstructured":"Hoffstein, J., Pipher, J., Silverman, J.H.: NTRU: a ring-based public key cryptosystem. In: Buhler, J.P. (ed.) ANTS 1998. LNCS, vol. 1423, pp. 267\u2013288. Springer, Heidelberg (1998). https:\/\/doi.org\/10.1007\/BFb0054868"},{"key":"10_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1007\/3-540-44987-6_14","volume-title":"Advances in Cryptology \u2014 EUROCRYPT 2001","author":"J Hoffstein","year":"2001","unstructured":"Hoffstein, J., Pipher, J., Silverman, J.H.: NSS: an NTRU lattice-based signature scheme. In: Pfitzmann, B. (ed.) EUROCRYPT 2001. LNCS, vol. 2045, pp. 211\u2013228. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-44987-6_14"},{"key":"10_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1007\/978-3-540-74462-7_9","volume-title":"Selected Areas in Cryptography","author":"M Hlav\u00e1c","year":"2007","unstructured":"Hlav\u00e1c, M., Rosa, T.: Extended hidden number problem and its cryptanalytic applications. In: Biham, E., Youssef, A.M. (eds.) SAC 2006. LNCS, vol. 4356, pp. 114\u2013133. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-74462-7_9"},{"key":"10_CR29","doi-asserted-by":"crossref","unstructured":"Heninger, N., Ryan, K.: The hidden number problem with small unknown multipliers: cryptanalyzing MEGA in six queries and other applications. In: Boldyreva, A., Kolesnikov, V. (eds.) PKC 2023, Part I. LNCS, vol. 13940, pp. 147\u2013176. Springer, Cham (2023)","DOI":"10.1007\/978-3-031-31368-4_6"},{"key":"10_CR30","unstructured":"H\u00fclsing, A., Rijneveld, J., Schanck, J.M., Schwabe, P.: NTRU-HRSS-KEM-submission to the NIST post-quantum cryptography project (2017)"},{"key":"10_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"598","DOI":"10.1007\/978-3-642-10366-7_35","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2009","author":"V Lyubashevsky","year":"2009","unstructured":"Lyubashevsky, V.: Fiat-Shamir with aborts: applications to lattice and factoring-based signatures. In: Matsui, M. (ed.) ASIACRYPT 2009. LNCS, vol. 5912, pp. 598\u2013616. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-10366-7_35"},{"key":"10_CR32","unstructured":"Lyubashevsky, V.: Basic lattice cryptography: the concepts behind kyber (ML-KEM) and dilithium (ML-DSA). Cryptology ePrint Archive, Report 2024\/1287 (2024)"},{"key":"10_CR33","doi-asserted-by":"publisher","first-page":"1868","DOI":"10.1109\/TIFS.2020.3045904","volume":"16","author":"Y Liu","year":"2020","unstructured":"Liu, Y., Zhou, Y., Sun, S., Wang, T., Zhang, R., Ming, J.: On the security of lattice-based Fiat-Shamir signatures in the presence of randomness leakage. IEEE Trans. Inf. Forensics Secur. 16, 1868\u20131879 (2020)","journal-title":"IEEE Trans. Inf. Forensics Secur."},{"key":"10_CR34","unstructured":"Merget, R., Brinkmann, M., Aviram, N., Somorovsky, J., Mittmann, J., Schwenk, J.: Raccoon attack: finding and exploiting most-significant-bit-oracles in TLS-DH(E). In: Bailey, M., Greenstadt, R. (eds.) USENIX Security 2021, pp. 213\u2013230. USENIX Association (2021)"},{"key":"10_CR35","unstructured":"McEliece, R.J.: A public-key cryptosystem based on algebraic. Coding Thv 4244, 114\u2013116 (1978)"},{"key":"10_CR36","doi-asserted-by":"crossref","unstructured":"May, A., Nowakowski, J.: Too many hints - when LLL breaks LWE. In: Guo, J., Steinfeld, R. (eds.) ASIACRYPT 2023, Part IV. LNCS, vol. 14441, pp. 106\u2013137. Springer, Singapore (2023)","DOI":"10.1007\/978-981-99-8730-6_4"},{"issue":"2","key":"10_CR37","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1007\/s00145-008-9031-0","volume":"22","author":"PQ Nguyen","year":"2009","unstructured":"Nguyen, P.Q., Regev, O.: Learning a parallelepiped: cryptanalysis of GGH and NTRU signatures. J. Cryptol. 22(2), 139\u2013160 (2009)","journal-title":"J. Cryptol."},{"key":"10_CR38","doi-asserted-by":"crossref","unstructured":"Nguyen and Shparlinski: The insecurity of the digital signature algorithm with partially known nonces. J. Cryptol. 15, 151\u2013176 (2002)","DOI":"10.1007\/s00145-002-0021-3"},{"key":"10_CR39","doi-asserted-by":"crossref","unstructured":"Nguyen, P.Q., Shparlinski, I.E.: The insecurity of the elliptic curve digital signature algorithm with partially known nonces. Des. Codes Cryptogr. 30, 201\u2013217 (2003)","DOI":"10.1007\/978-3-0348-8037-4_17"},{"key":"10_CR40","unstructured":"Oliveira, P.A., Viera, A.C., Cogliati, B., Goubin, L.: Uncompressing dilithium\u2019s public key. IACR Cryptol. ePrint Arch. 1373 (2024)"},{"key":"10_CR41","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1109\/TIFS.2022.3215913","volume":"18","author":"Z Qiao","year":"2022","unstructured":"Qiao, Z., Liu, Y., Zhou, Y., Ming, J., Jin, C., Li, H.: Practical public template attacks on crystals-dilithium with randomness leakages. IEEE Trans. Inf. Forensics Secur. 18, 1\u201314 (2022)","journal-title":"IEEE Trans. Inf. Forensics Secur."},{"issue":"1","key":"10_CR42","doi-asserted-by":"publisher","first-page":"146","DOI":"10.46586\/tches.v2019.i1.146-168","volume":"2019","author":"K Ryan","year":"2018","unstructured":"Ryan, K.: Return of the hidden number problem. IACR TCHES 2019(1), 146\u2013168 (2018)","journal-title":"IACR TCHES"},{"issue":"2\u20133","key":"10_CR43","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1016\/0304-3975(87)90064-8","volume":"53","author":"C-P Schnorr","year":"1987","unstructured":"Schnorr, C.-P.: A hierarchy of polynomial time lattice basis reduction algorithms. Theoret. Comput. Sci. 53(2\u20133), 201\u2013224 (1987)","journal-title":"Theoret. Comput. Sci."},{"key":"10_CR44","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1007\/0-387-34805-0_22","volume-title":"Advances in Cryptology \u2014 CRYPTO\u2019 89 Proceedings","author":"CP Schnorr","year":"1990","unstructured":"Schnorr, C.P.: Efficient identification and signatures for smart cards. In: Brassard, G. (ed.) CRYPTO 1989. LNCS, vol. 435, pp. 239\u2013252. Springer, New York (1990). https:\/\/doi.org\/10.1007\/0-387-34805-0_22"},{"key":"10_CR45","doi-asserted-by":"crossref","unstructured":"Seber, G.A.F., Lee, A.J.: Linear regression analysis. Wiley series in probability and statistics, 2nd edn. Wiley-Interscience, Hoboken (2003)","DOI":"10.1002\/9780471722199"},{"key":"10_CR46","doi-asserted-by":"crossref","unstructured":"Jun, X., Sarkar, S., Wang, H., Lei, H.: Improving bounds on elliptic curve hidden number problem for ECDH key exchange. In: Agrawal, S., Lin, D. (eds.) ASIACRYPT 2022, Part III. LNCS, vol. 13793, pp. 771\u2013799. Springer, Cham (2022)","DOI":"10.1007\/978-3-031-22969-5_26"}],"container-title":["Lecture Notes in Computer Science","Public-Key Cryptography \u2013 PKC 2025"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-91820-9_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,7]],"date-time":"2025-05-07T06:03:21Z","timestamp":1746597801000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-91820-9_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9783031918193","9783031918209"],"references-count":46,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-91820-9_10","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":"5 May 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"The authors have no competing interests.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Disclosure of Interests"}},{"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":"R\u00f8ros","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Norway","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":"12 May 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 May 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"pkc2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/pkc.iacr.org\/2025\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}