{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,2]],"date-time":"2026-07-02T16:17:07Z","timestamp":1783009027986,"version":"3.54.5"},"publisher-location":"Cham","reference-count":38,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031587399","type":"print"},{"value":"9783031587405","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-58740-5_3","type":"book-chapter","created":{"date-parts":[[2024,4,28]],"date-time":"2024-04-28T02:01:45Z","timestamp":1714269705000},"page":"62-91","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":21,"title":["SPRINT: High-Throughput Robust Distributed Schnorr Signatures"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-8300-1820","authenticated-orcid":false,"given":"Fabrice","family":"Benhamouda","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3432-7899","authenticated-orcid":false,"given":"Shai","family":"Halevi","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3130-1888","authenticated-orcid":false,"given":"Hugo","family":"Krawczyk","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3183-9402","authenticated-orcid":false,"given":"Yiping","family":"Ma","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1386-605X","authenticated-orcid":false,"given":"Tal","family":"Rabin","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2024,4,29]]},"reference":[{"key":"3_CR1","doi-asserted-by":"publisher","unstructured":"Abraham, I., Jovanovic, P., Maller, M., Meiklejohn, S., Stern, G.: Bingo: adaptivity and asynchrony in verifiable secret sharing and distributed key generation. In: Handschuh, H., Lysyanskaya, A. (eds.) CRYPTO (2023). https:\/\/doi.org\/10.1007\/978-3-031-38557-5_2","DOI":"10.1007\/978-3-031-38557-5_2"},{"key":"3_CR2","doi-asserted-by":"publisher","unstructured":"Ben-Or, M., Canetti, R., Goldreich, O.: Asynchronous secure computation. In: 25th ACM STOC, pp. 52\u201361. ACM Press (May 1993). https:\/\/doi.org\/10.1145\/167088.167109","DOI":"10.1145\/167088.167109"},{"key":"3_CR3","doi-asserted-by":"publisher","unstructured":"Ben-Sasson, E., Carmon, D., Kopparty, S., Levit, D.: Elliptic curve fast Fourier transform (ECFFT) part I: low-degree extension in time O(n log n) over all finite fields. In: Bansal, N., Nagarajan, V. (eds.) SODA 2023, Florence, Italy, January 22\u201325, 2023, pp. 700\u2013737. SIAM (2023). https:\/\/doi.org\/10.1137\/1.9781611977554.ch30","DOI":"10.1137\/1.9781611977554.ch30"},{"key":"3_CR4","doi-asserted-by":"crossref","unstructured":"Benhamouda, F., Halevi, S., Krawczyk, H., Ma, Y., Rabin, T.: SPRINT: high-throughput robust distributed Schnorr signatures. Cryptology ePrint Archive (2023). https:\/\/eprint.iacr.org\/2023\/427","DOI":"10.1007\/978-3-031-58740-5_3"},{"issue":"4","key":"3_CR5","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1007\/s00145-022-09436-0","volume":"35","author":"F Benhamouda","year":"2022","unstructured":"Benhamouda, F., Lepoint, T., Loss, J., Orr\u00f9, M., Raykova, M.: On the (in)security of ROS. J. Cryptol. 35(4), 25 (2022). https:\/\/doi.org\/10.1007\/s00145-022-09436-0","journal-title":"J. Cryptol."},{"key":"3_CR6","unstructured":"Borgeaud, W.: ECFFT algorithms on the BN254 base field (2023). https:\/\/github.com\/wborgeaud\/ecfft-bn254"},{"key":"3_CR7","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2019.02.001","author":"J Chen","year":"2019","unstructured":"Chen, J., Micali, S.: Algorand: a secure and efficient distributed ledger. Theor. Comput. Sci. (2019). https:\/\/doi.org\/10.1016\/j.tcs.2019.02.001","journal-title":"Theor. Comput. Sci."},{"key":"3_CR8","unstructured":"Crites, E.C., Komlo, C., Maller, M.: How to prove Schnorr assuming schnorr: security of multi- and threshold signatures. Cryptology ePrint Archive (2021). https:\/\/eprint.iacr.org\/2021\/1375"},{"key":"3_CR9","unstructured":"Das, S., Xiang, Z., Kokoris-Kogias, L., Ren, L.: Practical asynchronous high-threshold distributed key generation and distributed polynomial sampling. USENIX Security (2023)"},{"key":"3_CR10","doi-asserted-by":"publisher","unstructured":"Das, S., Yurek, T., Xiang, Z., Miller, A.K., Kokoris-Kogias, L., Ren, L.: Practical asynchronous distributed key generation. In: 2022 IEEE Symposium on Security and Privacy, pp. 2518\u20132534. IEEE Computer Society Press (May 2022). https:\/\/doi.org\/10.1109\/SP46214.2022.9833584","DOI":"10.1109\/SP46214.2022.9833584"},{"key":"3_CR11","doi-asserted-by":"publisher","unstructured":"Drijvers, M., Edalatnejad, K., Ford, B., Kiltz, E., Loss, J., Neven, G., Stepanovs, I.: On the security of two-round multi-signatures. In: 2019 IEEE Symposium on Security and Privacy (SP), pp. 1084\u20131101 (2019). https:\/\/doi.org\/10.1109\/SP.2019.00050","DOI":"10.1109\/SP.2019.00050"},{"key":"3_CR12","doi-asserted-by":"publisher","unstructured":"Feldman, P.: A practical scheme for non-interactive verifiable secret sharing. In: 28th FOCS, pp. 427\u2013437. IEEE Computer Society Press (Oct 1987). https:\/\/doi.org\/10.1109\/SFCS.1987.4","DOI":"10.1109\/SFCS.1987.4"},{"key":"3_CR13","doi-asserted-by":"publisher","unstructured":"Franklin, M.K., Yung, M.: Communication complexity of secure computation (extended abstract). In: 24th ACM STOC, pp. 699\u2013710. ACM Press (May 1992). https:\/\/doi.org\/10.1145\/129712.129780","DOI":"10.1145\/129712.129780"},{"issue":"1","key":"3_CR14","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1007\/s00446-020-00384-1","volume":"34","author":"C Ganesh","year":"2021","unstructured":"Ganesh, C., Patra, A.: Optimal extension protocols for byzantine broadcast and agreement. Distributed Comput. 34(1), 59\u201377 (2021). https:\/\/doi.org\/10.1007\/s00446-020-00384-1","journal-title":"Distributed Comput."},{"key":"3_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1007\/978-3-030-84242-0_6","volume-title":"Advances in Cryptology \u2013 CRYPTO 2021","author":"F Garillot","year":"2021","unstructured":"Garillot, F., Kondi, Y., Mohassel, P., Nikolaenko, V.: Threshold Schnorr with stateless deterministic signing from standard assumptions. In: Malkin, T., Peikert, C. (eds.) CRYPTO 2021. LNCS, vol. 12825, pp. 127\u2013156. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-84242-0_6"},{"key":"3_CR16","doi-asserted-by":"publisher","unstructured":"Gennaro, R., Jarecki, S., Krawczyk, H., Rabin, T.: Secure distributed key generation for discrete-log based cryptosystems. J. Cryptol. 20(1), 51\u201383 (Jan 2007). https:\/\/doi.org\/10.1007\/s00145-006-0347-3","DOI":"10.1007\/s00145-006-0347-3"},{"key":"3_CR17","doi-asserted-by":"publisher","unstructured":"Gennaro, R., Rabin, M.O., Rabin, T.: Simplified VSS and fast-track multiparty computations with applications to threshold cryptography. In: Coan, B.A., Afek, Y. (eds.) 17th ACM PODC, pp. 101\u2013111. ACM (Jun\u00a0\/\u00a0Jul 1998). https:\/\/doi.org\/10.1145\/277697.277716","DOI":"10.1145\/277697.277716"},{"key":"3_CR18","doi-asserted-by":"publisher","unstructured":"Goyal, V., Polychroniadou, A., Song, Y.: Sharing transformation and dishonest majority MPC with packed secret sharing. In: Dodis, Y., Shrimpton, T. (eds.) CRYPTO (2022). https:\/\/doi.org\/10.1007\/978-3-031-15985-5_1","DOI":"10.1007\/978-3-031-15985-5_1"},{"key":"3_CR19","unstructured":"Groth, J., Shoup, V.: Design and analysis of a distributed ECDSA signing service. Cryptology ePrint Archive, Report 2022\/506 (2022). https:\/\/eprint.iacr.org\/2022\/506"},{"key":"3_CR20","doi-asserted-by":"publisher","unstructured":"Groth, J., Shoup, V.: On the security of ECDSA with additive key derivation and presignatures. In: Dunkelman, O., Dziembowski, S. (eds.) EUROCRYPT\u00a02022, Part\u00a0I. LNCS, vol. 13275, pp. 365\u2013396. Springer, Heidelberg (May\u00a0\/\u00a0Jun 2022). https:\/\/doi.org\/10.1007\/978-3-031-06944-4_13","DOI":"10.1007\/978-3-031-06944-4_13"},{"key":"3_CR21","unstructured":"Groth, J., Shoup, V.: Fast batched asynchronous distributed key generation. Cryptology ePrint Archive (2023). https:\/\/eprint.iacr.org\/2023\/1175"},{"key":"3_CR22","doi-asserted-by":"publisher","unstructured":"Herzberg, A., Jakobsson, M., Jarecki, S., Krawczyk, H., Yung, M.: Proactive public key and signature systems. In: Graveman, R., Janson, P.A., Neuman, C., Gong, L. (eds.) ACM CCS 97, pp. 100\u2013110. ACM Press (Apr 1997). https:\/\/doi.org\/10.1145\/266420.266442","DOI":"10.1145\/266420.266442"},{"key":"3_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"339","DOI":"10.1007\/3-540-44750-4_27","volume-title":"Advances in Cryptology \u2014 CRYPT0\u2019 95","author":"A Herzberg","year":"1995","unstructured":"Herzberg, A., Jarecki, S., Krawczyk, H., Yung, M.: Proactive secret sharing or: how to cope with perpetual leakage. In: Coppersmith, D. (ed.) CRYPTO 1995. LNCS, vol. 963, pp. 339\u2013352. Springer, Heidelberg (1995). https:\/\/doi.org\/10.1007\/3-540-44750-4_27"},{"key":"3_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"463","DOI":"10.1007\/11818175_28","volume-title":"Advances in Cryptology - CRYPTO 2006","author":"M Hirt","year":"2006","unstructured":"Hirt, M., Nielsen, J.B.: Robust multiparty computation with linear communication complexity. In: Dwork, C. (ed.) CRYPTO 2006. LNCS, vol. 4117, pp. 463\u2013482. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11818175_28"},{"key":"3_CR25","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1007\/978-3-031-08896-4_4","volume-title":"Information Security and Cryptology - ICISC 2021","author":"S Joshi","year":"2022","unstructured":"Joshi, S., Pandey, D., Srinathan, K.: Atssia: asynchronous truly-threshold schnorr signing for inconsistent availability. In: Park, J.H., Seo, S.H. (eds.) Information Security and Cryptology - ICISC 2021, pp. 71\u201391. Springer International Publishing, Cham (2022)"},{"key":"3_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1007\/978-3-642-17373-8_11","volume-title":"Advances in Cryptology - ASIACRYPT 2010","author":"A Kate","year":"2010","unstructured":"Kate, A., Zaverucha, G.M., Goldberg, I.: Constant-size commitments to polynomials and their applications. In: Abe, M. (ed.) ASIACRYPT 2010. LNCS, vol. 6477, pp. 177\u2013194. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-17373-8_11"},{"key":"3_CR27","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":"3_CR28","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":"3_CR29","doi-asserted-by":"publisher","unstructured":"Nayak, K., Ren, L., Shi, E., Vaidya, N.H., Xiang, Z.: Improved extension protocols for byzantine broadcast and agreement. In: Attiya, H. (ed.) 34th International Symposium on Distributed Computing, DISC 2020, October 12-16, 2020, Virtual Conference. LIPIcs, vol.\u00a0179, pp. 28:1\u201328:17. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2020). https:\/\/doi.org\/10.4230\/LIPIcs.DISC.2020.28","DOI":"10.4230\/LIPIcs.DISC.2020.28"},{"issue":"17","key":"3_CR30","doi-asserted-by":"publisher","first-page":"4585","DOI":"10.1002\/sec.1651","volume":"9","author":"W Neji","year":"2016","unstructured":"Neji, W., Blibech, K., Ben Rajeb, N.: Distributed key generation protocol with a new complaint management strategy. Security Commun. Netw. 9(17), 4585\u20134595 (2016). https:\/\/doi.org\/10.1002\/sec.1651","journal-title":"Security Commun. Netw."},{"key":"3_CR31","doi-asserted-by":"publisher","unstructured":"Ostrovsky, R., Yung, M.: How to withstand mobile virus attacks (extended abstract). In: Logrippo, L. (ed.) 10th ACM PODC., pp. 51\u201359. ACM (Aug 1991). https:\/\/doi.org\/10.1145\/112600.112605","DOI":"10.1145\/112600.112605"},{"key":"3_CR32","doi-asserted-by":"publisher","unstructured":"Patra, A., Choudhary, A., Rangan, C.P.: Efficient statistical asynchronous verifiable secret sharing with optimal resilience. In: Kurosawa, K. (ed.) ICITS 09. LNCS, vol.\u00a05973, pp. 74\u201392. Springer, Heidelberg (Dec 2010). https:\/\/doi.org\/10.1007\/978-3-642-14496-7_7","DOI":"10.1007\/978-3-642-14496-7_7"},{"key":"3_CR33","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"522","DOI":"10.1007\/3-540-46416-6_47","volume-title":"Advances in Cryptology \u2014 EUROCRYPT \u201991","author":"TP Pedersen","year":"1991","unstructured":"Pedersen, T.P.: A threshold cryptosystem without a trusted party. In: Davies, D.W. (ed.) EUROCRYPT 1991. LNCS, vol. 547, pp. 522\u2013526. Springer, Heidelberg (1991). https:\/\/doi.org\/10.1007\/3-540-46416-6_47"},{"key":"3_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1007\/3-540-46766-1_9","volume-title":"Advances in Cryptology \u2014 CRYPTO \u201991","author":"TP Pedersen","year":"1992","unstructured":"Pedersen, T.P.: Non-interactive and information-theoretic secure verifiable secret sharing. In: Feigenbaum, J. (ed.) CRYPTO 1991. LNCS, vol. 576, pp. 129\u2013140. Springer, Heidelberg (1992). https:\/\/doi.org\/10.1007\/3-540-46766-1_9"},{"key":"3_CR35","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 (Nov 2022). https:\/\/doi.org\/10.1145\/3548606.3560583","DOI":"10.1145\/3548606.3560583"},{"key":"3_CR36","unstructured":"Shoup, V.: The many faces of Schnorr. Cryptology ePrint Archive (2023). https:\/\/eprint.iacr.org\/2023\/1019"},{"key":"3_CR37","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":"3_CR38","doi-asserted-by":"crossref","unstructured":"Yurek, T., Luo, L., Fairoze, J., Kate, A., Miller, A.K.: hbACSS: How to robustly share many secrets. In: 29th Annual Network and Distributed System Security Symposium, NDSS 2022, San Diego, California, USA, April 24-28, 2022 (2022)","DOI":"10.14722\/ndss.2022.23120"}],"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-58740-5_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,28]],"date-time":"2026-04-28T00:06:24Z","timestamp":1777334784000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-58740-5_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031587399","9783031587405"],"references-count":38,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-58740-5_3","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":"29 April 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"}]}}