{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,2]],"date-time":"2026-07-02T16:16:47Z","timestamp":1783009007583,"version":"3.54.5"},"publisher-location":"Cham","reference-count":54,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031918315","type":"print"},{"value":"9783031918322","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-031-91832-2_9","type":"book-chapter","created":{"date-parts":[[2025,5,7]],"date-time":"2025-05-07T04:52:00Z","timestamp":1746593520000},"page":"268-297","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Stateless Deterministic Multi-party EdDSA Signatures with\u00a0Low Communication"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6927-7855","authenticated-orcid":false,"given":"Qi","family":"Feng","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7453-4043","authenticated-orcid":false,"given":"Kang","family":"Yang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2294-3523","authenticated-orcid":false,"given":"Kaiyi","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5991-7417","authenticated-orcid":false,"given":"Xiao","family":"Wang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9278-4521","authenticated-orcid":false,"given":"Yu","family":"Yu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5044-9576","authenticated-orcid":false,"given":"Xiang","family":"Xie","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2025,5,5]]},"reference":[{"key":"9_CR1","unstructured":"Archer, D., et al.: \u2018Bristol fashion\u2019 MPC circuits. https:\/\/nigelsmart.github.io\/MPC-Circuits\/. Accessed Jan 2024"},{"key":"9_CR2","unstructured":"Brzuska, C., Couteau, G., Egger, C., Karanko, P., Meyer, P.: New random oracle instantiations from extremely lossy functions. Cryptology ePrint Archive, Paper 2023\/1145 (2023). https:\/\/eprint.iacr.org\/2023\/1145"},{"key":"9_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"489","DOI":"10.1007\/978-3-030-26954-8_16","volume-title":"Advances in Cryptology \u2013 CRYPTO 2019","author":"E Boyle","year":"2019","unstructured":"Boyle, E., Couteau, G., Gilboa, N., Ishai, Y., Kohl, L., Scholl, P.: Efficient pseudorandom correlation generators: silent OT extension and more. In: Boldyreva, A., Micciancio, D. (eds.) CRYPTO 2019. LNCS, vol. 11694, pp. 489\u2013518. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-26954-8_16"},{"key":"9_CR4","doi-asserted-by":"crossref","unstructured":"Boyle, E., Couteau, G., Gilboa, N., Ishai, Y., Kohl, L., Scholl, P.: Correlated pseudorandom functions from variable-density LPN. In: 61st FOCS, pp. 1069\u20131080, Durham, NC, USA, November\u00a016\u201319. IEEE Computer Society Press (2020)","DOI":"10.1109\/FOCS46700.2020.00103"},{"key":"9_CR5","doi-asserted-by":"publisher","unstructured":"Boyle, E., et al.: Correlated pseudorandomness from expand-accumulate codes. In: Dodis, Y., Shrimpton, T. (eds.) Advances in Cryptology \u2013 CRYPTO 2022. CRYPTO 2022. Lecture Notes in Computer Science, vol. 13508, pp. 603\u2013633. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-15979-4_21","DOI":"10.1007\/978-3-031-15979-4_21"},{"key":"9_CR6","doi-asserted-by":"crossref","unstructured":"Brendel, J., Cremers, C., Jackson, D., Zhao, M.: The provable security of Ed25519: theory and practice. In: 2021 IEEE Symposium on Security and Privacy, pp. 1659\u20131676. IEEE (2021)","DOI":"10.1109\/SP40001.2021.00042"},{"key":"9_CR7","doi-asserted-by":"publisher","unstructured":"Bellare, M., Davis, H., Di, Z.: Hardening signature schemes via derive-then-derandomize: stronger security proofs for EdDSA. In: Boldyreva, A., Kolesnikov, V. (eds.) Public-Key Cryptography \u2013 PKC 2023. PKC 2023. Lecture Notes in Computer Science, vol. 13940, pp. 223\u2013250. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-31368-4_9","DOI":"10.1007\/978-3-031-31368-4_9"},{"key":"9_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1007\/978-3-642-23951-9_9","volume-title":"Cryptographic Hardware and Embedded Systems \u2013 CHES 2011","author":"DJ Bernstein","year":"2011","unstructured":"Bernstein, D.J., Duif, N., Lange, T., Schwabe, P., Yang, B.-Y.: High-speed high-security signatures. In: Preneel, B., Takagi, T. (eds.) CHES 2011. LNCS, vol. 6917, pp. 124\u2013142. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-23951-9_9"},{"key":"9_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"368","DOI":"10.1007\/978-3-662-46800-5_15","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2015","author":"DJ Bernstein","year":"2015","unstructured":"Bernstein, D.J., et al.: SPHINCS: practical stateless hash-based signatures. In: Oswald, E., Fischlin, M. (eds.) EUROCRYPT 2015. LNCS, vol. 9056, pp. 368\u2013397. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-46800-5_15"},{"key":"9_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.) Advances in Cryptology \u2013 EUROCRYPT 2024. EUROCRYPT 2024. Lecture Notes in Computer Science, 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":"9_CR11","doi-asserted-by":"crossref","unstructured":"Bacho, R., Loss, J., Stern, G., Wagner, B.: HARTS: high-threshold, adaptively secure, and robust threshold schnorr signatures. Cryptology ePrint Archive, Paper 2024\/280 (2024). https:\/\/eprint.iacr.org\/2024\/280","DOI":"10.1007\/978-981-96-0891-1_4"},{"key":"9_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"92","DOI":"10.1007\/978-3-030-84259-8_4","volume-title":"Advances in Cryptology \u2013 CRYPTO 2021","author":"C Baum","year":"2021","unstructured":"Baum, C., Malozemoff, A.J., Rosen, M.B., Scholl, P.: $$\\sf Mac^{\\prime }n^{\\prime }Cheese$$: zero-knowledge proofs for\u00a0boolean and arithmetic circuits with\u00a0nested disjunctions. In: Malkin, T., Peikert, C. (eds.) CRYPTO 2021. LNCS, vol. 12828, pp. 92\u2013122. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-84259-8_4"},{"key":"9_CR13","unstructured":"Brand\u00e3o, L.T.A.N., Peralta, R.: NIST first call for multi-party threshold schemes (initial public draft). Technical report, National Institute of Standards and Technology (2023)"},{"issue":"6","key":"9_CR14","doi-asserted-by":"publisher","first-page":"879","DOI":"10.1007\/s10207-021-00539-6","volume":"20","author":"C Bonte","year":"2021","unstructured":"Bonte, C., Smart, N.P., Tanguy, T.: Thresholdizing HashEdDSA: MPC to the rescue. Int. J. Inf. Secur. 20(6), 879\u2013894 (2021)","journal-title":"Int. J. Inf. Secur."},{"key":"9_CR15","doi-asserted-by":"crossref","unstructured":"Canetti, R.: Universally composable security: a new paradigm for cryptographic protocols. In: 42nd FOCS, pp. 136\u2013145. IEEE (2001)","DOI":"10.1109\/SFCS.2001.959888"},{"key":"9_CR16","unstructured":"Cardano settlement layer documentation. https:\/\/cardanodocs.com\/cardano\/addresses\/. Accessed 2024"},{"key":"9_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1007\/978-3-030-26954-8_7","volume-title":"Advances in Cryptology \u2013 CRYPTO 2019","author":"G Castagnos","year":"2019","unstructured":"Castagnos, G., Catalano, D., Laguillaumie, F., Savasta, F., Tucker, I.: Two-party ECDSA from hash proof systems and efficient instantiations. In: Boldyreva, A., Micciancio, D. (eds.) CRYPTO 2019. LNCS, vol. 11694, pp. 191\u2013221. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-26954-8_7"},{"key":"9_CR18","doi-asserted-by":"publisher","unstructured":"Couteau, G., Ducros, C.: Pseudorandom correlation functions from variable-density LPN, revisited. In: Boldyreva, A., Kolesnikov, V. (eds.) Public-Key Cryptography \u2013 PKC 2023. PKC 2023. Lecture Notes in Computer Science, vol. 13941, pp. 221\u2013250. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-31371-4_8","DOI":"10.1007\/978-3-031-31371-4_8"},{"key":"9_CR19","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.) ACM CCS 2020, pp. 1769\u20131787. ACM Press (2020)","DOI":"10.1145\/3372297.3423367"},{"key":"9_CR20","doi-asserted-by":"publisher","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.) Advances in Cryptology \u2013 CRYPTO 2023. CRYPTO 2023. Lecture Notes in Computer Science, vol. 14081, pp. 743\u2013773. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-38557-5_24","DOI":"10.1007\/978-3-031-38557-5_24"},{"key":"9_CR21","doi-asserted-by":"publisher","unstructured":"Crites, E., Komlo, C., Maller, M: Fully adaptive schnorr threshold signatures. In: Handschuh, H., Lysyanskaya, A. (eds.) Advances in Cryptology \u2013 CRYPTO 2023. CRYPTO 2023. Lecture Notes in Computer Science, 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":"9_CR22","unstructured":"Decred - autonomous digital currency. https:\/\/www.decred.org\/. Accessed 2024"},{"key":"9_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1007\/3-540-48184-2_8","volume-title":"Advances in Cryptology \u2014 CRYPTO \u201987","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). https:\/\/doi.org\/10.1007\/3-540-48184-2_8"},{"key":"9_CR24","doi-asserted-by":"crossref","unstructured":"Doerner, J., Kondi, Y., Lee, E., Shelat, A.: Secure two-party threshold ECDSA from ECDSA assumptions. In: 2018 IEEE Symposium on Security and Privacy, pp. 980\u2013997. IEEE (2018)","DOI":"10.1109\/SP.2018.00036"},{"key":"9_CR25","doi-asserted-by":"crossref","unstructured":"Doerner, J., Kondi, Y., Lee, E., Shelat, A.: Threshold ECDSA from ECDSA assumptions: the multiparty case. In: 2019 IEEE Symposium on Security and Privacy, pp. 1051\u20131066. IEEE (2019)","DOI":"10.1109\/SP.2019.00024"},{"key":"9_CR26","doi-asserted-by":"crossref","unstructured":"Doerner, J., Kondi, Y., Lee, E., Shelat, A.: Threshold ECDSA in three rounds. In: 2024 IEEE Symposium on Security and Privacy (S &P). IEEE (2024)","DOI":"10.1109\/SP54263.2024.00178"},{"key":"9_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"823","DOI":"10.1007\/978-3-030-56880-1_29","volume-title":"Advances in Cryptology \u2013 CRYPTO 2020","author":"D Escudero","year":"2020","unstructured":"Escudero, D., Ghosh, S., Keller, M., Rachuri, R., Scholl, P.: Improved primitives for MPC over mixed arithmetic-binary circuits. In: Micciancio, D., Ristenpart, T. (eds.) CRYPTO 2020. LNCS, vol. 12171, pp. 823\u2013852. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-56880-1_29"},{"key":"9_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"186","DOI":"10.1007\/3-540-47721-7_12","volume-title":"Advances in Cryptology \u2014 CRYPTO\u2019 86","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). https:\/\/doi.org\/10.1007\/3-540-47721-7_12"},{"key":"9_CR29","doi-asserted-by":"crossref","unstructured":"Gennaro, R., Goldfeder, S.: Fast multiparty threshold ECDSA with fast trustless setup. In: Lie, D., Mannan, M., Backes, M., Wang, X. (eds.) ACM CCS 2018, pp. 1179\u20131194. ACM Press (2018)","DOI":"10.1145\/3243734.3243859"},{"key":"9_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"354","DOI":"10.1007\/3-540-68339-9_31","volume-title":"Advances in Cryptology \u2014 EUROCRYPT \u201996","author":"R Gennaro","year":"1996","unstructured":"Gennaro, R., Jarecki, S., Krawczyk, H., Rabin, T.: Robust threshold DSS signatures. In: Maurer, U. (ed.) EUROCRYPT 1996. LNCS, vol. 1070, pp. 354\u2013371. Springer, Heidelberg (1996). https:\/\/doi.org\/10.1007\/3-540-68339-9_31"},{"key":"9_CR31","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":"9_CR32","unstructured":"Hyperledger - open source blockchain technologies. https:\/\/www.hyperledger.org\/. Accessed 2024"},{"key":"9_CR33","doi-asserted-by":"crossref","unstructured":"Jawurek, M., Kerschbaum, F., Orlandi, C.: Zero-knowledge using garbled circuits: how to prove non-algebraic statements efficiently. In: Sadeghi, A.R., Gligor, V.D., Yung, M. (eds.) ACM CCS 2013, pp. 955\u2013966. ACM Press (2013)","DOI":"10.1145\/2508859.2516662"},{"key":"9_CR34","doi-asserted-by":"crossref","unstructured":"Josefsson, S., Liusvaara, I.: Edwards-curve digital signature algorithm (EdDSA). In: Internet Research Task Force, Crypto Forum Research Group, RFC, vol. 8032 (2017)","DOI":"10.17487\/RFC8032"},{"key":"9_CR35","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":"9_CR36","unstructured":"Komlo, C., Goldberg, I.: Arctic: lightweight and stateless threshold schnorr signatures. Cryptology ePrint Archive, Paper 2024\/466. https:\/\/eprint.iacr.org\/2024\/466 (2024)"},{"key":"9_CR37","doi-asserted-by":"publisher","unstructured":"Kondi, Y., Orlandi, C., Roy, L.: Two-round stateless deterministic two-party schnorr signatures from pseudorandom correlation functions. In: Handschuh, H., Lysyanskaya, A. (eds.) Advances in Cryptology \u2013 CRYPTO 2023. CRYPTO 2023. Lecture Notes in Computer Science, vol. 14081, pp. 646\u2013677. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-38557-5_21","DOI":"10.1007\/978-3-031-38557-5_21"},{"key":"9_CR38","doi-asserted-by":"crossref","unstructured":"Keller, M., Orsini, E., Scholl, P.: MASCOT: faster malicious arithmetic secure computation with oblivious transfer. In: Weippl, E.R., Katzenbeisser, S., Kruegel, C., Myers, A.C., Halevi, S. (eds.) ACM CCS 2016, pp. 830\u2013842. ACM Press (2016)","DOI":"10.1145\/2976749.2978357"},{"key":"9_CR39","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"613","DOI":"10.1007\/978-3-319-63715-0_21","volume-title":"Advances in Cryptology \u2013 CRYPTO 2017","author":"Y Lindell","year":"2017","unstructured":"Lindell, Y.: Fast secure two-party ECDSA signing. In: Katz, J., Shacham, H. (eds.) CRYPTO 2017. LNCS, vol. 10402, pp. 613\u2013644. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-63715-0_21"},{"key":"9_CR40","doi-asserted-by":"crossref","unstructured":"Lindell, Y., Nof, A.: Fast secure multiparty ECDSA with practical distributed key generation and applications to cryptocurrency custody. In: Lie, D., Mannan, M., Backes, M., Wang, X. (eds.) ACM CCS 2018, pp. 1837\u20131854. ACM Press (2018)","DOI":"10.1145\/3243734.3243788"},{"key":"9_CR41","doi-asserted-by":"crossref","unstructured":"Micali, S., Ohta, K., Reyzin, L.: Accountable-subgroup multisignatures: extended abstract. In: Reiter, M.K., Samarati, P. (eds.) ACM CCS 2001, pp. 245\u2013254. ACM Press (2001)","DOI":"10.1145\/501983.502017"},{"issue":"9","key":"9_CR42","first-page":"2139","volume":"87","author":"G Maxwell","year":"2019","unstructured":"Maxwell, G., Poelstra, A., Seurin, Y., Wuille, P.: Simple schnorr multi-signatures with applications to bitcoin. DCC 87(9), 2139\u20132164 (2019)","journal-title":"DCC"},{"key":"9_CR43","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1007\/3-540-44647-8_8","volume-title":"Advances in Cryptology \u2014 CRYPTO 2001","author":"P MacKenzie","year":"2001","unstructured":"MacKenzie, P., Reiter, M.K.: Two-party generation of DSA signatures. In: Kilian, J. (ed.) CRYPTO 2001. LNCS, vol. 2139, pp. 137\u2013154. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-44647-8_8"},{"key":"9_CR44","doi-asserted-by":"crossref","unstructured":"National Institute of Standards and Technology (NIST). FIPS PUB 186-5 (Draft): Digital Signature Standard (DSS). https:\/\/doi.org\/10.6028\/NIST.FIPS.186-5 (2019)","DOI":"10.6028\/NIST.FIPS.186-5"},{"key":"9_CR45","doi-asserted-by":"crossref","unstructured":"Nick, J., Ruffing, T., Seurin, Y., Wuille, P.: MuSig-DN: schnorr multi-signatures with verifiably deterministic nonces. In: Ligatti, J., Ou, X., Katz, J., Vigna, G., (eds.) ACM CCS 2020, pp. 1717\u20131731. ACM Press (2020)","DOI":"10.1145\/3372297.3417236"},{"key":"9_CR46","doi-asserted-by":"crossref","unstructured":"Parno, B., Lorch, J.R., Douceur, J.R., Mickens, J.W., McCune, J.M.: Memoir: practical state continuity for protected modules. In: 2011 IEEE Symposium on Security and Privacy, pp. 379\u2013394. IEEE (2011)","DOI":"10.1109\/SP.2011.38"},{"key":"9_CR47","doi-asserted-by":"publisher","unstructured":"Qiu, Z., Yang, K., Yu, Y., Zhou, L.: Maliciously secure multi-party PSI with lower bandwidth and faster computation. In: Alcaraz, C., Chen, L., Li, S., Samarati, P. (eds.) Information and Communications Security. ICICS 2022. Lecture Notes in Computer Science, vol. 13407, pp. 69\u201388. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-15777-6_5","DOI":"10.1007\/978-3-031-15777-6_5"},{"key":"9_CR48","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"},{"key":"9_CR49","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BFb0054113","volume-title":"Advances in Cryptology \u2014 EUROCRYPT\u201998","author":"V Shoup","year":"1998","unstructured":"Shoup, V., Gennaro, R.: Securing threshold cryptosystems against chosen ciphertext attack. In: Nyberg, K. (ed.) EUROCRYPT 1998. LNCS, vol. 1403, pp. 1\u201316. Springer, Heidelberg (1998). https:\/\/doi.org\/10.1007\/BFb0054113"},{"key":"9_CR50","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1007\/3-540-45539-6_15","volume-title":"Advances in Cryptology \u2014 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). https:\/\/doi.org\/10.1007\/3-540-45539-6_15"},{"key":"9_CR51","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"342","DOI":"10.1007\/978-3-030-35199-1_17","volume-title":"Cryptography and Coding","author":"NP Smart","year":"2019","unstructured":"Smart, N.P., Talibi Alaoui, Y.: Distributing any elliptic curve based protocol. In: Albrecht, M. (ed.) IMACC 2019. LNCS, vol. 11929, pp. 342\u2013366. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-35199-1_17"},{"key":"9_CR52","unstructured":"Stellar developer - security. https:\/\/www.stellar.org\/developers\/guides\/security.html. Accessed 2024"},{"key":"9_CR53","doi-asserted-by":"crossref","unstructured":"Xue, H., Au, M.H., Xie, X., Yuen, T.H., Cui, H.: Efficient online-friendly two-party ECDSA signature. In: Vigna, G., Shi, E. (eds.) ACM CCS 2021, pp. 558\u2013573. ACM Press (2021)","DOI":"10.1145\/3460120.3484803"},{"key":"9_CR54","unstructured":"Switch to Ed25519 for cryptographic binding of joinsplits to transactions. https:\/\/github.com\/ebfull\/zcash\/commit\/320f2cc7e032d4047b99ab8bf7714cb8b69df8e0. Accessed 2024"}],"container-title":["Lecture Notes in Computer Science","Public-Key Cryptography \u2013 PKC 2025"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-91832-2_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,7]],"date-time":"2025-05-07T04:52:20Z","timestamp":1746593540000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-91832-2_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9783031918315","9783031918322"],"references-count":54,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-91832-2_9","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":"5 May 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"PKC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"IACR International Conference on Public-Key Cryptography","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"R\u00f8ros","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Norway","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":"12 May 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 May 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"pkc2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/pkc.iacr.org\/2025\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}