{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,7]],"date-time":"2026-05-07T15:19:07Z","timestamp":1778167147420,"version":"3.51.4"},"publisher-location":"Cham","reference-count":39,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032252906","type":"print"},{"value":"9783032252913","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-25291-3_1","type":"book-chapter","created":{"date-parts":[[2026,5,7]],"date-time":"2026-05-07T14:53:11Z","timestamp":1778165591000},"page":"3-32","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Adaptively-Secure Three-Round Threshold Schnorr from\u00a0DL"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2497-8770","authenticated-orcid":false,"given":"Guilhem","family":"Niot","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3498-5472","authenticated-orcid":false,"given":"Michael","family":"Reichle","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9288-1911","authenticated-orcid":false,"given":"Kaoru","family":"Takemure","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2026,5,8]]},"reference":[{"key":"1_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1007\/978-3-540-28628-8_20","volume-title":"Advances in Cryptology \u2013 CRYPTO 2004","author":"M Abe","year":"2004","unstructured":"Abe, M., Fehr, S.: Adaptively secure Feldman VSS and applications to universally-composable threshold cryptography. In: Franklin, M. (ed.) CRYPTO 2004. LNCS, vol. 3152, pp. 317\u2013334. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-28628-8_20"},{"key":"1_CR2","doi-asserted-by":"crossref","unstructured":"Azari, K., Boschini, C., Host\u00e1kov\u00e1, K., Reichle, M.: Security amplification of threshold signatures in the standard model. To appear at TCC\u201925 (2025). https:\/\/eprint.iacr.org\/2025\/1705","DOI":"10.1007\/978-3-032-12296-4_7"},{"key":"1_CR3","doi-asserted-by":"publisher","unstructured":"Bacho, R., Das, S., Loss, J., Ren, L.: Adaptively secure three-round threshold Schnorr signatures from DDH. In: Kalai, Y.T., Kamara, S.F. (eds.) CRYPTO\u00a02025, Part\u00a0VI. LNCS, vol. 16005, pp. 390\u2013422. Springer, Cham (2025). https:\/\/doi.org\/10.1007\/978-3-032-01887-8_13","DOI":"10.1007\/978-3-032-01887-8_13"},{"key":"1_CR4","doi-asserted-by":"publisher","unstructured":"Bacho, R., Das, S., Loss, J., Ren, L.: Glacius: Threshold Schnorr signatures from DDH with full adaptive security. In: Fehr, S., Fouque, P.A. (eds.) EUROCRYPT\u00a02025, Part\u00a0II. LNCS, vol. 15602, pp. 304\u2013334. Springer, Cham (2025). https:\/\/doi.org\/10.1007\/978-3-031-91124-8_11","DOI":"10.1007\/978-3-031-91124-8_11"},{"key":"1_CR5","doi-asserted-by":"publisher","unstructured":"Bacho, R., Loss, J., Stern, G., Wagner, B.: HARTS: high-threshold, adaptively secure, and robust threshold Schnorr signatures. In: Chung, K.M., Sasaki, Y. (eds.) ASIACRYPT\u00a02024, Part\u00a0III. LNCS, vol. 15486, pp. 104\u2013140. Springer, Singapore (2024). https:\/\/doi.org\/10.1007\/978-981-96-0891-1_4","DOI":"10.1007\/978-981-96-0891-1_4"},{"key":"1_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":"1_CR7","doi-asserted-by":"publisher","unstructured":"Bacho, R., Wagner, B.: T-spoon: tightly secure two-round multi-signatures with key aggregation. In: Kalai, Y.T., Kamara, S.F. (eds.) CRYPTO\u00a02025, Part\u00a0VI. LNCS, vol. 16005, pp. 256\u2013290. Springer, Cham (2025). https:\/\/doi.org\/10.1007\/978-3-032-01887-8_9","DOI":"10.1007\/978-3-032-01887-8_9"},{"key":"1_CR8","doi-asserted-by":"publisher","unstructured":"Bagherzandi, A., Cheon, J.H., Jarecki, S.: Multisignatures secure under the discrete logarithm assumption and a generalized forking lemma. In: Ning, P., Syverson, P.F., Jha, S. (eds.) ACM CCS 2008, pp. 449\u2013458. ACM Press (2008). https:\/\/doi.org\/10.1145\/1455770.1455827","DOI":"10.1145\/1455770.1455827"},{"key":"1_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"650","DOI":"10.1007\/978-3-030-92068-5_22","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2021","author":"M Bellare","year":"2021","unstructured":"Bellare, M., Dai, W.: Chain reductions for\u00a0multi-signatures and\u00a0the\u00a0HBMS scheme. In: Tibouchi, M., Wang, H. (eds.) ASIACRYPT 2021. LNCS, vol. 13093, pp. 650\u2013678. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-92068-5_22"},{"key":"1_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"629","DOI":"10.1007\/978-3-662-46447-2_28","volume-title":"Public-Key Cryptography \u2013 PKC 2015","author":"D Bernhard","year":"2015","unstructured":"Bernhard, D., Fischlin, M., Warinschi, B.: Adaptive proofs of knowledge in the random oracle model. In: Katz, J. (ed.) PKC 2015. LNCS, vol. 9020, pp. 629\u2013649. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-46447-2_28"},{"key":"1_CR11","doi-asserted-by":"publisher","unstructured":"Chairattana-Apirom, R., Tessaro, S., Zhu, C.: Pairing-free blind signatures from CDH assumptions. In: Reyzin, L., Stebila, D. (eds.) CRYPTO\u00a02024, Part\u00a0I. LNCS, vol. 14920, pp. 174\u2013209. Springer, Cham (2024). https:\/\/doi.org\/10.1007\/978-3-031-68376-3_6","DOI":"10.1007\/978-3-031-68376-3_6"},{"key":"1_CR12","doi-asserted-by":"publisher","unstructured":"Chen, Y.: Round-efficient adaptively secure threshold signatures with rewinding (2025). https:\/\/doi.org\/10.62056\/AH893Z10K","DOI":"10.62056\/AH893Z10K"},{"key":"1_CR13","doi-asserted-by":"publisher","unstructured":"Crites, E.C., Katz, J., Komlo, C., Tessaro, S., Zhu, C.: On the adaptive security of FROST. In: Kalai, Y.T., Kamara, S.F. (eds.) CRYPTO\u00a02025, Part\u00a0VI. LNCS, vol. 16005, pp. 480\u2013511. Springer, Cham (2025). https:\/\/doi.org\/10.1007\/978-3-032-01887-8_16","DOI":"10.1007\/978-3-032-01887-8_16"},{"key":"1_CR14","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 (Aug 2023). https:\/\/doi.org\/10.1007\/978-3-031-38557-5_22","DOI":"10.1007\/978-3-031-38557-5_22"},{"key":"1_CR15","doi-asserted-by":"publisher","unstructured":"Crites, E.C., Stewart, A.: A plausible attack on the adaptive security of threshold Schnorr signatures. In: Kalai, Y.T., Kamara, S.F. (eds.) CRYPTO\u00a02025, Part\u00a0VI. LNCS, vol. 16005, pp. 457\u2013479. Springer, Cham (2025). https:\/\/doi.org\/10.1007\/978-3-032-01887-8_15","DOI":"10.1007\/978-3-032-01887-8_15"},{"key":"1_CR16","doi-asserted-by":"publisher","unstructured":"Del Pino, R., Katsumata, S., Maller, M., Mouhartem, F., Prest, T., Saarinen, M.J.O.: Threshold raccoon: practical threshold signatures from standard lattice assumptions. In: Joye, M., Leander, G. (eds.) EUROCRYPT\u00a02024, Part\u00a0II. 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":"1_CR17","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, New York (1990). https:\/\/doi.org\/10.1007\/0-387-34799-2_29","DOI":"10.1007\/0-387-34799-2_29"},{"key":"1_CR18","doi-asserted-by":"publisher","unstructured":"Desmedt, Y., Frankel, Y.: Threshold cryptosystems. In: Brassard, G. (ed.) CRYPTO\u201989. LNCS, vol.\u00a0435, pp. 307\u2013315. Springer, New York (1990). https:\/\/doi.org\/10.1007\/0-387-34805-0_28","DOI":"10.1007\/0-387-34805-0_28"},{"key":"1_CR19","doi-asserted-by":"publisher","unstructured":"Drijvers, M., et al.: On the security of two-round multi-signatures. In: 2019 IEEE Symposium on Security and Privacy, pp. 1084\u20131101. IEEE Computer Society Press (2019). https:\/\/doi.org\/10.1109\/SP.2019.00050","DOI":"10.1109\/SP.2019.00050"},{"key":"1_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"152","DOI":"10.1007\/11535218_10","volume-title":"Advances in Cryptology \u2013 CRYPTO 2005","author":"M Fischlin","year":"2005","unstructured":"Fischlin, M.: Communication-efficient non-interactive proofs of knowledge with online extractors. In: Shoup, V. (ed.) CRYPTO 2005. LNCS, vol. 3621, pp. 152\u2013168. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11535218_10"},{"issue":"1","key":"1_CR21","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1007\/s00145-006-0347-3","volume":"20","author":"R Gennaro","year":"2007","unstructured":"Gennaro, R., Jarecki, S., Krawczyk, H., Rabin, T.: Secure distributed key generation for discrete-log based cryptosystems. J. Cryptol. 20(1), 51\u201383 (2007). https:\/\/doi.org\/10.1007\/s00145-006-0347-3","journal-title":"J. Cryptol."},{"key":"1_CR22","unstructured":"Gerhart, P., Calsi, D.L., Russo, L., Schr\u00f6der, D.: Fully-adaptive two-round threshold Schnorr signatures from DDH. Cryptology ePrint Archive, Paper 2025\/1478 (2025). https:\/\/eprint.iacr.org\/2025\/1478"},{"key":"1_CR23","doi-asserted-by":"publisher","unstructured":"Hanzlik, L., Kluczniak, K.: Explainable arguments. In: Eyal, I., Garay, J.A. (eds.) FC 2022. LNCS, vol. 13411, pp. 59\u201379. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-18283-9_4","DOI":"10.1007\/978-3-031-18283-9_4"},{"key":"1_CR24","unstructured":"Hashimoto, K., Ogata, W., Sakai, Y.: Signatures with tight adaptive corruptions from search assumptions. Cryptology ePrint Archive, Report 2025\/115 (2025). https:\/\/eprint.iacr.org\/2025\/115"},{"key":"1_CR25","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":"1_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/978-3-662-53008-5_2","volume-title":"Advances in Cryptology \u2013 CRYPTO 2016","author":"E Kiltz","year":"2016","unstructured":"Kiltz, E., Masny, D., Pan, J.: Optimal security proofs for signatures from identification schemes. In: Robshaw, M., Katz, J. (eds.) CRYPTO 2016. LNCS, vol. 9815, pp. 33\u201361. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-53008-5_2"},{"key":"1_CR27","doi-asserted-by":"publisher","unstructured":"Kloo\u00df, M., Reichle, M., Wagner, B.: Practical blind signatures in pairing-free groups. In: Chung, K.M., Sasaki, Y. (eds.) ASIACRYPT\u00a02024, Part\u00a0I. LNCS, vol. 15484, pp. 363\u2013395. Springer, Singapore (2024). https:\/\/doi.org\/10.1007\/978-981-96-0875-1_12","DOI":"10.1007\/978-981-96-0875-1_12"},{"key":"1_CR28","doi-asserted-by":"publisher","unstructured":"Komlo, C., Goldberg, I.: FROST: flexible round-optimized Schnorr threshold signatures. In: Dunkelman, O., Jacobson, Jr., M.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":"1_CR29","doi-asserted-by":"publisher","unstructured":"Kondi, Y., shelat, a.: Improved straight-line extraction in the random oracle model with applications to signature aggregation. In: Agrawal, S., Lin, D. (eds.) ASIACRYPT\u00a02022, Part\u00a0II. LNCS, vol. 13792, pp. 279\u2013309. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-22966-4_10","DOI":"10.1007\/978-3-031-22966-4_10"},{"key":"1_CR30","doi-asserted-by":"publisher","unstructured":"Lehmann, A., Nazarian, P., \u00d6zbay, C.: Stronger security for threshold blind signatures. In: Fehr, S., Fouque, P.A. (eds.) EUROCRYPT\u00a02025, Part\u00a0II. LNCS, vol. 15602, pp. 335\u2013364. Springer, Cham (2025). https:\/\/doi.org\/10.1007\/978-3-031-91124-8_12","DOI":"10.1007\/978-3-031-91124-8_12"},{"key":"1_CR31","unstructured":"Makriyannis, N.: On the classic protocol for MPC Schnorr signatures. Cryptology ePrint Archive, Report 2022\/1332 (2022). https:\/\/eprint.iacr.org\/2022\/1332"},{"key":"1_CR32","doi-asserted-by":"publisher","unstructured":"Navot, S., Tessaro, S.: One-more unforgeability for multi - and threshold signatures. In: Chung, K.M., Sasaki, Y. (eds.) ASIACRYPT\u00a02024, Part\u00a0I. LNCS, vol. 15484, pp. 429\u2013462. Springer, Singapore (2024). https:\/\/doi.org\/10.1007\/978-981-96-0875-1_14","DOI":"10.1007\/978-981-96-0875-1_14"},{"key":"1_CR33","doi-asserted-by":"publisher","unstructured":"Pan, J., Wagner, B.: Toothpicks: more efficient fork-free two-round multi-signatures. In: Joye, M., Leander, G. (eds.) EUROCRYPT\u00a02024, Part\u00a0I. LNCS, vol. 14651, pp. 460\u2013489. Springer, Cham (2024). https:\/\/doi.org\/10.1007\/978-3-031-58716-0_16","DOI":"10.1007\/978-3-031-58716-0_16"},{"key":"1_CR34","doi-asserted-by":"publisher","unstructured":"Pino, R.D., Katsumata, S., Niot, G., Reichle, M., Takemure, K.: Unmasking TRaccoon: a lattice-based threshold signature with an efficient identifiable abort protocol. In: Kalai, Y.T., Kamara, S.F. (eds.) CRYPTO\u00a02025, Part\u00a0VI. LNCS, vol. 16005, pp. 423\u2013456. Springer, Cham (2025). https:\/\/doi.org\/10.1007\/978-3-032-01887-8_14","DOI":"10.1007\/978-3-032-01887-8_14"},{"issue":"3","key":"1_CR35","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1007\/s001450010003","volume":"13","author":"D Pointcheval","year":"2000","unstructured":"Pointcheval, D., Stern, J.: Security arguments for digital signatures and blind signatures. J. Cryptol. 13(3), 361\u2013396 (2000). https:\/\/doi.org\/10.1007\/s001450010003","journal-title":"J. Cryptol."},{"key":"1_CR36","doi-asserted-by":"publisher","unstructured":"Scheurer, T.: Universally Composable Verifiable Random Oracles. Master\u2019s thesis, Karlsruher Institut f\u00fcr Technologie (KIT) (2022). https:\/\/doi.org\/10.5445\/IR\/1000151607, 46.23.01; LK 01","DOI":"10.5445\/IR\/1000151607"},{"issue":"11","key":"1_CR37","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":"1_CR38","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"417","DOI":"10.1007\/3-540-47719-5_33","volume-title":"Information Security and Privacy","author":"DR Stinson","year":"2001","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 2001. LNCS, vol. 2119, pp. 417\u2013434. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-47719-5_33"},{"key":"1_CR39","doi-asserted-by":"publisher","unstructured":"Takemure, K., Sakai, Y., Santoso, B., Hanaoka, G., Ohta, K.: More efficient two-round multi-signature scheme with provably secure parameters for standardized elliptic curves. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 107(7), 966\u2013988 (2024). https:\/\/doi.org\/10.1587\/TRANSFUN.2023EAP1045","DOI":"10.1587\/TRANSFUN.2023EAP1045"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 EUROCRYPT 2026"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-25291-3_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,5,7]],"date-time":"2026-05-07T14:53:16Z","timestamp":1778165596000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-25291-3_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9783032252906","9783032252913"],"references-count":39,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-25291-3_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":"8 May 2026","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":"Rome","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","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":"10 May 2026","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 May 2026","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":"eurocrypt2026","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/eurocrypt.iacr.org\/2026\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}