{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,7]],"date-time":"2026-08-07T17:13:19Z","timestamp":1786122799809,"version":"build-2736575974"},"publisher-location":"Cham","reference-count":41,"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_16","type":"book-chapter","created":{"date-parts":[[2025,8,16]],"date-time":"2025-08-16T19:17:20Z","timestamp":1755371840000},"page":"480-511","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["On the\u00a0Adaptive Security of\u00a0FROST"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-9992-1771","authenticated-orcid":false,"given":"Elizabeth","family":"Crites","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6084-9303","authenticated-orcid":false,"given":"Jonathan","family":"Katz","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2294-2491","authenticated-orcid":false,"given":"Chelsea","family":"Komlo","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3751-8546","authenticated-orcid":false,"given":"Stefano","family":"Tessaro","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4276-2797","authenticated-orcid":false,"given":"Chenzhi","family":"Zhu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2025,8,17]]},"reference":[{"key":"16_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":"16_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"593","DOI":"10.1007\/11761679_35","volume-title":"Advances in Cryptology - EUROCRYPT 2006","author":"JF Almansa","year":"2006","unstructured":"Almansa, J.F., Damg\u00e5rd, I., Nielsen, J.B.: Simplified threshold RSA with adaptive and proactive security. In: Vaudenay, S. (ed.) EUROCRYPT 2006. LNCS, vol. 4004, pp. 593\u2013611. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11761679_35"},{"key":"16_CR3","doi-asserted-by":"crossref","unstructured":"Bacho, R., Das, S., Loss, J., Ren, L.: Glacius: threshold Schnorr signatures from DDH with full adaptive security (2024). https:\/\/eprint.iacr.org\/2024\/1628","DOI":"10.1007\/978-3-031-91124-8_11"},{"key":"16_CR4","doi-asserted-by":"crossref","unstructured":"Bacho, R., Loss, J.: On the adaptive security of the threshold BLS signature scheme. IACR Cryptol. ePrint Arch., p.\u00a0534 (2022). https:\/\/eprint.iacr.org\/2022\/534","DOI":"10.1145\/3548606.3560656"},{"key":"16_CR5","doi-asserted-by":"crossref","unstructured":"Bacho, R., Loss, J., Stern, G., Wagner, B.: HARTS: high-threshold, adaptively secure, and robust threshold Schnorr signatures (2024). https:\/\/eprint.iacr.org\/2024\/280","DOI":"10.1007\/978-981-96-0891-1_4"},{"key":"16_CR6","unstructured":"Bacho, R., Loss, J., Tessaro, S., Wagner, B., Zhu, C.: Twinkle: threshold signatures from DDH with full adaptive security. IACR Cryptol. ePrint Arch., p.\u00a01482 (2023). https:\/\/eprint.iacr.org\/2023\/1482"},{"key":"16_CR7","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1007\/978-3-031-86599-2_5","volume-title":"PQCrypto 2025, Part I","author":"M Battagliola","year":"2025","unstructured":"Battagliola, M., Borin, G., Crescenzo, G.D., Meneghetti, A., Persichetti, E.: Enhancing threshold group action signature schemes: adaptive security and scalability improvements. In: Niederhagen, R., Saarinen, M.O. (eds.) PQCrypto 2025, Part I. LNCS, vol. 15577, pp. 129\u2013161. Springer, Cham (2025). https:\/\/doi.org\/10.1007\/978-3-031-86599-2_5"},{"key":"16_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"587","DOI":"10.1007\/978-3-030-92068-5_20","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2021","author":"B Bauer","year":"2021","unstructured":"Bauer, B., Fuchsbauer, G., Plouviez, A.: The one-more discrete logarithm assumption in\u00a0the\u00a0generic group model. In: Tibouchi, M., Wang, H. (eds.) ASIACRYPT 2021. LNCS, vol. 13093, pp. 587\u2013617. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-92068-5_20"},{"key":"16_CR9","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"517","DOI":"10.1007\/978-3-031-15985-5_18","volume-title":"CRYPTO 2022","author":"M Bellare","year":"2022","unstructured":"Bellare, M., Crites, E., 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. LNCS, vol. 13510, pp. 517\u2013550. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-15985-5_18"},{"key":"16_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"162","DOI":"10.1007\/3-540-45708-9_11","volume-title":"Advances in Cryptology \u2014 CRYPTO 2002","author":"M Bellare","year":"2002","unstructured":"Bellare, M., Palacio, A.: GQ and Schnorr identification schemes: proofs of security against impersonation under active and concurrent attacks. In: Yung, M. (ed.) CRYPTO 2002. LNCS, vol. 2442, pp. 162\u2013177. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-45708-9_11"},{"key":"16_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1007\/978-3-540-71677-8_14","volume-title":"Public Key Cryptography \u2013 PKC 2007","author":"M Bellare","year":"2007","unstructured":"Bellare, M., Shoup, S.: Two-tier signatures, strongly unforgeable signatures, and Fiat-Shamir without random oracles. In: Okamoto, T., Wang, X. (eds.) PKC 2007. LNCS, vol. 4450, pp. 201\u2013216. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-71677-8_14"},{"key":"16_CR12","doi-asserted-by":"crossref","unstructured":"Bellare, M., Tessaro, S., Zhu, C.: Stronger security for non-interactive threshold signatures (2022). https:\/\/eprint.iacr.org\/2022\/833","DOI":"10.1007\/978-3-031-15985-5_18"},{"key":"16_CR13","doi-asserted-by":"crossref","unstructured":"Brand\u00e3o, L., Davidson, M.: Notes on threshold EdDSA\/Schnorr signatures (2022). https:\/\/nvlpubs.nist.gov\/nistpubs\/ir\/2022\/NIST.IR.8214B.ipd.pdf","DOI":"10.6028\/NIST.IR.8214B.ipd"},{"key":"16_CR14","doi-asserted-by":"crossref","unstructured":"Brand\u00e3o, L., Peralta, R.: NIST first call for multi-party threshold schemes (2025). https:\/\/nvlpubs.nist.gov\/nistpubs\/ir\/2025\/NIST.IR.8214C.2pd.pdf","DOI":"10.6028\/NIST.IR.8214C.2pd"},{"key":"16_CR15","doi-asserted-by":"crossref","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.) CCS 2020: 2020 ACM SIGSAC Conference on Computer and Communications Security, Virtual Event, USA, 9\u201313 November 2020, pp. 1769\u20131787. ACM (2020). https:\/\/doi.org\/10.1145\/3372297.3423367","DOI":"10.1145\/3372297.3423367"},{"key":"16_CR16","doi-asserted-by":"publisher","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","DOI":"10.1016\/J.TCS.2022.10.016"},{"key":"16_CR17","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"743","DOI":"10.1007\/978-3-031-38557-5_24","volume-title":"Crypto 2023","author":"H Chu","year":"2023","unstructured":"Chu, H., Gerhart, P., Ruffing, T., Schr\u00f6der, D.: Practical Schnorr threshold signatures without the algebraic group model. In: Handschuh, H., Lysyanskaya, A. (eds.) Crypto 2023. LNCS, vol. 14081, pp. 743\u2013773. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-38557-5_24"},{"key":"16_CR18","unstructured":"Connolly, D., Gouvea, C.: Speeding up FROST with multi-scalar multiplication (2023). https:\/\/zfnd.org\/speeding-up-frost-with-multi-scalar-multiplication"},{"key":"16_CR19","unstructured":"Connolly, D., Komlo, C., Goldberg, I., Wood, C.: Two-round threshold Schnorr signatures with FROST (2022). https:\/\/datatracker.ietf.org\/doc\/draft-irtf-cfrg-frost"},{"key":"16_CR20","unstructured":"Crites, E., Komlo, C., Maller, M.: On the adaptive security of key-unique threshold signatures. Cryptology ePrint Archive, Paper 2025\/943 (2025). https:\/\/eprint.iacr.org\/2025\/943"},{"key":"16_CR21","unstructured":"Crites, E., Stewart, A.: In: Tauman Kalai, Y., Kamara, S.F. (eds.) CRYPTO 2025, LNCS, vol. 16005, pp. xx\u2013yy. Springer, Cham (2025)"},{"key":"16_CR22","unstructured":"Crites, E.C., Komlo, C., Maller, M.: How to prove Schnorr assuming Schnorr: security of multi- and threshold signatures (2021). https:\/\/eprint.iacr.org\/2021\/1375"},{"key":"16_CR23","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"678","DOI":"10.1007\/978-3-031-38557-5_22","volume-title":"Crypto 2023","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. LNCS, vol. 14081, pp. 678\u2013709. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-38557-5_22"},{"key":"16_CR24","unstructured":"Das, S., Ren, L.: Adaptively secure BLS threshold signatures from DDH and CO-CDH. IACR Cryptol. ePrint Arch., p.\u00a01553 (2023). https:\/\/eprint.iacr.org\/2023\/1553"},{"key":"16_CR25","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"},{"key":"16_CR26","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/978-3-319-96881-0_2","volume-title":"Crypto 2018","author":"G Fuchsbauer","year":"2018","unstructured":"Fuchsbauer, G., Kiltz, E., Loss, J.: The algebraic group model and its applications. In: Shacham, H., Boldyreva, A. (eds.) Crypto 2018. LNCS, vol. 10992, pp. 33\u201362. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-96881-0_2"},{"key":"16_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1007\/978-3-030-45724-2_3","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2020","author":"G Fuchsbauer","year":"2020","unstructured":"Fuchsbauer, G., Plouviez, A., Seurin, Y.: Blind Schnorr signatures and signed ElGamal encryption in the algebraic group model. In: Canteaut, A., Ishai, Y. (eds.) EUROCRYPT 2020. LNCS, vol. 12106, pp. 63\u201395. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-45724-2_3"},{"key":"16_CR28","unstructured":"Gouvea, C., Komlo, C., Connolly, D.: FROST for spend authorization multisignatures (2022). https:\/\/zips.z.cash\/zip-0312"},{"key":"16_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). https:\/\/doi.org\/10.1007\/978-3-031-68394-7_15"},{"key":"16_CR30","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":"16_CR31","unstructured":"Komlo, C., Goldberg, I.: Arctic: Lightweight and stateless threshold Schnorr signatures. Cryptology ePrint Archive, Paper 2024\/466 (2024). https:\/\/eprint.iacr.org\/2024\/466"},{"key":"16_CR32","doi-asserted-by":"publisher","unstructured":"Koziel, B., Gordon, S.D., Gentry, C.: Fast two-party threshold ECDSA with proactive security. In: Luo, B., Liao, X., Xu, J., Kirda, E., Lie, D. (eds.) Proceedings of the 2024 on ACM SIGSAC Conference on Computer and Communications Security, CCS 2024, Salt Lake City, UT, USA, 14\u201318 October 2024, pp. 1567\u20131580. ACM (2024). https:\/\/doi.org\/10.1145\/3658644.3670387","DOI":"10.1145\/3658644.3670387"},{"key":"16_CR33","doi-asserted-by":"crossref","unstructured":"Lindell, Y.: Simple three-round multiparty Schnorr signing with full simulatability. IACR Communications in Cryptology 1(1) (2024)","DOI":"10.62056\/a36c0l5vt"},{"key":"16_CR34","unstructured":"Makriyannis, N.: On the classic protocol for MPC Schnorr signatures. Cryptology ePrint Archive (2022). https:\/\/eprint.iacr.org\/2022\/1332"},{"key":"16_CR35","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1007\/978-3-030-84242-0_8","volume-title":"Advances in Cryptology \u2013 CRYPTO 2021","author":"J Nick","year":"2021","unstructured":"Nick, J., Ruffing, T., Seurin, Y.: MuSig2: simple two-round Schnorr multi-signatures. In: Malkin, T., Peikert, C. (eds.) CRYPTO 2021. LNCS, vol. 12825, pp. 189\u2013221. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-84242-0_8"},{"key":"16_CR36","unstructured":"Nicolosi, A., Krohn, M.N., Dodis, Y., Mazi\u00e8res, D.: Proactive two-party signatures for user authentication. In: NDSS 2003. The Internet Society (2003). https:\/\/www.ndss-symposium.org\/ndss2003\/proactive-two-party-signatures-user-authentication\/"},{"issue":"3","key":"16_CR37","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)","journal-title":"J. Cryptol."},{"key":"16_CR38","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.) CCS 2022, pp. 2551\u20132564. ACM (2022)","DOI":"10.1145\/3548606.3560583"},{"issue":"3","key":"16_CR39","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":"16_CR40","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. Comm. ACM 22(11), 612\u2013613 (1979)","journal-title":"Comm. ACM"},{"key":"16_CR41","doi-asserted-by":"crossref","unstructured":"Tessaro, S., Zhu, C.: Threshold and multi-signature schemes from linear hash functions. In: Hazay, C., Stam, M. (eds.) Eurocrypt 2023. LNCS, vol. 14008, pp. 628\u2013658. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-30589-4_22","DOI":"10.1007\/978-3-031-30589-4_22"}],"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_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,8,7]],"date-time":"2026-08-07T12:33:26Z","timestamp":1786106006000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-01887-8_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9783032018861","9783032018878"],"references-count":41,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-01887-8_16","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"}}]}}