{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,9]],"date-time":"2026-07-09T01:57:58Z","timestamp":1783562278563,"version":"3.55.0"},"reference-count":68,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2024,7,10]],"date-time":"2024-07-10T00:00:00Z","timestamp":1720569600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2024,7,10]],"date-time":"2024-07-10T00:00:00Z","timestamp":1720569600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100002301","name":"Estonian Research Council","doi-asserted-by":"crossref","award":["PRG1780"],"award-info":[{"award-number":["PRG1780"]}],"id":[{"id":"10.13039\/501100002301","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Discov Computing"],"abstract":"<jats:title>Abstract<\/jats:title>\n                  <jats:p>\n                    The development of threshold protocols based on lattice-signature schemes has been of increasing interest in the past several years. The main research focus has been towards protocols constructed for various variants of Crystals-Dilithium, future NIST digital signature standard known as ML-DSA. In this work, we propose TOPCOAT, a two-party lattice-based signature algorithm that embodies Dilithium\u2019s compression techniques. The aforesaid result is achieved by introducing a new hinting mechanism that allows parties to collaboratively calculate\n                    <jats:inline-formula>\n                      <jats:alternatives>\n                        <jats:tex-math>$$\\textsf {HighBits}$$<\/jats:tex-math>\n                        <mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                          <mml:mi>HighBits<\/mml:mi>\n                        <\/mml:math>\n                      <\/jats:alternatives>\n                    <\/jats:inline-formula>\n                    . Our hinting mechanism allows public key compression similar to Dilithium. Additionally, we suggest an optimization technique to minimize number of restarts both parties need to produce a valid signature. Our approach allows to produce\n                    <jats:inline-formula>\n                      <jats:alternatives>\n                        <jats:tex-math>$$\\approx 10$$<\/jats:tex-math>\n                        <mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                          <mml:mrow>\n                            <mml:mo>\u2248<\/mml:mo>\n                            <mml:mn>10<\/mml:mn>\n                          <\/mml:mrow>\n                        <\/mml:math>\n                      <\/jats:alternatives>\n                    <\/jats:inline-formula>\n                    KB signatures within 3 rounds of communication. We prove security of our scheme under MLWE and MSIS assumptions in ROM, and provide implementation of our proposed scheme. As additional contribution, we present vulnerabilities and inconsistencies found in Liu et al. work (Future Generation Computer Systems\u00a02023)\u00a0which aimed to construct distributed lattice-based signature protocol.\n                  <\/jats:p>","DOI":"10.1007\/s10791-024-09449-2","type":"journal-article","created":{"date-parts":[[2024,7,10]],"date-time":"2024-07-10T06:01:42Z","timestamp":1720591302000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["TOPCOAT: towards practical two-party Crystals-Dilithium"],"prefix":"10.1007","volume":"27","author":[{"given":"Nikita","family":"Snetkov","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jelizaveta","family":"Vakarjuk","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Peeter","family":"Laud","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2024,7,10]]},"reference":[{"key":"9449_CR1","doi-asserted-by":"publisher","unstructured":"Abram D, Nof A, Orlandi C, Scholl P, Shlomovits O. Low-bandwidth threshold ECDSA via pseudorandom correlation generators.  In: 2022 IEEE Symposium on Security and Privacy (SP), San Francisco, CA, USA, 2022, p. 2554\u201372. https:\/\/doi.org\/10.1109\/SP46214.2022.9833559.","DOI":"10.1109\/SP46214.2022.9833559"},{"issue":"3","key":"9449_CR2","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1515\/jmc-2015-0016","volume":"9","author":"MR Albrecht","year":"2015","unstructured":"Albrecht MR, Player R, Scott S. On the concrete hardness of learning with errors. J Math Cryptol. 2015;9(3):169\u2013203. https:\/\/doi.org\/10.1515\/jmc-2015-0016.","journal-title":"J Math Cryptol"},{"key":"9449_CR3","doi-asserted-by":"publisher","first-page":"376","DOI":"10.1007\/978-3-031-54770-6_15","volume-title":"Applied cryptography and network security. ACNS 2024","author":"NA Alkadri","year":"2024","unstructured":"Alkadri NA, D\u00f6ttling N, Pu S. Practical lattice-based distributed signatures for a small number of signers. In: P\u00f6pper C, Batina L, editors. Applied cryptography and network security. ACNS 2024. Cham: Springer Nature Switzerland; 2024. p. 376\u2013402. https:\/\/doi.org\/10.1007\/978-3-031-54770-6_15."},{"key":"9449_CR4","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/978-3-030-55304-3_3","volume-title":"Information security and privacy. ACISP 2020.","author":"N Alkeilani Alkadri","year":"2020","unstructured":"Alkeilani Alkadri N, El Bansarkhani R, Buchmann J. On lattice-based interactive protocols: an approach with less or no aborts. In: Liu JK, Cui H, editors. Information security and privacy. ACISP 2020.  Cham: Springer International Publishing; 2020. p. 41\u201361. https:\/\/doi.org\/10.1007\/978-3-030-55304-3_3."},{"key":"9449_CR5","doi-asserted-by":"publisher","unstructured":"Ambainis A, Rosmanis A, Unruh D. Quantum attacks on classical proof systems: the hardness of quantum rewinding. In: 2014 IEEE 55th Annual symposium on foundations of computer science (FOCS), p. 474\u201383. IEEE Computer Society, Los Alamitos, CA, USA, 2014. https:\/\/doi.org\/10.1109\/FOCS.2014.57. https:\/\/doi.ieeecomputersociety.org\/10.1109\/FOCS.2014.57.","DOI":"10.1109\/FOCS.2014.57"},{"key":"9449_CR6","doi-asserted-by":"publisher","unstructured":"Azouaoui M, Bronchain O, Cassiers G, Hoffmann C, Kuzovkova Y, Renes J, et al. Protecting Dilithium against leakage: revisited sensitivity analysis and improved implementations. IACR Trans Cryptogr Hardw Embed Syst. 2023;(4):58\u201379. https:\/\/doi.org\/10.46586\/tches.v2023.i4.58-79.","DOI":"10.46586\/tches.v2023.i4.58-79"},{"key":"9449_CR7","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1007\/978-3-319-04852-9_2","volume-title":"Topics in cryptology-CT-RSA 2014","author":"S Bai","year":"2014","unstructured":"Bai S, Galbraith SD. An improved compression technique for signatures based on learning with errors. In: Benaloh J, editor. Topics in cryptology-CT-RSA 2014. Cham: Springer International Publishing; 2014. p. 28\u201347. https:\/\/doi.org\/10.1007\/978-3-319-04852-9_2."},{"key":"9449_CR8","doi-asserted-by":"publisher","first-page":"358","DOI":"10.1007\/978-3-031-38554-4_12","volume-title":"Advances in cryptology-CRYPTO 2023","author":"M Barbosa","year":"2023","unstructured":"Barbosa M, Barthe G, Doczkal C, Don J, Fehr S, Gr\u00e9goire B, et al. Fixing and mechanizing the security proof of Fiat-Shamir with aborts and Dilithium. In: Handschuh H, Lysyanskaya A, editors. Advances in cryptology-CRYPTO 2023. Cham: Springer Nature Switzerland; 2023. p. 358\u201389. https:\/\/doi.org\/10.1007\/978-3-031-38554-4_12."},{"key":"9449_CR9","doi-asserted-by":"publisher","unstructured":"Baum C, Damg\u00e5rd I, Lyubashevsky V, Oechsner S, Peikert C.  More efficient commitments from structured lattice assumptions. In: Catalano, D., De Prisco, R, editors. Security and cryptography for networks. SCN 2018. Lecture notes in computer science, vol 11035. Springer, Cham. https:\/\/doi.org\/10.1007\/978-3-319-98113-0_20.","DOI":"10.1007\/978-3-319-98113-0_20"},{"key":"9449_CR10","doi-asserted-by":"publisher","unstructured":"Bellare M, Neven G. Multi-signatures in the plain public-key model and a General Forking Lemma. In: Juels A, Wright RN, di Vimercati SDC, editors. Proceedings of the 13th ACM Conference on computer and communications security, CCS 2006, Alexandria, VA, USA, October 30\u2013November 3, 2006, p. 390\u201399. ACM; 2006. https:\/\/doi.org\/10.1145\/1180405.1180453.","DOI":"10.1145\/1180405.1180453"},{"key":"9449_CR11","doi-asserted-by":"publisher","first-page":"218","DOI":"10.1007\/978-3-642-38980-1_14","volume-title":"Applied cryptography and network security. ACNS 2013","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, editors. Applied cryptography and network security. ACNS 2013. Berlin: Springer; 2013. p. 218\u201336. https:\/\/doi.org\/10.1007\/978-3-642-38980-1_14."},{"issue":"4","key":"9449_CR12","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. 2022;35(4):25. https:\/\/doi.org\/10.1007\/s00145-022-09436-0.","journal-title":"J Cryptol"},{"key":"9449_CR13","doi-asserted-by":"publisher","unstructured":"Bernstein DJ, H\u00fclsing A, K\u00f6lbl S, Niederhagen R, Rijneveld J, Schwabe P. The SPHINCS+ signature framework. In: Proceedings of the 2019 ACM SIGSAC Conference on computer and communications security, CCS \u201919, p. 2129\u201346. Association for computing machinery, New York, NY, USA; 2019. https:\/\/doi.org\/10.1145\/3319535.3363229.","DOI":"10.1145\/3319535.3363229"},{"key":"9449_CR14","doi-asserted-by":"publisher","first-page":"565","DOI":"10.1007\/978-3-319-96884-1_19","volume-title":"Advances in cryptology-CRYPTO 2018","author":"D Boneh","year":"2018","unstructured":"Boneh D, Gennaro R, Goldfeder S, Jain A, Kim S, Rasmussen PMR, et al. Threshold cryptosystems from threshold fully homomorphic encryption. In: Shacham H, Boldyreva A, editors. Advances in cryptology-CRYPTO 2018. Cham: Springer International Publishing; 2018. p. 565\u201396. https:\/\/doi.org\/10.1007\/978-3-319-96884-1_19."},{"key":"9449_CR15","unstructured":"Boneh D, Partap A, Waters B. Accountable multi-signatures with constant size public keys. Cryptology ePrint Archive, Paper 2023;1793. https:\/\/eprint.iacr.org\/2023\/1793."},{"issue":"6","key":"9449_CR16","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 NP, Tanguy T. Thresholdizing HashEdDSA: MPC to the rescue. Int J Inf Secur. 2021;20(6):879\u201394. https:\/\/doi.org\/10.1007\/s10207-021-00539-6.","journal-title":"Int J Inf Secur"},{"key":"9449_CR17","doi-asserted-by":"publisher","unstructured":"Bos J, Ducas L, Kiltz E, Lepoint T, Lyubashevsky V, Schanck JM, et al. CRYSTALS\u2013Kyber: A CCA-secure module-lattice-based KEM. In: 2018 IEEE European symposium on security and privacy (EuroS &P). 2018; p. 353\u201367. IEEE. https:\/\/doi.org\/10.1109\/EuroSP.2018.00032.","DOI":"10.1109\/EuroSP.2018.00032"},{"key":"9449_CR18","doi-asserted-by":"publisher","first-page":"276","DOI":"10.1007\/978-3-031-15979-4_10","volume-title":"Advances in cryptology-CRYPTO 2022","author":"C Boschini","year":"2022","unstructured":"Boschini C, Takahashi A, Tibouchi M.  MuSig-L: Lattice-based multi-signature with single-round online phase. In: Dodis Y, Shrimpton T, editors. Advances in cryptology-CRYPTO 2022. Cham: Springer Nature Switzerland; 2022. p. 276\u2013305. https:\/\/doi.org\/10.1007\/978-3-031-15979-4_10."},{"key":"9449_CR19","doi-asserted-by":"publisher","unstructured":"Boudgoust K, Takahashi A. Sequential half-aggregation of lattice-based signatures. In: Tsudik G, Conti M, Liang K, Smaragdakis G, editors. Computer security \u2013 ESORICS 2023. ESORICS 2023. Lecture notes in computer science, vol 14344. Springer, Cham. https:\/\/doi.org\/10.1007\/978-3-031-50594-2_14.","DOI":"10.1007\/978-3-031-50594-2_14"},{"key":"9449_CR20","doi-asserted-by":"publisher","first-page":"868","DOI":"10.1007\/978-3-642-32009-5_50","volume-title":"Advances in cryptology-CRYPTO 2012","author":"Z Brakerski","year":"2012","unstructured":"Brakerski Z. Fully homomorphic encryption without modulus switching from classical GapSVP. In: Safavi-Naini R, Canetti R, editors. Advances in cryptology-CRYPTO 2012. Berlin: Springer; 2012. p. 868\u201386. https:\/\/doi.org\/10.1007\/978-3-642-32009-5_50."},{"issue":"1","key":"9449_CR21","doi-asserted-by":"publisher","first-page":"220","DOI":"10.1007\/s00145-014-9192-y","volume":"29","author":"DRL Brown","year":"2016","unstructured":"Brown, D R L. Breaking RSA may be as difficult as factoring. J Cryptol. 2016;29(1):220\u201341. https:\/\/doi.org\/10.1007\/s00145-014-9192-y.","journal-title":"J Cryptol"},{"key":"9449_CR22","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1007\/978-3-319-66402-6_19","volume-title":"Computer security-ESORICS 2017","author":"A Buldas","year":"2017","unstructured":"Buldas A, Kalu A, Laud P, Oruaas M. Server-supported RSA signatures for mobile devices. In: Foley SN, Gollmann D, Snekkenes E, editors. Computer security-ESORICS 2017. Cham: Springer International Publishing; 2017. p. 315\u201333. https:\/\/doi.org\/10.1007\/978-3-319-66402-6_19."},{"key":"9449_CR23","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1007\/978-3-319-44618-9_19","volume-title":"Security and cryptography for networks. SCN 2016","author":"J Camenisch","year":"2016","unstructured":"Camenisch J, Lehmann A, Neven G, Samelin K. Virtual smart cards: how to sign with a password and a server. In: Zikas V, De Prisco R, editors. Security and cryptography for networks. SCN 2016. Cham: Springer International Publishing; 2016. p. 353\u201371. https:\/\/doi.org\/10.1007\/978-3-319-44618-9_19."},{"key":"9449_CR24","doi-asserted-by":"publisher","first-page":"266","DOI":"10.1007\/978-3-030-45388-6_10","volume-title":"Public-key cryptography-PKC 2020","author":"G Castagnos","year":"2020","unstructured":"Castagnos G, Catalano D, Laguillaumie F, Savasta F, Tucker I. Bandwidth-efficient threshold EC-DSA. In: Kiayias A, Kohlweiss M, Wallden P, Zikas V, editors. Public-key cryptography-PKC 2020. Cham: Springer International Publishing; 2020. p. 266\u201396. https:\/\/doi.org\/10.1007\/978-3-030-45388-6_10."},{"key":"9449_CR25","unstructured":"Chairattana-Apirom R, Tessaro S, Zhu C. Partially non-interactive two-round lattice-based threshold signatures. Cryptology ePrint Archive, Paper 2024; 467. https:\/\/eprint.iacr.org\/2024\/467."},{"key":"9449_CR26","doi-asserted-by":"publisher","first-page":"716","DOI":"10.1007\/978-3-031-38554-4_23","volume-title":"Advances in Cryptology-CRYPTO 2023","author":"Y Chen","year":"2023","unstructured":"Chen Y. DualMS: efficient lattice-based two-round multi-signature with trapdoor-free simulation. In: Handschuh H, Lysyanskaya A, editors. Advances in cryptology-CRYPTO 2023. Cham: Springer Nature Switzerland; 2023. p. 716\u201347. https:\/\/doi.org\/10.1007\/978-3-031-38554-4_23."},{"key":"9449_CR27","doi-asserted-by":"publisher","unstructured":"Chou CN, Love PJ, Sandhu JS, Shi J. Limitations of local quantum algorithms on random Max-k-XOR and beyond. In: Boja\u0144czyk M, Merelli E, Woodruff DP, editors. 49th International colloquium on automata, languages, and programming (ICALP 2022), Leibniz International Proceedings in Informatics (LIPIcs), vol 229, p. 41:1\u201341:20. Schloss Dagstuhl\u2013Leibniz-Zentrum f\u00fcr Informatik, Dagstuhl, Germany; 2022. https:\/\/doi.org\/10.4230\/LIPIcs.ICALP.2022.41. https:\/\/drops.dagstuhl.de\/entities\/document\/10.4230\/LIPIcs.ICALP.2022.41.","DOI":"10.4230\/LIPIcs.ICALP.2022.41"},{"key":"9449_CR28","doi-asserted-by":"publisher","first-page":"743","DOI":"10.1007\/978-3-031-38557-5_24","volume-title":"Advances in cryptology-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, editors. Advances in cryptology-CRYPTO 2023. Cham: Springer Nature Switzerland; 2023. p. 743\u201373. https:\/\/doi.org\/10.1007\/978-3-031-38557-5_24."},{"key":"9449_CR29","doi-asserted-by":"publisher","unstructured":"Cozzo D, Smart NP. Sharing the LUOV: Threshold post-quantum signatures. In: Albrecht M. editors. Cryptography and coding\u201417th IMA International conference, IMACC 2019, Oxford, UK, December 16-18, 2019, Proceedings, Lecture Notes in Computer Science, vol. 11929, p. 128\u201353. Springer; 2019. https:\/\/doi.org\/10.1007\/978-3-030-35199-1_7.","DOI":"10.1007\/978-3-030-35199-1_7"},{"key":"9449_CR30","doi-asserted-by":"publisher","first-page":"678","DOI":"10.1007\/978-3-031-38557-5_22","volume-title":"Advances in cryptology-CRYPTO 2023","author":"E Crites","year":"2023","unstructured":"Crites E, Komlo C, Maller M. Fully adaptive Schnorr threshold signatures. In: Handschuh H, Lysyanskaya A, editors. Advances in cryptology-CRYPTO 2023. Cham: Springer Nature Switzerland; 2023. p. 678\u2013709. https:\/\/doi.org\/10.1007\/978-3-031-38557-5_22."},{"key":"9449_CR31","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-40203-6_1","volume-title":"Computer security-ESORICS 2013","author":"I Damg\u00e5rd","year":"2013","unstructured":"Damg\u00e5rd I, Keller M, Larraia E, Pastro V, Scholl P, Smart NP. Practical covertly secure MPC for dishonest majority \u2013 Or: breaking the SPDZ limits. In: Crampton J, Jajodia S, Mayes K, editors. Computer security-ESORICS 2013. Berlin Heidelberg, Berlin, Heidelberg: Springer; 2013. p. 1\u201318. https:\/\/doi.org\/10.1007\/978-3-642-40203-6_1."},{"key":"9449_CR32","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1007\/978-3-319-15943-0_2","volume-title":"Information security and cryptology-ICISC 2014","author":"I Damg\u00e5rd","year":"2015","unstructured":"Damg\u00e5rd I, Mikkelsen GL, Skeltved T. On the security of distributed multiprime RSA. In: Lee J, Kim J, editors. Information security and cryptology-ICISC 2014. Cham: Springer International Publishing; 2015. p. 18\u201333. https:\/\/doi.org\/10.1007\/978-3-319-15943-0_2."},{"key":"9449_CR33","doi-asserted-by":"publisher","unstructured":"Damg\u00e5rd I, Orlandi C, Takahashi A, Tibouchi M. Two-round n-out-of-n and multi-signatures and trapdoor commitment from lattices. J Cryptol. 2022;35:14. https:\/\/doi.org\/10.1007\/s00145-022-09425-3.","DOI":"10.1007\/s00145-022-09425-3"},{"key":"9449_CR34","doi-asserted-by":"publisher","unstructured":"Devevey J, Fallahpour P, Passel\u00e8gue A, Stehl\u00e9 D. A detailed analysis of Fiat-Shamir with aborts. In: Handschuh H, Lysyanskaya A, editors. Advances in Cryptology \u2013 CRYPTO 2023. CRYPTO 2023. Lecture notes in computer science, vol 14085. Springer, Cham. https:\/\/doi.org\/10.1007\/978-3-031-38554-4_11.","DOI":"10.1007\/978-3-031-38554-4_11"},{"key":"9449_CR35","doi-asserted-by":"publisher","unstructured":"Dobias P, Ricci S, Dzurenda P, Malina L, Snetkov N. Lattice-based threshold signature implementation for constrained devices. In: Proceedings of the 20th international conference on security and cryptography - SECRYPT, p. 724\u2013730. INSTICC, SciTePress; 2023. https:\/\/doi.org\/10.5220\/0012112700003555.","DOI":"10.5220\/0012112700003555"},{"key":"9449_CR36","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 (SP). 2018;p. 980\u2013997. https:\/\/doi.org\/10.1109\/SP.2018.00036.","DOI":"10.1109\/SP.2018.00036"},{"key":"9449_CR37","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)\/ 2019;p. 1084\u20131101. https:\/\/doi.org\/10.1109\/SP.2019.00050.","DOI":"10.1109\/SP.2019.00050"},{"issue":"1","key":"9449_CR38","doi-asserted-by":"publisher","first-page":"238","DOI":"10.13154\/tches.v2018.i1.238-268","volume":"2018","author":"L Ducas","year":"2018","unstructured":"Ducas L, Kiltz E, Lepoint T, Lyubashevsky V, Schwabe P, Seiler G, Stehl\u00e9 D. CRYSTALS-Dilithium: a lattice-based digital signature scheme. IACR Trans Cryptogr Hardw Embed Syst. 2018;2018(1):238\u201368. https:\/\/doi.org\/10.13154\/tches.v2018.i1.238-268.","journal-title":"IACR Trans Cryptogr Hardw Embed Syst"},{"key":"9449_CR39","unstructured":"Fan J, Vercauteren F. Somewhat practical fully homomorphic encryption. Cryptology ePrint Archive, Paper 2012;144.\u00a0https:\/\/eprint.iacr.org\/2012\/144."},{"key":"9449_CR40","doi-asserted-by":"publisher","unstructured":"Fleischhacker N, Herold G, Simkin M, Zhang Z. Chipmunk: better synchronized multi-signatures from lattices. In: Proceedings of the 2023 ACM SIGSAC conference on computer and communications security, CCS \u201923, p. 386\u2013400. Association for Computing Machinery, New York, NY, USA; 2023. https:\/\/doi.org\/10.1145\/3576915.3623219.","DOI":"10.1145\/3576915.3623219"},{"key":"9449_CR41","doi-asserted-by":"publisher","unstructured":"Fleischhacker N, Simkin M, Zhang Z. Squirrel: efficient synchronized multi-signatures from lattices. In: Proceedings of the 2022 ACM SIGSAC conference on computer and communications security, CCS \u201922, p. 1109-1123. Association for Computing Machinery, New York, NY, USA; 2022. https:\/\/doi.org\/10.1145\/3548606.3560655.","DOI":"10.1145\/3548606.3560655"},{"key":"9449_CR42","unstructured":"Fouque PA, Hoffstein J, Kirchner P, Lyubashevsky V, Pornin T, Prest T, et al. Falcon: fast-fourier lattice-based compact signatures over NTRU. Submission to the NIST\u2019s post-quantum cryptography standardization process. 2018;36(5)."},{"key":"9449_CR43","doi-asserted-by":"publisher","unstructured":"Fu Y, Zhao X. Secure Two-party Dilithium signing protocol. In: 2021 17th International conference on computational intelligence and security (CIS). 2021;pp. 444\u2013448. IEEE. https:\/\/doi.org\/10.1109\/CIS54983.2021.00098.","DOI":"10.1109\/CIS54983.2021.00098"},{"key":"9449_CR44","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1007\/978-3-030-62576-4_3","volume-title":"Provable and practical security. ProvSec 2020","author":"M Fukumitsu","year":"2020","unstructured":"Fukumitsu M, Hasegawa S. A lattice-based provably secure multisignature scheme in quantum random oracle model. In: Nguyen K, Wu W, Lam KY, Wang H, editors. Provable and practical security.\u00a0ProvSec 2020. Cham: Springer International Publishing; 2020. p. 45\u201364. https:\/\/doi.org\/10.1007\/978-3-030-62576-4_3."},{"key":"9449_CR45","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1007\/978-3-030-84242-0_6","volume-title":"Advances in cryptology-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, editors. Advances in cryptology-CRYPTO 2021. Cham: Springer International Publishing; 2021. p. 127\u201356. https:\/\/doi.org\/10.1007\/978-3-030-84242-0_6."},{"key":"9449_CR46","doi-asserted-by":"publisher","unstructured":"Gur KD, Katz J, Silde T. Two-Round Threshold lattice-based signatures from threshold homomorphic encryption. In: Saarinen MJ, Smith-Tone D, editors. Post-quantum cryptography. PQCrypto 2024. Lecture notes in computer science, vol 14772. Springer, Cham. https:\/\/doi.org\/10.1007\/978-3-031-62746-0_12.","DOI":"10.1007\/978-3-031-62746-0_12"},{"key":"9449_CR47","unstructured":"Information Technology Laboratory, National Institute of Standards and Technology: module-lattice-based digital signature standard (Initial public draft); 2023. FIPS PUB 204, https:\/\/csrc.nist.gov\/pubs\/fips\/204\/ipd."},{"key":"9449_CR48","doi-asserted-by":"publisher","unstructured":"Jackson KA, Miller CA, Wang D. Evaluating the security of CRYSTALS-Dilithium in the quantum random Oracle model. In: Joye M, Leander G, editors. Advances in cryptology\u2013EUROCRYPT 2024. EUROCRYPT 2024. Lecture notes in computer science, vol 14656. Springer, Cham. https:\/\/doi.org\/10.1007\/978-3-031-58751-1_15.","DOI":"10.1007\/978-3-031-58751-1_15"},{"key":"9449_CR49","doi-asserted-by":"publisher","unstructured":"Kiltz E, Lyubashevsky V, Schaffner C. A Concrete treatment of Fiat-Shamir signatures in the quantum random-oracle model. In: Nielsen JB, Rijmen V. editors. Advances in cryptology-EUROCRYPT 2018-37th Annual international conference on the theory and applications of cryptographic techniques, Tel Aviv, Israel, April 29 - May 3, 2018 Proceedings, Part III, Lecture notes in computer science, vol. 10822, p. 552\u201386. Springer; 2018. https:\/\/doi.org\/10.1007\/978-3-319-78372-7_18.","DOI":"10.1007\/978-3-319-78372-7_18"},{"key":"9449_CR50","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1007\/978-3-030-81652-0_2","volume-title":"Selected areas in cryptography. SAC 2020","author":"C Komlo","year":"2021","unstructured":"Komlo C, Goldberg I. FROST: flexible round-optimized Schnorr threshold signatures. In: Dunkelman O, Jacobson MJ Jr, O\u2019Flynn C, editors. Selected areas in cryptography. SAC 2020. Cham: Springer International Publishing; 2021. p. 34\u201365. https:\/\/doi.org\/10.1007\/978-3-030-81652-0_2."},{"key":"9449_CR51","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, editors. Advances in cryptology \u2013 CRYPTO 2023. CRYPTO 2023. Lecture Notes in Computer Science, vol 14081. Springer, Cham. https:\/\/doi.org\/10.1007\/978-3-031-38557-5_21.","DOI":"10.1007\/978-3-031-38557-5_21"},{"key":"9449_CR52","unstructured":"Laud P, Snetkov N, Vakarjuk J. Dilizium 2.0: Revisiting two-party Crystals-Dilithium. Cryptology ePrint Archive, Paper 2022; 644. https:\/\/eprint.iacr.org\/2022\/644."},{"key":"9449_CR53","doi-asserted-by":"publisher","first-page":"613","DOI":"10.1007\/978-3-319-63715-0_21","volume-title":"Advances in Cryptology-CRYPTO 2017","author":"Y Lindell","year":"2017","unstructured":"Lindell Y. Fast secure two-party ECDSA signing. In: Katz J, Shacham H, editors. Advances in cryptology-CRYPTO 2017. Cham: Springer International Publishing; 2017. p. 613\u201344. https:\/\/doi.org\/10.1007\/978-3-319-63715-0_21."},{"key":"9449_CR54","doi-asserted-by":"publisher","first-page":"663","DOI":"10.1016\/j.future.2022.11.034","volume":"141","author":"J Liu","year":"2023","unstructured":"Liu J, Wen J, Zhang B, Dong S, Tang B, Yu Y. A post quantum secure multi-party collaborative signature with deterability in the industrial internet of things. Future Gener Comput Syst. 2023;141:663\u201376. https:\/\/doi.org\/10.1016\/j.future.2022.11.034.","journal-title":"Future Gener Comput Syst"},{"key":"9449_CR55","doi-asserted-by":"publisher","unstructured":"Lyubashevsky V, Micciancio D, Peikert C, Rosen A. SWIFFT: A modest proposal for FFT hashing. In: Nyberg, K, editor. Fast software encryption. FSE 2008. Lecture Notes in Computer Science, vol 5086. Springer, Berlin, Heidelberg. https:\/\/doi.org\/10.1007\/978-3-540-71039-4_4.","DOI":"10.1007\/978-3-540-71039-4_4"},{"key":"9449_CR56","doi-asserted-by":"crossref","unstructured":"McCurley KS. The discrete logarithm problem. In: Proc. of Symp. in Applied Math, vol. 42, pp. 49\u201374. USA; 1990.","DOI":"10.1090\/psapm\/042\/1095551"},{"key":"9449_CR57","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1007\/978-3-030-84242-0_8","volume-title":"Advances in cryptology-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, editors. Advances in cryptology-CRYPTO 2021. Cham: Springer International Publishing; 2021. p. 189\u2013221. https:\/\/doi.org\/10.1007\/978-3-030-84242-0_8."},{"key":"9449_CR58","doi-asserted-by":"publisher","unstructured":"Nick J, Ruffing T, Seurin Y, Wuille P. MuSig-DN: Schnorr multi-signatures with verifiably deterministic nonces. In: Proceedings of the 2020 ACM SIGSAC conference on computer and communications security, CCS \u201920, p. 1717\u201331. Association for computing machinery, New York, NY, USA; 2020. https:\/\/doi.org\/10.1145\/3372297.3417236.","DOI":"10.1145\/3372297.3417236"},{"key":"9449_CR59","doi-asserted-by":"publisher","unstructured":"Pino del  R, Katsumata S, Maller M, Mouhartem F, Prest T, Saarinen MJ. Threshold raccoon: practical threshold signatures from standard lattice assumptions. In: Joye, M., Leander, G. (eds) Advances in cryptology \u2013 EUROCRYPT 2024. EUROCRYPT 2024. Lecture notes in computer science, vol. 14652. Springer, Cham. https:\/\/doi.org\/10.1007\/978-3-031-58723-8_8.","DOI":"10.1007\/978-3-031-58723-8_8"},{"issue":"1","key":"9449_CR60","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10207-015-0307-8","volume":"16","author":"B Poettering","year":"2017","unstructured":"Poettering B, Stebila D. Double-authentication-preventing signatures. Int J Inf Secur. 2017;16(1):1\u201322. https:\/\/doi.org\/10.1007\/s10207-015-0307-8.","journal-title":"Int J Inf Secur"},{"key":"9449_CR61","doi-asserted-by":"publisher","first-page":"228","DOI":"10.1007\/978-3-540-72540-4_13","volume-title":"Advances in cryptology-EUROCRYPT 2007","author":"T Ristenpart","year":"2007","unstructured":"Ristenpart T, Yilek S. The power of proofs-of-possession: securing multiparty signatures against Rogue-Key attacks. In: Naor M, editor. Advances in cryptology-EUROCRYPT 2007. Berlin Heidelberg, Berlin, Heidelberg: Springer; 2007. p. 228\u201345. https:\/\/doi.org\/10.1007\/978-3-540-72540-4_13."},{"key":"9449_CR62","doi-asserted-by":"publisher","unstructured":"Shor P. Algorithms for quantum computation: discrete logarithms and factoring. In: Proceedings 35th Annual symposium on foundations of computer science. 1994; pp. 124\u2013134. https:\/\/doi.org\/10.1109\/SFCS.1994.365700.","DOI":"10.1109\/SFCS.1994.365700"},{"key":"9449_CR63","doi-asserted-by":"publisher","unstructured":"Shoup V. Practical threshold signatures. In: Preneel, B. (eds) Advances in Cryptology\u2014EUROCRYPT 2000. EUROCRYPT 2000. Lecture notes in computer science, vol 1807. Springer, Berlin, Heidelberg. https:\/\/doi.org\/10.1007\/3-540-45539-6_15.","DOI":"10.1007\/3-540-45539-6_15"},{"key":"9449_CR64","doi-asserted-by":"publisher","first-page":"4173","DOI":"10.1109\/TIFS.2023.3293408","volume":"18","author":"G Tang","year":"2023","unstructured":"Tang G, Pang B, Chen L, Zhang Z. Efficient lattice-based threshold signatures with functional interchangeability. IEEE Transactions on Information Forensics and Security. 2023;18:4173\u201387. https:\/\/doi.org\/10.1109\/TIFS.2023.3293408.","journal-title":"IEEE Transactions on Information Forensics and Security"},{"key":"9449_CR65","doi-asserted-by":"publisher","first-page":"497","DOI":"10.1007\/978-3-662-49896-5_18","volume-title":"Advances in cryptology-EUROCRYPT 2016","author":"D Unruh","year":"2016","unstructured":"Unruh D.  Computationally binding quantum commitments. In: Fischlin M, Coron JS, editors. Advances in cryptology-EUROCRYPT 2016. Berlin: Springer; 2016. p. 497\u2013527. https:\/\/doi.org\/10.1007\/978-3-662-49896-5_18."},{"key":"9449_CR66","doi-asserted-by":"publisher","unstructured":"Vakarjuk J, Snetkov N, Willemson J. DiLizium: A two-party lattice-based signature scheme.  Entropy. 2021;23(8). https:\/\/doi.org\/10.3390\/e23080989.","DOI":"10.3390\/e23080989"},{"key":"9449_CR67","doi-asserted-by":"publisher","unstructured":"Wu X, Li B, Zhang B, Liu X, Ren W, Choo KKR. Attack analysis on two-party signature and threshold signature based on Dilithium. In: 2023 IEEE Symposium on computers and communications (ISCC). 2023; p. 291\u201397. https:\/\/doi.org\/10.1109\/ISCC58397.2023.10217977.","DOI":"10.1109\/ISCC58397.2023.10217977"},{"key":"9449_CR68","doi-asserted-by":"publisher","unstructured":"Xue H, Au MH, Xie X, Yuen TH, Cui H. Efficient Online-friendly Two-Party ECDSA signature. In: Proceedings of the 2021 ACM SIGSAC conference on computer and Communications Security, CCS \u201921, p. 558\u201373. Association for computing machinery, New York, NY, USA; 2021. https:\/\/doi.org\/10.1145\/3460120.3484803.","DOI":"10.1145\/3460120.3484803"}],"container-title":["Discover Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10791-024-09449-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10791-024-09449-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10791-024-09449-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,7,10]],"date-time":"2024-07-10T06:13:16Z","timestamp":1720591996000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10791-024-09449-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,7,10]]},"references-count":68,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2024,12]]}},"alternative-id":["9449"],"URL":"https:\/\/doi.org\/10.1007\/s10791-024-09449-2","relation":{"has-preprint":[{"id-type":"doi","id":"10.21203\/rs.3.rs-4383446\/v1","asserted-by":"object"}]},"ISSN":["2948-2992"],"issn-type":[{"value":"2948-2992","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,7,10]]},"assertion":[{"value":"7 May 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 June 2024","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 July 2024","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"We have no competing interest to disclose.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}},{"value":"This work has no ethical implications.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethical approval and consent to participate"}}],"article-number":"18"}}