{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,7]],"date-time":"2026-08-07T12:47:01Z","timestamp":1786106821441,"version":"3.56.0"},"publisher-location":"Cham","reference-count":51,"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_14","type":"book-chapter","created":{"date-parts":[[2025,8,16]],"date-time":"2025-08-16T19:17:20Z","timestamp":1755371840000},"page":"423-456","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["Unmasking TRaccoon: A Lattice-Based Threshold Signature with\u00a0An Efficient Identifiable Abort Protocol"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0009-0001-8638-787X","authenticated-orcid":false,"given":"Rafael","family":"del Pino","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8496-0476","authenticated-orcid":false,"given":"Shuichi","family":"Katsumata","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2497-8770","authenticated-orcid":false,"given":"Guilhem","family":"Niot","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3498-5472","authenticated-orcid":false,"given":"Michael","family":"Reichle","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9288-1911","authenticated-orcid":false,"given":"Kaoru","family":"Takemure","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2025,8,17]]},"reference":[{"key":"14_CR1","doi-asserted-by":"publisher","unstructured":"Aardal, M.A., Aranha, D.F., Boudgoust, K., Kolby, S., Takahashi, A.: Aggregating falcon signatures with Labrador. In: Reyzin, L., Stebila, D. (eds.) Advances in Cryptology - CRYPTO 2024, Part I. LNCS, vol. 14920, pp. 71\u2013106. Springer, Cham (2024). https:\/\/doi.org\/10.1007\/978-3-031-68376-3_3","DOI":"10.1007\/978-3-031-68376-3_3"},{"key":"14_CR2","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":"14_CR3","doi-asserted-by":"publisher","unstructured":"Ajtai, M.: Generating hard instances of lattice problems (extended abstract). In: 28th ACM STOC, pp. 99\u2013108. ACM Press, May 1996. https:\/\/doi.org\/10.1145\/237814.237838","DOI":"10.1145\/237814.237838"},{"key":"14_CR4","doi-asserted-by":"publisher","unstructured":"Albrecht, M.R., Davidson, A., Deo, A., Gardham, D.: Crypto dark matter on the torus - oblivious PRFs from shallow PRFs and TFHE. In: Joye, M., Leander, G. (eds.) EUROCRYPT\u00a02024, Part\u00a0VI. LNCS, vol. 14656, pp. 447\u2013476. Springer, Cham (2024). https:\/\/doi.org\/10.1007\/978-3-031-58751-1_16","DOI":"10.1007\/978-3-031-58751-1_16"},{"key":"14_CR5","unstructured":"Bacho, R., Das, S., Loss, J., Ren, L.: Glacius: Threshold schnorr signatures from ddh with full adaptive security. To Appear in EUROCRYPT\u00a02024 (2024). https:\/\/eprint.iacr.org\/2023\/1628"},{"key":"14_CR6","doi-asserted-by":"publisher","unstructured":"Bacho, R., Loss, J., Tessaro, S., Wagner, B., Zhu, C.: Twinkle: threshold signatures from DDH with full adaptive security. In: Joye, M., Leander, G. (eds.) EUROCRYPT\u00a02024, Part\u00a0I. LNCS, vol. 14651, pp. 429\u2013459. Springer, Cham (2024). https:\/\/doi.org\/10.1007\/978-3-031-58716-0_15","DOI":"10.1007\/978-3-031-58716-0_15"},{"key":"14_CR7","doi-asserted-by":"publisher","unstructured":"Baum, C., Damg\u00e5rd, I., Lyubashevsky, V., Oechsner, S., Peikert, C.: More efficient commitments from structured lattice assumptions. In: Catalano, D., De Prisco, R. (eds.) SCN 2018. LNCS, vol. 11035, pp. 368\u2013385. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-98113-0_20","DOI":"10.1007\/978-3-319-98113-0_20"},{"key":"14_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, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-15985-5_18","DOI":"10.1007\/978-3-031-15985-5_18"},{"key":"14_CR9","doi-asserted-by":"publisher","unstructured":"Bendlin, R., Krehbiel, S., Peikert, C.: How to share a lattice trapdoor: threshold protocols for signatures and (H)IBE. In: Jacobson Jr., M.J., Locasto, M.E., Mohassel, P., Safavi-Naini, R. (eds.) ACNS 13th International Conference on Applied Cryptography and Network Security. LNCS, vol.\u00a07954, pp. 218\u2013236. Springer, Berlin, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-38980-1_14","DOI":"10.1007\/978-3-642-38980-1_14"},{"key":"14_CR10","doi-asserted-by":"publisher","unstructured":"Benhamouda, F., Halevi, S., Krawczyk, H., Ma, Y., Rabin, T.: SPRINT: high-throughput robust distributed Schnorr signatures. In: Joye, M., Leander, G. (eds.) EUROCRYPT\u00a02024, Part\u00a0V. LNCS, vol. 14655, pp. 62\u201391. Springer, Cham (2024). https:\/\/doi.org\/10.1007\/978-3-031-58740-5_3","DOI":"10.1007\/978-3-031-58740-5_3"},{"key":"14_CR11","doi-asserted-by":"publisher","unstructured":"Beullens, W., Seiler, G.: LaBRADOR: compact proofs for R1CS from module-SIS. In: Handschuh, H., Lysyanskaya, A. (eds.) CRYPTO\u00a02023, Part\u00a0V. LNCS, vol. 14085, pp. 518\u2013548. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-38554-4_17","DOI":"10.1007\/978-3-031-38554-4_17"},{"key":"14_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":"14_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, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-96884-1_19","DOI":"10.1007\/978-3-319-96884-1_19"},{"key":"14_CR14","doi-asserted-by":"publisher","unstructured":"Boschini, C., Kaviani, D., Lai, R., Malavolta, G., Takahashi, A., Tibouchi, M.: Ringtail: practical two-round threshold signatures from learning with errors. In: 2025 IEEE Symposium on Security and Privacy (SP), pp. 70\u201370. IEEE Computer Society, Los Alamitos, CA, USA, May 2025. https:\/\/doi.org\/10.1109\/SP61157.2025.00070, https:\/\/doi.ieeecomputersociety.org\/10.1109\/SP61157.2025.00070","DOI":"10.1109\/SP61157.2025.00070"},{"key":"14_CR15","doi-asserted-by":"crossref","unstructured":"Brand\u00e3o, L., Davidson, M.: Notes on threshold eddsa\/schnorr signatures. National Institute of Standards and Technology (2022). https:\/\/doi.org\/10.6028\/NIST.IR.8214B.ipd","DOI":"10.6028\/NIST.IR.8214B.ipd"},{"key":"14_CR16","doi-asserted-by":"publisher","unstructured":"Canetti, R., Gennaro, R., Goldfeder, S., Makriyannis, N., Peled, U.: UC non-interactive, proactive, threshold ECDSA with identifiable aborts. In: Ligatti, J., Ou, X., Katz, J., Vigna, G. (eds.) ACM CCS 2020, pp. 1769\u20131787. ACM Press, November 2020. https:\/\/doi.org\/10.1145\/3372297.3423367","DOI":"10.1145\/3372297.3423367"},{"key":"14_CR17","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1016\/J.TCS.2022.10.016","volume":"939","author":"G Castagnos","year":"2023","unstructured":"Castagnos, G., Catalano, D., Laguillaumie, F., Savasta, F., Tucker, I.: Bandwidth efficient threshold EC-DSA revisited: online\/offline extensions, identifiable aborts proactive and adaptive security. Theor. Comput. Sci. 939, 78\u2013104 (2023). https:\/\/doi.org\/10.1016\/J.TCS.2022.10.016","journal-title":"Theor. Comput. Sci."},{"key":"14_CR18","doi-asserted-by":"publisher","unstructured":"Crites, E.C., Komlo, C., Maller, M.: Fully adaptive Schnorr threshold signatures. In: Handschuh, H., Lysyanskaya, A. (eds.) CRYPTO\u00a02023, Part\u00a0I. LNCS, vol. 14081, pp. 678\u2013709. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-38557-5_22","DOI":"10.1007\/978-3-031-38557-5_22"},{"key":"14_CR19","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, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-75245-3_5","DOI":"10.1007\/978-3-030-75245-3_5"},{"issue":"2","key":"14_CR20","doi-asserted-by":"publisher","first-page":"1","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), 1\u201356 (2022). https:\/\/doi.org\/10.1007\/s00145-022-09425-3","journal-title":"J. Cryptol."},{"key":"14_CR21","unstructured":"del Pino, R., et al.: Technical report, National Institute of Standards and Technology (2023). https:\/\/csrc.nist.gov\/Projects\/pqc-dig-sig\/round-1-additional-signatures"},{"key":"14_CR22","doi-asserted-by":"publisher","unstructured":"Del\u00a0Pino, R., Katsumata, S., Maller, M., Mouhartem, F., Prest, T., Saarinen, M.J.: Threshold raccoon: practical threshold signatures from standard lattice assumptions. In: ctical Threshold Signatures from Standard Lattice Assumptions. In: Joye, M., Leander, G. (eds.) Advances in Cryptology \u2013 EUROCRYPT 2024. EUROCRYPT 2024. LNCS, vol. 14652, pp. 219\u2013248. Springer, Cham (2024). https:\/\/doi.org\/10.1007\/978-3-031-58723-8_8","DOI":"10.1007\/978-3-031-58723-8_8"},{"key":"14_CR23","doi-asserted-by":"publisher","unstructured":"del Pino, R., Katsumata, S., Prest, T., Rossi, M.: Raccoon: A masking-friendly signature proven in the probing model. In: Reyzin, L., Stebila, D. (eds.) CRYPTO\u00a02024, Part\u00a0I. LNCS, vol. 14920, pp. 409\u2013444. Springer, Cham (2024). https:\/\/doi.org\/10.1007\/978-3-031-68376-3_13","DOI":"10.1007\/978-3-031-68376-3_13"},{"key":"14_CR24","doi-asserted-by":"publisher","unstructured":"Espitau, T., Katsumata, S., Takemure, K.: Two-round threshold signature from algebraic one-more learning with errors. In: Reyzin, L., Stebila, D. (eds.) CRYPTO\u00a02024, Part\u00a0VII. LNCS, vol. 14926, pp. 387\u2013424. Springer, Cham (2024). https:\/\/doi.org\/10.1007\/978-3-031-68394-7_13","DOI":"10.1007\/978-3-031-68394-7_13"},{"key":"14_CR25","doi-asserted-by":"publisher","unstructured":"Espitau, T., Niot, G., Prest, T.: Flood and submerse: Distributed key generation and robust threshold signature from lattices. In: Reyzin, L., Stebila, D. (eds.) CRYPTO\u00a02024, Part\u00a0VII. LNCS, vol. 14926, pp. 425\u2013458. Springer, Cham (2024). https:\/\/doi.org\/10.1007\/978-3-031-68394-7_14","DOI":"10.1007\/978-3-031-68394-7_14"},{"key":"14_CR26","unstructured":"G\u0105gol, A., Kula, J., Straszak, D., \u015awi\u0119tek, M.: Threshold ECDSA for decentralized asset custody. Cryptology ePrint Archive, Report 2020\/498 (2020). https:\/\/eprint.iacr.org\/2020\/498"},{"key":"14_CR27","unstructured":"Gennaro, R., Goldfeder, S.: One round threshold ECDSA with identifiable abort. Cryptology ePrint Archive, Report 2020\/540 (2020). https:\/\/eprint.iacr.org\/2020\/540"},{"key":"14_CR28","doi-asserted-by":"publisher","unstructured":"Gennaro, R., Jarecki, S., Krawczyk, H., Rabin, T.: Robust and efficient sharing of RSA functions. In: Koblitz, N. (ed.) CRYPTO 1996. LNCS, vol.\u00a01109, pp. 157\u2013172. Springer, Berlin, Heidelberg (1996). https:\/\/doi.org\/10.1007\/3-540-68697-5_13","DOI":"10.1007\/3-540-68697-5_13"},{"key":"14_CR29","doi-asserted-by":"publisher","unstructured":"Gennaro, R., Jarecki, S., Krawczyk, H., Rabin, T.: Robust threshold DSS signatures. In: Maurer, U.M. (ed.) EUROCRYPT 1996. LNCS, vol.\u00a01070, pp. 354\u2013371. Springer, Berlin, Heidelberg (1996). https:\/\/doi.org\/10.1007\/3-540-68339-9_31","DOI":"10.1007\/3-540-68339-9_31"},{"issue":"1","key":"14_CR30","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1007\/s00145-006-0347-3","volume":"20","author":"R Gennaro","year":"2006","unstructured":"Gennaro, R., Jarecki, S., Krawczyk, H., Rabin, T.: Secure Distributed Key Generation for Discrete-Log Based Cryptosystems. J. Cryptol. 20(1), 51\u201383 (2006). https:\/\/doi.org\/10.1007\/s00145-006-0347-3","journal-title":"J. Cryptol."},{"key":"14_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, May 2008. https:\/\/doi.org\/10.1145\/1374376.1374407","DOI":"10.1145\/1374376.1374407"},{"key":"14_CR32","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, January 5-7, 2010. Proceedings, pp. 230\u2013240. Tsinghua University Press (2010)"},{"key":"14_CR33","unstructured":"Groth, J., Shoup, V.: Fast batched asynchronous distributed key generation. IACR Cryptology ePrint Archve, p.\u00a01175 (2023). https:\/\/eprint.iacr.org\/2023\/1175"},{"key":"14_CR34","doi-asserted-by":"publisher","unstructured":"G\u00fcr, K.D., Katz, J., Silde, T.: Two-round threshold lattice-based signatures from threshold homomorphic encryption. In: Saarinen, M.J., Smith-Tone, D. (eds.) Post-Quantum Cryptography - 15th International Workshop, PQCrypto 2024, Part\u00a0II, vol. 14772, pp. 266\u2013300. Springer, Cham (2024). https:\/\/doi.org\/10.1007\/978-3-031-62746-0_12","DOI":"10.1007\/978-3-031-62746-0_12"},{"issue":"5","key":"14_CR35","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1049\/ip-cdt:19941293","volume":"141","author":"L Harn","year":"1994","unstructured":"Harn, L.: Group-oriented (t, n) threshold digital signature scheme and digital multisignature. IEE Proc. Comput. Digital Techn. 141(5), 307\u2013313 (1994)","journal-title":"IEE Proc. Comput. Digital Techn."},{"key":"14_CR36","doi-asserted-by":"publisher","unstructured":"Katsumata, S., Reichle, M., Takemure, K.: Adaptively secure 5 round threshold signatures from MLWE\/MSIS and DL with rewinding. In: Reyzin, L., Stebila, D. (eds.) CRYPTO\u00a02024, Part\u00a0VII. LNCS, vol. 14926, pp. 459\u2013491. Springer, Cham (2024). https:\/\/doi.org\/10.1007\/978-3-031-68394-7_15","DOI":"10.1007\/978-3-031-68394-7_15"},{"key":"14_CR37","doi-asserted-by":"publisher","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.) Advances in Cryptology \u2013 CRYPTO 2023, vol. 14805, pp. 549\u2013580. Springer Nature Switzerland, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-38554-4_18","DOI":"10.1007\/978-3-031-38554-4_18"},{"key":"14_CR38","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, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-81652-0_2","DOI":"10.1007\/978-3-030-81652-0_2"},{"key":"14_CR39","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, July 2014. https:\/\/doi.org\/10.1145\/2611462.2611498","DOI":"10.1145\/2611462.2611498"},{"key":"14_CR40","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":"14_CR41","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":"14_CR42","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":"14_CR43","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"},{"key":"14_CR44","doi-asserted-by":"publisher","unstructured":"Lyubashevsky, V., Nguyen, N.K., Plan\u00e7on, M.: Lattice-based zero-knowledge proofs and applications: shorter, simpler, and more general. In: Dodis, Y., Shrimpton, T. (eds.) CRYPTO\u00a02022, Part\u00a0II. LNCS, vol. 13508, pp. 71\u2013101. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-15979-4_3","DOI":"10.1007\/978-3-031-15979-4_3"},{"key":"14_CR45","unstructured":"NIST: Call for additional digital signature schemes for the post-quantum cryptography standardization process. https:\/\/csrc.nist.gov\/csrc\/media\/Projects\/pqc-dig-sig\/documents\/call-for-proposals-dig-sig-sept-2022.pdf (2022)"},{"key":"14_CR46","doi-asserted-by":"crossref","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","DOI":"10.6028\/NIST.IR.8214C.ipd"},{"key":"14_CR47","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":"14_CR48","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, November 2022. https:\/\/doi.org\/10.1145\/3548606.3560583","DOI":"10.1145\/3548606.3560583"},{"issue":"11","key":"14_CR49","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":"14_CR50","unstructured":"Shoup, V.: The many faces of Schnorr. Cryptology ePrint Archive, Report 2023\/1019 (2023). https:\/\/eprint.iacr.org\/2023\/1019"},{"key":"14_CR51","doi-asserted-by":"publisher","unstructured":"Stinson, D.R., Strobl, R.: Provably secure distributed Schnorr signatures and a $$(t, n)$$ threshold scheme for implicit certificates. In: Varadharajan, V., Mu, Y. (eds.) ACISP 01. LNCS, vol.\u00a02119, pp. 417\u2013434. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-47719-5_33","DOI":"10.1007\/3-540-47719-5_33"}],"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_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,8,7]],"date-time":"2026-08-07T12:32:43Z","timestamp":1786105963000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-01887-8_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9783032018861","9783032018878"],"references-count":51,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-01887-8_14","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"}}]}}