{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,13]],"date-time":"2026-01-13T21:41:31Z","timestamp":1768340491067,"version":"3.49.0"},"publisher-location":"Cham","reference-count":69,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031865985","type":"print"},{"value":"9783031865992","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-86599-2_6","type":"book-chapter","created":{"date-parts":[[2025,3,24]],"date-time":"2025-03-24T18:58:15Z","timestamp":1742842695000},"page":"165-198","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Share the\u00a0MAYO: Thresholdizing MAYO"],"prefix":"10.1007","author":[{"given":"Sofia","family":"Celi","sequence":"first","affiliation":[]},{"given":"Daniel","family":"Escudero","sequence":"additional","affiliation":[]},{"given":"Guilhem","family":"Niot","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,3,15]]},"reference":[{"key":"6_CR1","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":"6_CR2","unstructured":"Adrian, D.: Post-quantum cryptography is too damn big. Personal blogpost. (2024). https:\/\/dadrian.io\/blog\/posts\/pqcsignatures-2024\/"},{"key":"6_CR3","doi-asserted-by":"crossref","unstructured":"Alagic, G., et al.: Status Report on the First Round of the Additional Digital Signature Schemes for the NIST Post-Quantum Cryptography Standardization Process. National Institute of Standards and Technology (2024). https:\/\/doi.org\/10.6028\/NIST.IR.8528","DOI":"10.6028\/NIST.IR.8528"},{"key":"6_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"382","DOI":"10.1007\/978-3-030-88238-9_19","volume-title":"Progress in Cryptology \u2013 LATINCRYPT 2021","author":"DF Aranha","year":"2021","unstructured":"Aranha, D.F., Dalskov, A., Escudero, D., Orlandi, C.: Improved threshold signatures, proactive secret sharing, and input certification from LSS isomorphisms. In: Longa, P., R\u00e0fols, C. (eds.) LATINCRYPT 2021. LNCS, vol. 12912, pp. 382\u2013404. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-88238-9_19"},{"key":"6_CR5","doi-asserted-by":"publisher","unstructured":"Agrawal, S., Stehl\u00e9, D., Yadav, A.: Round-optimal lattice-based threshold signatures, revisited. In: Bojanczyk, M., Merelli, E., Woodruff, D.P. (eds.) ICALP 2022, vol. 229. LIPIcs. Schloss Dagstuhl, July 2022, pp. 8:1\u20138:20 (2022). https:\/\/doi.org\/10.4230\/LIPIcs.ICALP.2022.8","DOI":"10.4230\/LIPIcs.ICALP.2022.8"},{"key":"6_CR6","doi-asserted-by":"crossref","unstructured":"Aulbach, T., Campos, F., Kr\u00e4mer, J., Samardjiska, S., St\u00f6ttinger, M.: Separating oil and vinegar with a single trace. Cryptology ePrint Archive, Report 2023\/335 (2023). https:\/\/eprint.iacr.org\/2023\/335","DOI":"10.46586\/tches.v2023.i3.221-245"},{"key":"6_CR7","doi-asserted-by":"publisher","unstructured":"Aulbach, T., Campos, F., Kr\u00e4mer, J., Samardjiska, S., St\u00f6ttinger, M.: Separating oil and vinegar with a single trace side-channel assisted Kipnis-Shamir attack on UOV. In: IACR TCHES 2023.3, pp. 221\u2013245 (2023). https:\/\/doi.org\/10.46586\/tches.v2023.i3.221-245","DOI":"10.46586\/tches.v2023.i3.221-245"},{"key":"6_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"420","DOI":"10.1007\/3-540-46766-1_34","volume-title":"Advances in Cryptology \u2014 CRYPTO 1991","author":"D Beaver","year":"1992","unstructured":"Beaver, D.: Efficient multiparty protocols using circuit randomization. In: Feigenbaum, J. (ed.) CRYPTO 1991. LNCS, vol. 576, pp. 420\u2013432. Springer, Heidelberg (1992). https:\/\/doi.org\/10.1007\/3-540-46766-1_34"},{"key":"6_CR9","unstructured":"Beullens, W.: Improved Cryptanalysis of UOV and Rainbow. Cryptology ePrint Archive, Report 2020\/1343 (2020). https:\/\/eprint.iacr.org\/2020\/1343"},{"key":"6_CR10","unstructured":"Beullens, W.: MAYO: practical post-quantum signatures from oil-and-vinegar maps. Cryptology ePrint Archive, Report 2021\/1144 (2021). https:\/\/eprint.iacr.org\/2021\/1144"},{"key":"6_CR11","unstructured":"Beullens, W., Campos, F., Celi, S., Hess, B., Kannwischer, M.J.: MAYO. Technical report. National Institute of Standards and Technology (2023). https:\/\/csrc.nist.gov\/Projects\/pqc-dig-sig\/round-1-additional-signatures"},{"key":"6_CR12","unstructured":"Beullens, W., et al.: UOV - Unbalanced Oil and Vinegar. Technical report. National Institute of Standards and Technology (2023). https:\/\/csrc.nist.gov\/Projects\/pqc-dig-sig\/round-1-additional-signatures"},{"key":"6_CR13","doi-asserted-by":"publisher","unstructured":"Beullens, W., et al.: Oil and vinegar: modern parameters and implementations. In: IACR TCHES 2023.3, pp. 321\u2013365 (2023). https:\/\/doi.org\/10.46586\/tches.v2023.i3.321-365","DOI":"10.46586\/tches.v2023.i3.321-365"},{"key":"6_CR14","unstructured":"Beullens, W.: Improved cryptanalysis of SNOVA. Cryptology ePrint Archive, Paper 2024\/1297 (2024). https:\/\/eprint.iacr.org\/2024\/1297"},{"key":"6_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"438","DOI":"10.1007\/978-3-319-98989-1_22","volume-title":"Computer Security","author":"M Blanton","year":"2018","unstructured":"Blanton, M., Jeong, M.: Improved signature schemes for secure multi-party computation with certified inputs. In: Lopez, J., Zhou, J., Soriano, M. (eds.) ESORICS 2018. Lecture Notes in Computer Science, vol. 11099, pp. 438\u2013460. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-98989-1_22"},{"key":"6_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"218","DOI":"10.1007\/978-3-642-38980-1_14","volume-title":"Applied Cryptography and Network Security","author":"R Bendlin","year":"2013","unstructured":"Bendlin, R., Krehbiel, S., Peikert, C.: How to share a lattice trapdoor: threshold protocols for signatures and (H)IBE. In: Jacobson, M., Locasto, M., Mohassel, P., Safavi-Naini, R. (eds.) ACNS 2013. LNCS, vol. 7954, pp. 218\u2013236. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-38980-1_14"},{"key":"6_CR17","doi-asserted-by":"crossref","unstructured":"Blokh, C., Makriyannis, N., Peled, U.: Efficient asymmetric threshold ECDSA for MPC-based cold storage. Cryptology ePrint Archive, Paper 2022\/1296 (2022). https:\/\/eprint.iacr.org\/2022\/1296","DOI":"10.1149\/MA2022-02361296mtgabs"},{"key":"6_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1007\/3-540-36288-6_3","volume-title":"Public Key Cryptography \u2014 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.G. (ed.) PKC 2003. LNCS, vol. 2567, pp. 31\u201346. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/3-540-36288-6_3"},{"key":"6_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1007\/978-3-030-26954-8_3","volume-title":"Advances in Cryptology \u2013 CRYPTO 2019","author":"D Boneh","year":"2019","unstructured":"Boneh, D., Boyle, E., Corrigan-Gibbs, H., Gilboa, N., Ishai, Y.: Zero-knowledge proofs on secret-shared data via fully linear PCPs. In: Boldyreva, A., Micciancio, D. (eds.) CRYPTO 2019. LNCS, vol. 11694, pp. 67\u201397. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-26954-8_3"},{"key":"6_CR20","unstructured":"Boschini, C., Kaviani, D., Lai, R.W.F., Malavolta, G., Takahashi, A., Tibouchi, M.: Ringtail: practical two-round threshold signatures from learning with errors. cryptology ePrint Archive, Paper 2024\/1113 (2024). https:\/\/eprint.iacr.org\/2024\/1113"},{"key":"6_CR21","unstructured":"Cabarcas, D., Li, P., Verbel, J., Villanueva-Polanco, R.: Improved Attacks for SNOVA by Exploiting Stability under a Group Action. Cryptology ePrint Archive, Paper 2024\/1770 (2024). https:\/\/eprint.iacr.org\/2024\/1770"},{"key":"6_CR22","doi-asserted-by":"publisher","unstructured":"Canetti, R.: Universally composable security: a new paradigm for cryptographic protocols. In: 42nd FOCS, pp. 136\u2013145. IEEE Computer Society Press, October 2001. https:\/\/doi.org\/10.1109\/SFCS.2001.959888","DOI":"10.1109\/SFCS.2001.959888"},{"key":"6_CR23","doi-asserted-by":"crossref","unstructured":"Canetti, R., Lindell, Y., Ostrovsky, R., Sahai, A.: Universally composable two-party and multi-party secure computation. Cryptology ePrint Archive, Report 2002\/140 (2002). https:\/\/eprint.iacr.org\/2002\/140","DOI":"10.1145\/509978.509980"},{"key":"6_CR24","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":"6_CR25","doi-asserted-by":"publisher","unstructured":"Chatterjee, S., Laxman Das, M.P., Pandit, T.: Revisiting the security of salted UOV signature. In: Isobe, T., Sarkar, S. (eds.) INDOCRYPT 2022, Vol. 13774, pp. 697\u2013719. LNCS. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-22912-1_31","DOI":"10.1007\/978-3-031-22912-1_31"},{"key":"6_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1007\/978-3-030-64840-4_2","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2020","author":"H Chen","year":"2020","unstructured":"Chen, H., Kim, M., Razenshteyn, I., Rotaru, D., Song, Y., Wagh, S.: Maliciously secure matrix multiplication with applications to private deep learning. In: Moriai, S., Wang, H. (eds.) ASIACRYPT 2020. LNCS, vol. 12493, pp. 31\u201359. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-64840-4_2"},{"key":"6_CR27","unstructured":"Cogliati, B., Fouque, P.-A., Goubin, L., Minaud, B.: New security proofs and techniques for hash-and-sign with retry signature schemes. Cryptology ePrint Archive, Paper 2024\/609 (2024). https:\/\/eprint.iacr.org\/2024\/609"},{"key":"6_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"128","DOI":"10.1007\/978-3-030-35199-1_7","volume-title":"Cryptography and Coding","author":"D Cozzo","year":"2019","unstructured":"Cozzo, D., Smart, N.P.: Sharing the LUOV: threshold post-quantum signatures. In: Albrecht, M. (ed.) IMACC 2019. LNCS, vol. 11929, pp. 128\u2013153. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-35199-1_7"},{"key":"6_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"375","DOI":"10.1007\/0-387-34799-2_29","volume-title":"Advances in Cryptology \u2014 CRYPTO 1988","author":"Y Desmedt","year":"1990","unstructured":"Desmedt, Y.: Abuses in cryptography and how to fight them. In: Goldwasser, S. (ed.) CRYPTO 1988. LNCS, vol. 403, pp. 375\u2013389. Springer, New York (1990). https:\/\/doi.org\/10.1007\/0-387-34799-2_29"},{"key":"6_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1007\/0-387-34805-0_28","volume-title":"Advances in Cryptology \u2014 CRYPTO 1989 Proceedings","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). https:\/\/doi.org\/10.1007\/0-387-34805-0_28"},{"key":"6_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1007\/978-3-030-45388-6_7","volume-title":"Public-Key Cryptography \u2013 PKC 2020","author":"L De Feo","year":"2020","unstructured":"De Feo, L., Meyer, M.: Threshold schemes from isogeny assumptions. In: Kiayias, A., Kohlweiss, M., Wallden, P., Zikas, V. (eds.) PKC 2020. LNCS, vol. 12111, pp. 187\u2013212. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-45388-6_7"},{"key":"6_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"572","DOI":"10.1007\/978-3-540-74143-5_32","volume-title":"Advances in Cryptology - CRYPTO 2007","author":"I Damg\u00e5rd","year":"2007","unstructured":"Damg\u00e5rd, I., Nielsen, J.B.: Scalable and unconditionally secure multiparty computation. In: Menezes, A. (ed.) CRYPTO 2007. LNCS, vol. 4622, pp. 572\u2013590. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-74143-5_32"},{"key":"6_CR33","doi-asserted-by":"publisher","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. IEEE Computer Society Press, pp. 980\u2013997, May 2018. https:\/\/doi.org\/10.1109\/SP.2018.00036","DOI":"10.1109\/SP.2018.00036"},{"key":"6_CR34","doi-asserted-by":"publisher","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 Computer Society Press, May 2019. https:\/\/doi.org\/10.1109\/SP.2019.00024","DOI":"10.1109\/SP.2019.00024"},{"key":"6_CR35","unstructured":"Doerner, J., Kondi, Y., Lee, E., Shelat, A.: Threshold ECDSA in three rounds. Cryptology ePrint Archive, Paper 2023\/765 (2023). https:\/\/eprint.iacr.org\/2023\/765"},{"key":"6_CR36","doi-asserted-by":"crossref","unstructured":"Espitau, T., Niot, G., Prest, T.: Flood and submerse: distributed key generation and robust threshold signature from lattices. Cryptology ePrint Archive, Paper 2024\/959 (2024). https:\/\/eprint.iacr.org\/2024\/959","DOI":"10.1007\/978-3-031-68394-7_14"},{"key":"6_CR37","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"},{"issue":"1","key":"6_CR38","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1007\/s00145-006-0347-3","volume":"20","author":"R Gennaro","year":"2006","unstructured":"Gennaro, R., Jarecki, S., Krawczyk, H., Rabin, T.: Secure distributed key generation for discrete-log based cryptosystems. J. Cryptol. 20(1), 51\u201383 (2006). https:\/\/doi.org\/10.1007\/s00145-006-0347-3","journal-title":"J. Cryptol."},{"key":"6_CR39","unstructured":"Gennaro, R., Goldfeder, S.: Fast Multiparty threshold ECDSA with fast trustless setup. Cryptology ePrint Archive, Report 2019\/114 (2019). https:\/\/eprint.iacr.org\/2019\/114"},{"key":"6_CR40","doi-asserted-by":"crossref","unstructured":"Gennaro, R., Goldfeder, S., Narayanan, A.: Threshold optimal DSA\/ECDSA signatures and an application to Bitcoin wallet security. Cryptology ePrint Archive, Report 2016\/013 (2016). https:\/\/eprint.iacr.org\/2016\/013","DOI":"10.1007\/978-3-319-39555-5_9"},{"key":"6_CR41","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability; A Guide to the Theory of NP-Completeness. W. H. Freeman & Co., USA (1990). ISBN: 0716710455"},{"key":"6_CR42","unstructured":"Katz, J.: Round optimal fully secure distributed key generation. Cryptology ePrint Archive, Paper 2023\/1094 (2023). https:\/\/eprint.iacr.org\/2023\/1094"},{"key":"6_CR43","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":"6_CR44","doi-asserted-by":"publisher","unstructured":"Khaburzaniya, I., Chalkias, K., Lewi, K., Malvai, H.: Aggregating and thresholdizing hash-based signatures using STARKs. In: Suga, Y., Sakurai, K., Ding, X., Sako, K. ASIACCS 2022, pp. 393\u2013407. ACM Press (2022). https:\/\/doi.org\/10.1145\/3488932.3524128","DOI":"10.1145\/3488932.3524128"},{"key":"6_CR45","doi-asserted-by":"publisher","unstructured":"Kondi, Y., Magri, B., Orlandi, C., Shlomovits, O.: Refresh When you wake up: proactive threshold wallets with offline devices. In: 2021 IEEE Symposium on Security and Privacy, pp. 608\u2013625. IEEE Computer Society Press, May 2021. https:\/\/doi.org\/10.1109\/SP40001.2021.00067","DOI":"10.1109\/SP40001.2021.00067"},{"key":"6_CR46","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"206","DOI":"10.1007\/3-540-48910-X_15","volume-title":"Advances in Cryptology \u2014 EUROCRYPT 1999","author":"A Kipnis","year":"1999","unstructured":"Kipnis, A., Patarin, J., Goubin, L.: Unbalanced oil and vinegar signature schemes. In: Stern, J. (ed.) EUROCRYPT 1999. LNCS, vol. 1592, pp. 206\u2013222. Springer, Heidelberg (1999). https:\/\/doi.org\/10.1007\/3-540-48910-X_15"},{"key":"6_CR47","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1007\/BFb0055733","volume-title":"Advances in Cryptology \u2014 CRYPTO 1998","author":"A Kipnis","year":"1998","unstructured":"Kipnis, A., Shamir, A.: Cryptanalysis of the oil and vinegar signature scheme. In: Krawczyk, H. (ed.) CRYPTO 1998. LNCS, vol. 1462, pp. 257\u2013266. Springer, Heidelberg (1998). https:\/\/doi.org\/10.1007\/BFb0055733"},{"key":"6_CR48","unstructured":"Kosuge, H., Xagawa, K.: Probabilistic hash-and-sign with retry in the quantum random oracle model. Cryptology ePrint Archive, Paper 2022\/1359 (2022). https:\/\/eprint.iacr.org\/2022\/1359"},{"key":"6_CR49","doi-asserted-by":"publisher","unstructured":"Kosuge, H., Xagawa, K.: Probabilistic hash-and-sign with retry in the quantum random oracle model. In: Tang, Q., Teague, V. (eds.) PKC 2024, Part I, vol. 14601. LNCS, pp. 259\u2013288. Springer, Cham (2024). https:\/\/doi.org\/10.1007\/978-3-031-57718-5_9","DOI":"10.1007\/978-3-031-57718-5_9"},{"key":"6_CR50","unstructured":"Yehuda Lindell. Secure Multiparty Computation (MPC). Cryptology ePrint Archive, Report 2020\/300. https:\/\/eprint.iacr.org\/2020\/300. 2020"},{"key":"6_CR51","doi-asserted-by":"publisher","unstructured":"Lindell, Y.: Simple Three-Round Multiparty Schnorr Signing with Full Simulatability. In: CiC 1.1, p. 25 (2024). doi: https:\/\/doi.org\/10.62056\/a36c0l5vt","DOI":"10.62056\/a36c0l5vt"},{"key":"6_CR52","doi-asserted-by":"crossref","unstructured":"Lindell, Y., Nof, A., Ranellucci, S.: Fast secure multiparty ECDSA with practical distributed key generation and applications to cryptocurrency custody. Cryptology ePrint Archive, Report 2018\/987 (2018). https:\/\/eprint.iacr.org\/2018\/987","DOI":"10.1145\/3243734.3243788"},{"key":"6_CR53","unstructured":"Makriyannis, N.: On the classic protocol for MPC Schnorr signatures. Cryptology ePrint Archive, Paper 2022\/1332 (2022). https:\/\/eprint.iacr.org\/2022\/1332"},{"key":"6_CR54","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"419","DOI":"10.1007\/3-540-45961-8_39","volume-title":"Advances in Cryptology \u2014 EUROCRYPT 1988","author":"T Matsumoto","year":"1988","unstructured":"Matsumoto, T., Imai, H.: Public quadratic polynomial-tuples for efficient signature-verification and message-encryption. In: Barstow, D., Brauer, W., Brinch Hansen, P., Gries, D., Luckham, D., Moler, C., Pnueli, A., Seegm\u00fcller, G., Stoer, J., Wirth, N., G\u00fcnther, C.G. (eds.) EUROCRYPT 1988. LNCS, vol. 330, pp. 419\u2013453. Springer, Heidelberg (1988). https:\/\/doi.org\/10.1007\/3-540-45961-8_39"},{"key":"6_CR55","doi-asserted-by":"publisher","unstructured":"Mohassel, P., Zhang, Y.: SecureML: a system for scalable privacy-preserving machine learning. In: 2017 IEEE Symposium on Security and Privacy, pp. 19\u201338. IEEE Computer Society Press, May 2017. https:\/\/doi.org\/10.1109\/SP.2017.12","DOI":"10.1109\/SP.2017.12"},{"key":"6_CR56","unstructured":"NIST Computer Security Division. Post-Quantum Cryptography: Digital Signature Schemes (2022). https:\/\/csrc.nist.gov\/projects\/ pqc-dig-sig"},{"key":"6_CR57","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1007\/3-540-39568-7_4","volume-title":"Advances in Cryptology","author":"H Ong","year":"1985","unstructured":"Ong, H., Schnorr, C.P., Shamir, A.: Efficient signature schemes based on polynomial equations (preliminary version). In: Blakley, G.R., Chaum, D. (eds.) CRYPTO 1984. LNCS, vol. 196, pp. 37\u201346. Springer, Heidelberg (1985). https:\/\/doi.org\/10.1007\/3-540-39568-7_4"},{"key":"6_CR58","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"248","DOI":"10.1007\/3-540-44750-4_20","volume-title":"Advances in Cryptology \u2014 CRYPT0 1995","author":"J Patarin","year":"1995","unstructured":"Patarin, J.: Cryptanalysis of the Matsumoto and Imai public key scheme of Eurocrypt\u2019 88. In: Coppersmith, D. (ed.) CRYPTO 1995. LNCS, vol. 963, pp. 248\u2013261. Springer, Heidelberg (1995). https:\/\/doi.org\/10.1007\/3-540-44750-4_20"},{"key":"6_CR59","unstructured":"Patarin, J.: The Oil and Vinegar signature scheme. In: Dagstuhl Workshop on Cryptography (1997)"},{"key":"6_CR60","doi-asserted-by":"crossref","unstructured":"Peralta, R., Brand\u00e3o, L.: NIST first call for multiparty threshold schemes. National Institute of Standards and Technology (2023). https:\/\/nvlpubs.nist.gov\/nistpubs\/ir\/2023\/NIST. IR.8214C.ipd.pdf","DOI":"10.6028\/NIST.IR.8214C.ipd"},{"key":"6_CR61","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 2024 Part II, vol. 14652. LNCS, 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":"6_CR62","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1007\/978-3-319-29485-8_7","volume-title":"Topics in Cryptology - CT-RSA 2016","author":"D Pointcheval","year":"2016","unstructured":"Pointcheval, D., Sanders, O.: Short randomizable signatures. In: Sako, K. (ed.) CT-RSA 2016. LNCS, vol. 9610, pp. 111\u2013126. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-29485-8_7"},{"key":"6_CR63","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. ACM CCS 2022, pp. 2551\u20132564. ACM Press (2022). https:\/\/doi.org\/10.1145\/3548606.3560583","DOI":"10.1145\/3548606.3560583"},{"key":"6_CR64","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":"6_CR65","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1007\/978-3-642-25405-5_5","volume-title":"Post-Quantum Cryptography","author":"K Sakumoto","year":"2011","unstructured":"Sakumoto, K., Shirai, T., Hiwatari, H.: On provable security of UOV and HFE signature schemes against chosen-message attack. In: Yang, B.-Y. (ed.) PQCrypto 2011. LNCS, vol. 7071, pp. 68\u201382. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-25405-5_5"},{"key":"6_CR66","unstructured":"Wang, L.-C., et al.: SNOVA. Technical report. National Institute of Standards and Technology (2023). https:\/\/csrc.nist.gov\/Projects\/pqc-dig-sig\/round-1-additional-signatures"},{"key":"6_CR67","unstructured":"Westerbaan, B.: The state of the post-quantum Internet. Cloudflare blogpost (2024). https:\/\/blog.cloudflare.com\/pq-2024\/"},{"key":"6_CR68","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1007\/978-3-540-30598-9_19","volume-title":"Security in Communication Networks","author":"D Wikstr\u00f6m","year":"2005","unstructured":"Wikstr\u00f6m, D.: Universally composable DKG with linear number of exponentiations. In: Blundo, C., Cimato, S. (eds.) SCN 2004. LNCS, vol. 3352, pp. 263\u2013277. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/978-3-540-30598-9_19"},{"key":"6_CR69","doi-asserted-by":"publisher","unstructured":"Yao, A.C.-C.: Protocols for secure computations (extended abstract). In: 23rd FOCS, pp. 160\u2013164. IEEE Computer Society Press, November 1982. https:\/\/doi.org\/10.1109\/SFCS198238","DOI":"10.1109\/SFCS198238"}],"container-title":["Lecture Notes in Computer Science","Post-Quantum Cryptography"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-86599-2_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,24]],"date-time":"2025-03-24T18:58:36Z","timestamp":1742842716000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-86599-2_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9783031865985","9783031865992"],"references-count":69,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-86599-2_6","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":"15 March 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"PQCrypto","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Post-Quantum Cryptography","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Taipei","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Taiwan","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":"9 April 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 April 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"pqcrypto2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/pqcrypto2025.iis.sinica.edu.tw\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}