{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,14]],"date-time":"2026-05-14T20:04:00Z","timestamp":1778789040457,"version":"3.51.4"},"publisher-location":"Cham","reference-count":66,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031587221","type":"print"},{"value":"9783031587238","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-58723-8_8","type":"book-chapter","created":{"date-parts":[[2024,5,7]],"date-time":"2024-05-07T12:01:49Z","timestamp":1715083309000},"page":"219-248","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":46,"title":["Threshold Raccoon: Practical Threshold Signatures from\u00a0Standard Lattice Assumptions"],"prefix":"10.1007","author":[{"given":"Rafael","family":"del Pino","sequence":"first","affiliation":[]},{"given":"Shuichi","family":"Katsumata","sequence":"additional","affiliation":[]},{"given":"Mary","family":"Maller","sequence":"additional","affiliation":[]},{"given":"Fabrice","family":"Mouhartem","sequence":"additional","affiliation":[]},{"given":"Thomas","family":"Prest","sequence":"additional","affiliation":[]},{"given":"Markku-Juhani","family":"Saarinen","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,5,8]]},"reference":[{"key":"8_CR1","doi-asserted-by":"publisher","unstructured":"Abram, D., Nof, A., Orlandi, C., Scholl, P., Shlomovits, O.: Low-bandwidth threshold ECDSA via pseudorandom correlation generators. In: 2022 IEEE Symposium on Security and Privacy, pp. 2554\u20132572. IEEE Computer Society Press (2022). https:\/\/doi.org\/10.1109\/SP46214.2022.9833559","DOI":"10.1109\/SP46214.2022.9833559"},{"key":"8_CR2","doi-asserted-by":"publisher","first-page":"280","DOI":"10.1007\/978-3-642-30057-8_17","volume-title":"PKC 2012","author":"S Agrawal","year":"2012","unstructured":"Agrawal, S., Boyen, X., Vaikuntanathan, V., Voulgaris, P., Wee, H.: Functional encryption for threshold functions (or fuzzy ibe) from lattices. In: Fischlin, M., Buchmann, J., Manulis, M. (eds.) PKC 2012. LNCS, vol. 7293, pp. 280\u2013297. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-30057-8_17"},{"key":"8_CR3","doi-asserted-by":"publisher","unstructured":"Agrawal, S., Stehl\u00e9, D., Yadav, A.: Round-optimal lattice-based threshold signatures, revisited. In: Bojanczyk, M., Merelli, E., Woodruff, D.P. (eds.) ICALP 2022. LIPIcs, vol.\u00a0229, pp. 8:1\u20138:20. Schloss Dagstuhl (2022). https:\/\/doi.org\/10.4230\/LIPIcs.ICALP.2022.8","DOI":"10.4230\/LIPIcs.ICALP.2022.8"},{"key":"8_CR4","doi-asserted-by":"publisher","unstructured":"Alagic, G., et al.: Nistir 8413 \u2013 status report on the third round of the nist post-quantum cryptography standardization process (2022). https:\/\/doi.org\/10.6028\/NIST.IR.8413","DOI":"10.6028\/NIST.IR.8413"},{"issue":"3","key":"8_CR5","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1515\/jmc-2015-0016","volume":"9","author":"MR Albrecht","year":"2015","unstructured":"Albrecht, M.R., Player, R., Scott, S.: On the concrete hardness of learning with errors. J. Math. Cryptol. 9(3), 169\u2013203 (2015). https:\/\/doi.org\/10.1515\/jmc-2015-0016","journal-title":"J. Math. Cryptol."},{"key":"8_CR6","unstructured":"Alkim, E., Ducas, L., P\u00f6ppelmann, T., Schwabe, P.: Post-quantum key exchange - a new hope. In: Holz, T., Savage, S. (eds.) USENIX Security 2016, pp. 327\u2013343. USENIX Association (2016)"},{"key":"8_CR7","doi-asserted-by":"publisher","unstructured":"Barbosa, M., et al.: Fixing and mechanizing the security proof of fiat-shamir with aborts and dilithium. In: Handschuh, H., Lysyanskaya, A. (eds.) CRYPTO\u00a02023, Part\u00a0V. LNCS, vol. 14085, pp. 358\u2013389. Springer, Heidelberg (2023). https:\/\/doi.org\/10.1007\/978-3-031-38554-4_12","DOI":"10.1007\/978-3-031-38554-4_12"},{"key":"8_CR8","doi-asserted-by":"publisher","unstructured":"Bellare, M., Crites, E.C., Komlo, C., Maller, M., Tessaro, S., Zhu, C.: Better than advertised security for non-interactive threshold signatures. In: Dodis, Y., Shrimpton, T. (eds.) CRYPTO\u00a02022, Part\u00a0IV. LNCS, vol. 13510, pp. 517\u2013550. Springer, Heidelberg (2022). https:\/\/doi.org\/10.1007\/978-3-031-15985-5_18","DOI":"10.1007\/978-3-031-15985-5_18"},{"key":"8_CR9","doi-asserted-by":"publisher","unstructured":"Bellare, M., Neven, G.: Multi-signatures in the plain public-key model and a general forking lemma. In: Juels, A., Wright, R.N., De Capitani di Vimercati, S. (eds.) ACM CCS 2006, pp. 390\u2013399. ACM Press (2006). https:\/\/doi.org\/10.1145\/1180405.1180453","DOI":"10.1145\/1180405.1180453"},{"key":"8_CR10","doi-asserted-by":"publisher","unstructured":"Bernstein, D.J., Lange, T., Martindale, C., Panny, L.: Quantum circuits for the CSIDH: Optimizing quantum evaluation of isogenies. In: Ishai, Y., Rijmen, V. (eds.) EUROCRYPT\u00a02019, Part\u00a0II. LNCS, vol. 11477, pp. 409\u2013441. Springer, Heidelberg (2019). https:\/\/doi.org\/10.1007\/978-3-030-17656-3_15","DOI":"10.1007\/978-3-030-17656-3_15"},{"key":"8_CR11","doi-asserted-by":"publisher","unstructured":"Beullens, W., Kleinjung, T., Vercauteren, F.: CSI-FiSh: efficient isogeny based signatures through class group computations. In: Galbraith, S.D., Moriai, S. (eds.) ASIACRYPT\u00a02019, Part\u00a0I. LNCS, vol. 11921, pp. 227\u2013247. Springer, Heidelberg (2019). https:\/\/doi.org\/10.1007\/978-3-030-34578-5_9","DOI":"10.1007\/978-3-030-34578-5_9"},{"key":"8_CR12","doi-asserted-by":"publisher","unstructured":"Boldyreva, A.: Threshold signatures, multisignatures and blind signatures based on the gap-Diffie-Hellman-group signature scheme. In: Desmedt, Y. (ed.) PKC\u00a02003. LNCS, vol.\u00a02567, pp. 31\u201346. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/3-540-36288-6_3","DOI":"10.1007\/3-540-36288-6_3"},{"key":"8_CR13","doi-asserted-by":"publisher","unstructured":"Boneh, D., et al.: Threshold cryptosystems from threshold fully homomorphic encryption. In: Shacham, H., Boldyreva, A. (eds.) CRYPTO\u00a02018, Part\u00a0I. LNCS, vol. 10991, pp. 565\u2013596. Springer, Heidelberg (2018). https:\/\/doi.org\/10.1007\/978-3-319-96884-1_19","DOI":"10.1007\/978-3-319-96884-1_19"},{"key":"8_CR14","doi-asserted-by":"publisher","unstructured":"Boneh, D., Lewi, K., Montgomery, H.W., Raghunathan, A.: Key homomorphic PRFs and their applications. In: Canetti, R., Garay, J.A. (eds.) CRYPTO\u00a02013, Part\u00a0I. LNCS, vol.\u00a08042, pp. 410\u2013428. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-40041-4_23","DOI":"10.1007\/978-3-642-40041-4_23"},{"key":"8_CR15","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":"8_CR16","doi-asserted-by":"publisher","unstructured":"Bonnetain, X., Schrottenloher, A.: Quantum security analysis of CSIDH. In: Canteaut, A., Ishai, Y. (eds.) EUROCRYPT\u00a02020, Part\u00a0II. LNCS, vol. 12106, pp. 493\u2013522. Springer, Heidelberg (2020). https:\/\/doi.org\/10.1007\/978-3-030-45724-2_17","DOI":"10.1007\/978-3-030-45724-2_17"},{"key":"8_CR17","doi-asserted-by":"publisher","unstructured":"Boschini, C., Takahashi, A., Tibouchi, M.: MuSig-L: lattice-based multi-signature with single-round online phase. In: Dodis, Y., Shrimpton, T. (eds.) CRYPTO\u00a02022, Part\u00a0II. LNCS, vol. 13508, pp. 276\u2013305. Springer, Heidelberg (2022). https:\/\/doi.org\/10.1007\/978-3-031-15979-4_10","DOI":"10.1007\/978-3-031-15979-4_10"},{"issue":"3","key":"8_CR18","doi-asserted-by":"publisher","first-page":"349","DOI":"10.1007\/s13389-021-00271-w","volume":"12","author":"J Ch\u00e1vez-Saab","year":"2022","unstructured":"Ch\u00e1vez-Saab, J., Chi-Dom\u00ednguez, J.J., Jaques, S., Rodr\u00edguez-Henr\u00edquez, F.: The SQALE of CSIDH: sublinear V\u00e9lu quantum-resistant isogeny action with low exponents. J. Cryptogr. Eng. 12(3), 349\u2013368 (2022). https:\/\/doi.org\/10.1007\/s13389-021-00271-w","journal-title":"J. Cryptogr. Eng."},{"key":"8_CR19","doi-asserted-by":"crossref","unstructured":"Chen, Y.: DualMS: efficient lattice-based two-round multi-signature with trapdoor-free simulation. Cryptology ePrint Archive, Report 2023\/263 (2023). https:\/\/eprint.iacr.org\/2023\/263","DOI":"10.1007\/978-3-031-38554-4_23"},{"key":"8_CR20","doi-asserted-by":"crossref","unstructured":"Chen, Y.: Dualms: efficient lattice-based two-round multi-signature with trapdoor-free simulation. Cryptology ePrint Archive, Paper 2023\/263 (2023). https:\/\/eprint.iacr.org\/2023\/263","DOI":"10.1007\/978-3-031-38554-4_23"},{"key":"8_CR21","unstructured":"Cheon, J.H., Cho, W., Kim, J.: Improved universal thresholdizer from threshold fully homomorphic encryption. Cryptology ePrint Archive, Paper 2023\/545 (2023). https:\/\/eprint.iacr.org\/2023\/545"},{"key":"8_CR22","unstructured":"Chowdhury, S., et al.: Efficient threshold FHE with application to real-time systems. Cryptology ePrint Archive, Report 2022\/1625 (2022). https:\/\/eprint.iacr.org\/2022\/1625"},{"key":"8_CR23","doi-asserted-by":"publisher","unstructured":"Chuengsatiansup, C., Prest, T., Stehl\u00e9, D., Wallet, A., Xagawa, K.: ModFalcon: compact signatures based on module-NTRU lattices. In: Sun, H.M., Shieh, S.P., Gu, G., Ateniese, G. (eds.) ASIACCS 20. pp. 853\u2013866. ACM Press (2020). https:\/\/doi.org\/10.1145\/3320269.3384758","DOI":"10.1145\/3320269.3384758"},{"key":"8_CR24","doi-asserted-by":"publisher","unstructured":"Cooper, D., Apon, D., Dang, Q., Davidson, M., Dworkin, M., Miller, C.: Recommendation for stateful hash-based signature schemes. National Institute of Standards and Technology (2020). https:\/\/doi.org\/10.6028\/NIST.SP.800-208","DOI":"10.6028\/NIST.SP.800-208"},{"key":"8_CR25","doi-asserted-by":"publisher","unstructured":"Cozzo, D., Smart, N.P.: Sashimi: cutting up CSI-FiSh secret keys to produce an actively secure distributed signing protocol. In: Ding, J., Tillich, J.P. (eds.) Post-Quantum Cryptography - 11th International Conference, PQCrypto 2020, pp. 169\u2013186. Springer, Heidelberg (2020). https:\/\/doi.org\/10.1007\/978-3-030-44223-1_10","DOI":"10.1007\/978-3-030-44223-1_10"},{"key":"8_CR26","unstructured":"Crites, E., Komlo, C., Maller, M.: How to prove schnorr assuming schnorr: security of multi- and threshold signatures. Cryptology ePrint Archive, Report 2021\/1375 (2021). https:\/\/eprint.iacr.org\/2021\/1375"},{"key":"8_CR27","doi-asserted-by":"publisher","unstructured":"Damg\u00e5rd, I., Orlandi, C., Takahashi, A., Tibouchi, M.: Two-round n-out-of-n and multi-signatures and trapdoor commitment from lattices. In: Garay, J. (ed.) PKC\u00a02021, Part\u00a0I. LNCS, vol. 12710, pp. 99\u2013130. Springer, Heidelberg (2021). https:\/\/doi.org\/10.1007\/978-3-030-75245-3_5","DOI":"10.1007\/978-3-030-75245-3_5"},{"issue":"2","key":"8_CR28","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1007\/s00145-022-09425-3","volume":"35","author":"I Damg\u00e5rd","year":"2022","unstructured":"Damg\u00e5rd, I., Orlandi, C., Takahashi, A., Tibouchi, M.: Two-round n-out-of-n and multi-signatures and trapdoor commitment from lattices. J. Cryptol. 35(2), 14 (2022). https:\/\/doi.org\/10.1007\/s00145-022-09425-3","journal-title":"J. Cryptol."},{"key":"8_CR29","doi-asserted-by":"publisher","unstructured":"De Feo, L., Meyer, M.: Threshold schemes from isogeny assumptions. In: Kiayias, A., Kohlweiss, M., Wallden, P., Zikas, V. (eds.) PKC\u00a02020, Part\u00a0II. LNCS, vol. 12111, pp. 187\u2013212. Springer, Heidelberg (2020). https:\/\/doi.org\/10.1007\/978-3-030-45388-6_7","DOI":"10.1007\/978-3-030-45388-6_7"},{"key":"8_CR30","doi-asserted-by":"publisher","unstructured":"Desmedt, Y.: Abuses in cryptography and how to fight them. In: Goldwasser, S. (ed.) CRYPTO\u201988. LNCS, vol.\u00a0403, pp. 375\u2013389. Springer, Heidelberg (1990). https:\/\/doi.org\/10.1007\/0-387-34799-2_29","DOI":"10.1007\/0-387-34799-2_29"},{"key":"8_CR31","doi-asserted-by":"publisher","unstructured":"Desmedt, Y., Frankel, Y.: Threshold cryptosystems. In: Brassard, G. (ed.) CRYPTO 1989. LNCS, vol.\u00a0435, pp. 307\u2013315. Springer, Heidelberg (1990). https:\/\/doi.org\/10.1007\/0-387-34805-0_28","DOI":"10.1007\/0-387-34805-0_28"},{"key":"8_CR32","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, H., Lysyanskaya, A. (eds.) CRYPTO\u00a02023, Part\u00a0V. LNCS, vol. 14085, pp. 327\u2013357. Springer, Heidelberg (2023). https:\/\/doi.org\/10.1007\/978-3-031-38554-4_11","DOI":"10.1007\/978-3-031-38554-4_11"},{"key":"8_CR33","doi-asserted-by":"publisher","unstructured":"Devevey, J., Libert, B., Nguyen, K., Peters, T., Yung, M.: Non-interactive CCA2-secure threshold cryptosystems: Achieving adaptive security in the standard model without pairings. In: Garay, J. (ed.) PKC\u00a02021, Part\u00a0I. LNCS, vol. 12710, pp. 659\u2013690. Springer, Heidelberg (2021). https:\/\/doi.org\/10.1007\/978-3-030-75245-3_24","DOI":"10.1007\/978-3-030-75245-3_24"},{"key":"8_CR34","doi-asserted-by":"publisher","unstructured":"Ducas, L.: Shortest vector from lattice sieving: A few dimensions for free. In: Nielsen, J.B., Rijmen, V. (eds.) EUROCRYPT\u00a02018, Part\u00a0I. LNCS, vol. 10820, pp. 125\u2013145. Springer, Heidelberg (2018). https:\/\/doi.org\/10.1007\/978-3-319-78381-9_5","DOI":"10.1007\/978-3-319-78381-9_5"},{"key":"8_CR35","doi-asserted-by":"publisher","unstructured":"Ducas, L., et al.: CRYSTALS-dilithium: a lattice-based digital signature scheme. IACR TCHES 2018(1), 238\u2013268 (2018). https:\/\/doi.org\/10.13154\/tches.v2018.i1.238-268. https:\/\/tches.iacr.org\/index.php\/TCHES\/article\/view\/839","DOI":"10.13154\/tches.v2018.i1.238-268"},{"key":"8_CR36","doi-asserted-by":"publisher","unstructured":"Espitau, T., Joux, A., Kharchenko, N.: On a dual\/hybrid approach to small secret LWE - a dual\/enumeration technique for learning with errors and application to security estimates of FHE schemes. In: Bhargavan, K., Oswald, E., Prabhakaran, M. (eds.) INDOCRYPT\u00a02020. LNCS, vol. 12578, pp. 440\u2013462. Springer, Heidelberg (2020). https:\/\/doi.org\/10.1007\/978-3-030-65277-7_20","DOI":"10.1007\/978-3-030-65277-7_20"},{"key":"8_CR37","doi-asserted-by":"publisher","unstructured":"Fleischhacker, N., Simkin, M., Zhang, Z.: Squirrel: efficient synchronized multi-signatures from lattices. In: Yin, H., Stavrou, A., Cremers, C., Shi, E. (eds.) ACM CCS 2022, pp. 1109\u20131123. ACM Press (2022). https:\/\/doi.org\/10.1145\/3548606.3560655","DOI":"10.1145\/3548606.3560655"},{"key":"8_CR38","unstructured":"Goldwasser, S., Kalai, Y.T., Peikert, C., Vaikuntanathan, V.: Robustness of the learning with errors assumption. In: Innovations in Computer Science - ICS 2010, Tsinghua University, Beijing, China, 5\u20137 January 2010. Proceedings, pp. 230\u2013240. Tsinghua University Press (2010)"},{"key":"8_CR39","unstructured":"Gur, K.D., Katz, J., Silde, T.: Two-round threshold lattice signatures from threshold homomorphic encryption. Cryptology ePrint Archive, Paper 2023\/1318 (2023). https:\/\/eprint.iacr.org\/2023\/1318"},{"key":"8_CR40","doi-asserted-by":"publisher","unstructured":"H\u00fclsing, A., Lange, T., Smeets, K.: Rounded Gaussians - fast and secure constant-time sampling for lattice-based crypto. In: Abdalla, M., Dahab, R. (eds.) PKC\u00a02018, Part\u00a0II. LNCS, vol. 10770, pp. 728\u2013757. Springer, Heidelberg (2018). https:\/\/doi.org\/10.1007\/978-3-319-76581-5_25","DOI":"10.1007\/978-3-319-76581-5_25"},{"key":"8_CR41","doi-asserted-by":"publisher","unstructured":"Katz, J., Yung, M.: Threshold cryptosystems based on factoring. In: Zheng, Y. (ed.) ASIACRYPT\u00a02002. LNCS, vol.\u00a02501, pp. 192\u2013205. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-36178-2_12","DOI":"10.1007\/3-540-36178-2_12"},{"key":"8_CR42","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 2022, pp. 393\u2013407. ACM Press (2022). https:\/\/doi.org\/10.1145\/3488932.3524128","DOI":"10.1145\/3488932.3524128"},{"key":"8_CR43","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":"8_CR44","doi-asserted-by":"publisher","first-page":"549","DOI":"10.1007\/978-3-031-38554-4_18","volume-title":"CRYPTO 2023","author":"D Kim","year":"2023","unstructured":"Kim, D., Lee, D., Seo, J., Song, Y.: Toward practical lattice-based proof of knowledge from hint-mlwe. In: Handschuh, H., Lysyanskaya, A. (eds.) CRYPTO 2023. LNCS, pp. 549\u2013580. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-38554-4_18"},{"key":"8_CR45","doi-asserted-by":"publisher","unstructured":"Komlo, C., Goldberg, I.: FROST: flexible round-optimized Schnorr threshold signatures. In: Dunkelman, O., Jr., M.J.J., O\u2019Flynn, C. (eds.) SAC 2020. LNCS, vol. 12804, pp. 34\u201365. Springer, Heidelberg (2020). https:\/\/doi.org\/10.1007\/978-3-030-81652-0_2","DOI":"10.1007\/978-3-030-81652-0_2"},{"key":"8_CR46","doi-asserted-by":"publisher","unstructured":"Libert, B., Joye, M., Yung, M.: Born and raised distributively: fully distributed non-interactive adaptively-secure threshold signatures with short shares. In: Halld\u00f3rsson, M.M., Dolev, S. (eds.) 33rd ACM PODC, pp. 303\u2013312. ACM (2014). https:\/\/doi.org\/10.1145\/2611462.2611498","DOI":"10.1145\/2611462.2611498"},{"key":"8_CR47","doi-asserted-by":"publisher","unstructured":"Libert, B., Stehl\u00e9, D., Titiu, R.: Adaptively secure distributed PRFs from $$\\sf LWE$$. In: Beimel, A., Dziembowski, S. (eds.) TCC\u00a02018, Part\u00a0II. LNCS, vol. 11240, pp. 391\u2013421. Springer, Heidelberg (2018). https:\/\/doi.org\/10.1007\/978-3-030-03810-6_15","DOI":"10.1007\/978-3-030-03810-6_15"},{"key":"8_CR48","unstructured":"Lindell, Y.: Simple three-round multiparty schnorr signing with full simulatability. Cryptology ePrint Archive, Report 2022\/374 (2022). https:\/\/eprint.iacr.org\/2022\/374"},{"key":"8_CR49","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":"8_CR50","doi-asserted-by":"publisher","unstructured":"Lyubashevsky, V.: Lattice signatures without trapdoors. In: Pointcheval, D., Johansson, T. (eds.) EUROCRYPT\u00a02012. LNCS, vol.\u00a07237, pp. 738\u2013755. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-29011-4_43","DOI":"10.1007\/978-3-642-29011-4_43"},{"key":"8_CR51","unstructured":"Lyubashevsky, V., et al.: Crystals-dilithium. Technical report, National Institute of Standards and Technology (2022). https:\/\/csrc.nist.gov\/Projects\/post-quantum-cryptography\/selected-algorithms-2022"},{"issue":"3","key":"8_CR52","doi-asserted-by":"publisher","first-page":"260","DOI":"10.1137\/1006063","volume":"6","author":"G Marsaglia","year":"1964","unstructured":"Marsaglia, G., Bray, T.A.: A convenient method for generating normal variables. SIAM Rev. 6(3), 260\u2013264 (1964). https:\/\/doi.org\/10.1137\/1006063","journal-title":"SIAM Rev."},{"key":"8_CR53","doi-asserted-by":"publisher","unstructured":"NIST: SHA-3 standard: Permutation-based hash and extendable-output functions. Federal Information Processing Standards Publication FIPS 202 (2015). https:\/\/doi.org\/10.6028\/NIST.FIPS.202","DOI":"10.6028\/NIST.FIPS.202"},{"key":"8_CR54","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":"8_CR55","doi-asserted-by":"publisher","unstructured":"NIST: Module-Lattice-Based Digital Signature Standard. Federal Information Processing Standards Publication FIPS 204 (Draft) (2023). https:\/\/doi.org\/10.6028\/NIST.FIPS.204.ipd","DOI":"10.6028\/NIST.FIPS.204.ipd"},{"key":"8_CR56","doi-asserted-by":"publisher","unstructured":"Peikert, C.: He gives C-sieves on the CSIDH. In: Canteaut, A., Ishai, Y. (eds.) EUROCRYPT\u00a02020, Part\u00a0II. LNCS, vol. 12106, pp. 463\u2013492. Springer, Heidelberg (2020). https:\/\/doi.org\/10.1007\/978-3-030-45724-2_16","DOI":"10.1007\/978-3-030-45724-2_16"},{"key":"8_CR57","doi-asserted-by":"publisher","unstructured":"Peralta, R., Brand\u00e3o, L.T.: Nist first call for multi-party threshold schemes. National Institute of Standards and Technology (2023). https:\/\/doi.org\/10.6028\/NIST.IR.8214C.ipd, https:\/\/doi.org\/10.6028\/NIST.IR.8214C.ipd","DOI":"10.6028\/NIST.IR.8214C.ipd"},{"key":"8_CR58","unstructured":"del Pino, R., et al.: Raccoon. Technical report, National Institute of Standards and Technology (2023). https:\/\/csrc.nist.gov\/Projects\/pqc-dig-sig\/round-1-additional-signatures"},{"key":"8_CR59","doi-asserted-by":"publisher","unstructured":"del Pino, R., Prest, T., Rossi, M., Saarinen, M.J.O.: High-order masking of lattice signatures in quasilinear time. In: 44th IEEE Symposium on Security and Privacy, SP 2023, San Francisco, CA, USA, 22\u201325 May 2023, pp. 1168\u20131185. IEEE (2023). https:\/\/doi.org\/10.1109\/SP46215.2023.10179342","DOI":"10.1109\/SP46215.2023.10179342"},{"key":"8_CR60","unstructured":"R\u00e9nyi, A.: On measures of entropy and information. In: Proceedings of the Fourth Berkeley Symposium on Mathematical Statistics and Probability, Volume 1: Contributions to the Theory of Statistics, pp. 547\u2013561. University of California Press, Berkeley (1961). http:\/\/projecteuclid.org\/euclid.bsmsp\/1200512181"},{"key":"8_CR61","doi-asserted-by":"publisher","unstructured":"Ruffing, T., Ronge, V., Jin, E., Schneider-Bensch, J., Schr\u00f6der, D.: ROAST: robust asynchronous schnorr threshold signatures. In: Yin, H., Stavrou, A., Cremers, C., Shi, E. (eds.) ACM CCS 2022, pp. 2551\u20132564. ACM Press (2022). https:\/\/doi.org\/10.1145\/3548606.3560583","DOI":"10.1145\/3548606.3560583"},{"key":"8_CR62","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, Heidelberg (1990). https:\/\/doi.org\/10.1007\/0-387-34805-0_22","DOI":"10.1007\/0-387-34805-0_22"},{"issue":"3","key":"8_CR63","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1007\/BF00196725","volume":"4","author":"CP Schnorr","year":"1991","unstructured":"Schnorr, C.P.: Efficient signature generation by smart cards. J. Cryptol. 4(3), 161\u2013174 (1991). https:\/\/doi.org\/10.1007\/BF00196725","journal-title":"J. Cryptol."},{"issue":"11","key":"8_CR64","doi-asserted-by":"publisher","first-page":"612","DOI":"10.1145\/359168.359176","volume":"22","author":"A Shamir","year":"1979","unstructured":"Shamir, A.: How to share a secret. Commun. ACM 22(11), 612\u2013613 (1979)","journal-title":"Commun. ACM"},{"issue":"11","key":"8_CR65","doi-asserted-by":"publisher","first-page":"612","DOI":"10.1145\/359168.359176","volume":"22","author":"A Shamir","year":"1979","unstructured":"Shamir, A.: How to share a secret. Commun. Assoc. Comput. Mach. 22(11), 612\u2013613 (1979). https:\/\/doi.org\/10.1145\/359168.359176","journal-title":"Commun. Assoc. Comput. Mach."},{"key":"8_CR66","doi-asserted-by":"publisher","unstructured":"Shoup, V.: Practical threshold signatures. In: Preneel, B. (ed.) EUROCRYPT\u00a02000. LNCS, vol.\u00a01807, pp. 207\u2013220. Springer, Heidelberg (2000). https:\/\/doi.org\/10.1007\/3-540-45539-6_15","DOI":"10.1007\/3-540-45539-6_15"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 EUROCRYPT 2024"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-58723-8_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,5,7]],"date-time":"2026-05-07T01:23:05Z","timestamp":1778116985000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-58723-8_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031587221","9783031587238"],"references-count":66,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-58723-8_8","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":"8 May 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"EUROCRYPT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Annual International Conference on the Theory and Applications of Cryptographic Techniques","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Zurich","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Switzerland","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":"26 May 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30 May 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"43","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"eurocrypt2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/eurocrypt.iacr.org\/2024\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}