{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,2]],"date-time":"2025-12-02T09:10:07Z","timestamp":1764666607829,"version":"3.46.0"},"publisher-location":"Cham","reference-count":39,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032122957","type":"print"},{"value":"9783032122964","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,12,3]],"date-time":"2025-12-03T00:00:00Z","timestamp":1764720000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,12,3]],"date-time":"2025-12-03T00:00:00Z","timestamp":1764720000000},"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-12296-4_7","type":"book-chapter","created":{"date-parts":[[2025,12,2]],"date-time":"2025-12-02T09:08:03Z","timestamp":1764666483000},"page":"201-234","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Security Amplification of\u00a0Threshold Signatures in\u00a0the\u00a0Standard Model"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0009-0009-9303-750X","authenticated-orcid":false,"given":"Karen","family":"Azari","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0956-1616","authenticated-orcid":false,"given":"Cecilia","family":"Boschini","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5235-8416","authenticated-orcid":false,"given":"Kristina","family":"Host\u00e1kov\u00e1","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3498-5472","authenticated-orcid":false,"given":"Michael","family":"Reichle","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,12,3]]},"reference":[{"key":"7_CR1","unstructured":"Azari, K., Boschini, C., Host\u00e1kov\u00e1, K., Reichle, M.: Security amplification of threshold signatures in the standard model. Cryptology ePrint Archive, Paper 2025\/1705 (2025)"},{"key":"7_CR2","doi-asserted-by":"crossref","unstructured":"Ateniese, G., Magri, B., Venturi, D., Andrade, E.R.: Redactable blockchain - or - rewriting history in bitcoin and friends. In: 2017 IEEE European Symposium on Security and Privacy, pp. 111\u2013126. IEEE Computer Society Press (2017)","DOI":"10.1109\/EuroSP.2017.37"},{"key":"7_CR3","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"517","DOI":"10.1007\/978-3-031-15985-5_18","volume-title":"CRYPTO 2022, Part IV","author":"M Bellare","year":"2022","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 2022, Part IV. LNCS, vol. 13510, pp. 517\u2013550. Springer, Cham (2022)"},{"key":"7_CR4","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1007\/978-3-031-68379-4_6","volume-title":"CRYPTO 2024, Part II","author":"M Barbosa","year":"2024","unstructured":"Barbosa, M., Gellert, K., Hesse, J., Jarecki, S.: Bare PAKE: universally composable key exchange from just passwords. In: Reyzin, L., Stebila, D. (eds.) CRYPTO 2024, Part II. LNCS, vol. 14921, pp. 183\u2013217. Springer, Cham (2024)"},{"key":"7_CR5","doi-asserted-by":"crossref","unstructured":"Bacho, R., Loss, J.: On the adaptive security of the threshold BLS signature scheme. In: Yin, H., Stavrou, A., Cremers, C., Shi, E. (eds.) ACM CCS 2022, pp. 193\u2013207. ACM Press (2022)","DOI":"10.1145\/3548606.3560656"},{"key":"7_CR6","series-title":"LNCS","first-page":"429","volume-title":"EUROCRYPT 2024, Part I","author":"R Bacho","year":"2024","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 2024, Part I. LNCS, vol. 14651, pp. 429\u2013459. Springer, Cham (2024)"},{"key":"7_CR7","series-title":"LNCS","first-page":"31","volume-title":"PKC 2003","author":"A Boldyreva","year":"2003","unstructured":"Boldyreva, A.: Threshold signatures, multisignatures and blind signatures based on the gap-Diffie-Hellman-group signature scheme. In: Desmedt, Y. (ed.) PKC 2003. LNCS, vol. 2567, pp. 31\u201346. Springer, Heidelberg (2003)"},{"key":"7_CR8","doi-asserted-by":"crossref","unstructured":"Brandao, L., Peralta, R.: NIST first call for multi-party threshold schemes (2023)","DOI":"10.6028\/NIST.IR.8214C.ipd"},{"key":"7_CR9","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1007\/978-3-540-89255-7_9","volume-title":"ASIACRYPT 2008","author":"M Bellare","year":"2008","unstructured":"Bellare, M., Ristov, T.: Hash functions from sigma protocols and improvements to VSH. In: Pieprzyk, J. (ed.) ASIACRYPT 2008. LNCS, vol. 5350, pp. 125\u2013142. Springer, Heidelberg (2008)"},{"key":"7_CR10","series-title":"LNCS","first-page":"229","volume-title":"PKC 2006","author":"D Boneh","year":"2006","unstructured":"Boneh, D., Shen, E., Waters, B.: Strongly unforgeable signatures based on computational Diffie-Hellman. In: Yung, M., Dodis, Y., Kiayias, A., Malkin, T. (eds.) PKC 2006. LNCS, vol. 3958, pp. 229\u2013240. Springer, Heidelberg (2006)"},{"key":"7_CR11","doi-asserted-by":"crossref","unstructured":"Canetti, R.: Universally composable security: a new paradigm for cryptographic protocols. In: 42nd FOCS, pp. 136\u2013145. IEEE Computer Society Press (2001)","DOI":"10.1109\/SFCS.2001.959888"},{"key":"7_CR12","series-title":"LNCS","first-page":"152","volume-title":"PKC 2017, Part II","author":"J Camenisch","year":"2017","unstructured":"Camenisch, J., Derler, D., Krenn, S., P\u00f6hls, H.C., Samelin, K., Slamanig, D.: Chameleon-hashes with ephemeral trapdoors - and applications to invisible sanitizable signatures. In: Fehr, S. (ed.) PKC 2017, Part II. LNCS, vol. 10175, pp. 152\u2013182. Springer, Heidelberg (2017)"},{"key":"7_CR13","series-title":"LNCS","first-page":"233","volume-title":"PKC 2025, Part III","author":"Y Chen","year":"2025","unstructured":"Chen, Y.: Dazzle: improved adaptive threshold signatures from DDH. In: Jager, T., Pan, J. (eds.) PKC 2025, Part III. LNCS, vol. 15676, pp. 233\u2013261. Springer, Cham (2025)"},{"key":"7_CR14","unstructured":"Connolly, D., Komlo, C., Goldberg, I., Wood, C.A.: Two-round threshold schnorr signatures with frost. Technical report, Internet-Draft draft-irtf-cfrg-frost-10, Internet Engineering Task Force\u00a0$$\\ldots $$ (2023)"},{"key":"7_CR15","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)"},{"key":"7_CR16","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"678","DOI":"10.1007\/978-3-031-38557-5_22","volume-title":"CRYPTO 2023, Part I","author":"EC Crites","year":"2023","unstructured":"Crites, E.C., Komlo, C., Maller, M.: Fully adaptive Schnorr threshold signatures. In: Handschuh, H., Lysyanskaya, A. (eds.) CRYPTO 2023, Part I. LNCS, vol. 14081, pp. 678\u2013709. Springer, Cham (2023)"},{"key":"7_CR17","series-title":"LNCS","first-page":"120","volume-title":"CRYPTO 1987","author":"Y Desmedt","year":"1988","unstructured":"Desmedt, Y.: Society and group oriented cryptography: a new concept. In: Pomerance, C. (ed.) CRYPTO 1987. LNCS, vol. 293, pp. 120\u2013127. Springer, Heidelberg (1988)"},{"key":"7_CR18","series-title":"LNCS","first-page":"307","volume-title":"CRYPTO 1989","author":"Y Desmedt","year":"1990","unstructured":"Desmedt, Y., Frankel, Y.: Threshold cryptosystems. In: Brassard, G. (ed.) CRYPTO 1989. LNCS, vol. 435, pp. 307\u2013315. Springer, New York (1990)"},{"key":"7_CR19","series-title":"LNCS","first-page":"219","volume-title":"EUROCRYPT 2024, Part II","author":"R Del Pino","year":"2024","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 2024, Part II. LNCS, vol. 14652, pp. 219\u2013248. Springer, Cham (2024)"},{"key":"7_CR20","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1007\/978-3-031-68394-7_9","volume-title":"CRYPTO 2024, Part VII","author":"S Das","year":"2024","unstructured":"Das, S., Ren, L.: Adaptively secure BLS threshold signatures from DDH and co-CDH. In: Reyzin, L., Stebila, D. (eds.) CRYPTO 2024, Part VII. LNCS, vol. 14926, pp. 251\u2013284. Springer, Cham (2024)"},{"key":"7_CR21","doi-asserted-by":"crossref","unstructured":"Derler, D., Samelin, K., Slamanig, D., Striecks, C.: Fine-grained and controlled rewriting in blockchains: chameleon-hashing gone attribute-based. In: NDSS\u00a02019. The Internet Society (2019)","DOI":"10.14722\/ndss.2019.23066"},{"key":"7_CR22","series-title":"LNCS","first-page":"186","volume-title":"CRYPTO 1986","author":"A Fiat","year":"1987","unstructured":"Fiat, A., Shamir, A.: How to prove yourself: practical solutions to identification and signature problems. In: Odlyzko, A.M. (ed.) CRYPTO 1986. LNCS, vol. 263, pp. 186\u2013194. Springer, Heidelberg (1987)"},{"key":"7_CR23","series-title":"LNCS","first-page":"354","volume-title":"EUROCRYPT 1996","author":"R Gennaro","year":"1996","unstructured":"Gennaro, R., Jarecki, S., Krawczyk, H., Rabin, T.: Robust threshold DSS signatures. In: Maurer, U.M. (ed.) EUROCRYPT 1996. LNCS, vol. 1070, pp. 354\u2013371. Springer, Heidelberg (1996)"},{"issue":"1","key":"7_CR24","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)","journal-title":"J. Cryptol."},{"key":"7_CR25","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"415","DOI":"10.1007\/978-3-540-78967-3_24","volume-title":"EUROCRYPT 2008","author":"J Groth","year":"2008","unstructured":"Groth, J., Sahai, A.: Efficient non-interactive proof systems for bilinear groups. In: Smart, N.P. (ed.) EUROCRYPT 2008. LNCS, vol. 4965, pp. 415\u2013432. Springer, Heidelberg (2008)"},{"key":"7_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1007\/978-3-030-81652-0_2","volume-title":"Selected Areas in Cryptography","author":"C Komlo","year":"2021","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 (2021). https:\/\/doi.org\/10.1007\/978-3-030-81652-0_2"},{"key":"7_CR27","unstructured":"Krawczyk, H., Rabin, T.: Chameleon signatures. In: NDSS\u00a02000. The Internet Society (2000)"},{"key":"7_CR28","series-title":"LNCS","first-page":"383","volume-title":"ASIACRYPT 2023, Part II","author":"S Katsumata","year":"2023","unstructured":"Katsumata, S., Reichle, M., Sakai, Y.: Practical round-optimal blind signatures in the ROM from standard assumptions. In: Guo, J., Steinfeld, R. (eds.) ASIACRYPT 2023, Part II. LNCS, vol. 14439, pp. 383\u2013417. Springer, Singapore (2023)"},{"key":"7_CR29","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"459","DOI":"10.1007\/978-3-031-68394-7_15","volume-title":"CRYPTO 2024, Part VII","author":"S Katsumata","year":"2024","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 2024, Part VII. LNCS, vol. 14926, pp. 459\u2013491. Springer, Cham (2024)"},{"key":"7_CR30","doi-asserted-by":"crossref","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)","DOI":"10.1145\/2611462.2611498"},{"key":"7_CR31","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.tcs.2016.02.031","volume":"645","author":"B Libert","year":"2016","unstructured":"Libert, B., Joye, M., Yung, M.: Born and raised distributively: fully distributed non-interactive adaptively-secure threshold signatures with short shares. Theor. Comput. Sci. 645, 1\u201324 (2016)","journal-title":"Theor. Comput. Sci."},{"key":"7_CR32","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1007\/978-3-031-91124-8_12","volume-title":"EUROCRYPT 2025","author":"A Lehmann","year":"2025","unstructured":"Lehmann, A., Nazarian, P., \u00d6zbay, C.: Stronger security for threshold blind signatures. In: Fehr, S., Fouque, P.A. (eds.) EUROCRYPT 2025. LNCS, vol. 15602, pp. 335\u2013364. Springer, Cham (2025). https:\/\/doi.org\/10.1007\/978-3-031-91124-8_12"},{"key":"7_CR33","series-title":"LNCS","first-page":"163","volume-title":"PKC 2024, Part I","author":"A Mitrokotsa","year":"2024","unstructured":"Mitrokotsa, A., Mukherjee, S., Sedaghat, M., Slamanig, D., Tomy, J.: Threshold structure-preserving signatures: strong and adaptive security under standard assumptions. In: Tang, Q., Teague, V. (eds.) PKC 2024, Part I. LNCS, vol. 14601, pp. 163\u2013195. Springer, Cham (2024)"},{"key":"7_CR34","series-title":"LNCS","first-page":"429","volume-title":"ASIACRYPT 2024, Part I","author":"S Navot","year":"2024","unstructured":"Navot, S., Tessaro, S.: One-more unforgeability for multi - and threshold signatures. In: Chung, K.-M., Sasaki, Yu. (eds.) ASIACRYPT 2024, Part I. LNCS, vol. 15484, pp. 429\u2013462. Springer, Singapore (2024)"},{"key":"7_CR35","doi-asserted-by":"crossref","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)","DOI":"10.1145\/3548606.3560583"},{"issue":"11","key":"7_CR36","first-page":"612","volume":"22","author":"A Shamir","year":"1979","unstructured":"Shamir, A.: How to share a secret. Commun. Assoc. Comput. Mach. 22(11), 612\u2013613 (1979)","journal-title":"Commun. Assoc. Comput. Mach."},{"key":"7_CR37","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1007\/3-540-45539-6_15","volume-title":"EUROCRYPT 2000","author":"V Shoup","year":"2000","unstructured":"Shoup, V.: Practical threshold signatures. In: Preneel, B. (ed.) EUROCRYPT 2000. LNCS, vol. 1807, pp. 207\u2013220. Springer, Heidelberg (2000)"},{"key":"7_CR38","series-title":"LNCS","first-page":"357","volume-title":"CT-RSA 2007","author":"R Steinfeld","year":"2007","unstructured":"Steinfeld, R., Pieprzyk, J., Wang, H.: How to strengthen any weakly unforgeable signature into a strongly unforgeable signature. In: Abe, M. (ed.) CT-RSA 2007. LNCS, vol. 4377, pp. 357\u2013371. Springer, Heidelberg (2007)"},{"key":"7_CR39","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"628","DOI":"10.1007\/978-3-031-30589-4_22","volume-title":"EUROCRYPT 2023, Part V","author":"S Tessaro","year":"2023","unstructured":"Tessaro, S., Zhu, C.: Threshold and multi-signature schemes from linear hash functions. In: Hazay, C., Stam, M. (eds.) EUROCRYPT 2023, Part V. LNCS, vol. 14008, pp. 628\u2013658. Springer, Cham (2023)"}],"container-title":["Lecture Notes in Computer Science","Theory of Cryptography"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-12296-4_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,12,2]],"date-time":"2025-12-02T09:08:13Z","timestamp":1764666493000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-12296-4_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,12,3]]},"ISBN":["9783032122957","9783032122964"],"references-count":39,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-12296-4_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,12,3]]},"assertion":[{"value":"3 December 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"TCC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Theory of Cryptography Conference","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Aarhus","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Denmark","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":"1 December 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 December 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"tcc2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/tcc.iacr.org\/2025\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}