{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,12]],"date-time":"2026-06-12T17:07:38Z","timestamp":1781284058560,"version":"3.54.1"},"reference-count":18,"publisher":"International Association for Cryptologic Research","issue":"1","license":[{"start":{"date-parts":[[2024,12,12]],"date-time":"2024-12-12T00:00:00Z","timestamp":1733961600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IACR CiC"],"accepted":{"date-parts":[[2025,3,11]]},"abstract":"<jats:p>Several protocols have been proposed recently for threshold ECDSA signatures, mostly in the dishonest-majority setting. Yet in so-called key-management networks, where a fixed set of servers share a large number of keys on behalf of multiple users, it may be reasonable to assume that a majority of the servers remain uncompromised, and in that case there may be several advantages to using an honest-majority protocol.<\/jats:p>\n          <jats:p>With this in mind, we describe an efficient protocol for actively secure, honest-majority threshold ECDSA supporting batch generation of key-independent presignatures that allow for \u201cnon-interactive\u201d online signing; these properties are not available in existing dishonest-majority protocols. Our protocol offers low latency and high throughput, and runs at an amortized rate of roughly 1.3\u00a0ms per presignature (after which signatures can be generated in less than 100 microseconds). <\/jats:p>","DOI":"10.62056\/a0l5wol7","type":"journal-article","created":{"date-parts":[[2025,4,8]],"date-time":"2025-04-08T21:23:17Z","timestamp":1744147397000},"update-policy":"https:\/\/doi.org\/10.62056\/adfjwm02dj","source":"Crossref","is-referenced-by-count":4,"title":["Honest-Majority Threshold ECDSA with Batch Generation of Key-Independent Presignatures"],"prefix":"10.62056","volume":"2","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-6084-9303","authenticated-orcid":false,"given":"Jonathan","family":"Katz","sequence":"first","affiliation":[{"name":"Google","place":["USA"]}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0000-3670-0146","authenticated-orcid":false,"given":"Antoine","family":"Urban","sequence":"additional","affiliation":[{"name":"Telecom Paris","place":["France"]}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"48349","published-online":{"date-parts":[[2025,4,8]]},"reference":[{"key":"ref1:MR01","doi-asserted-by":"publisher","first-page":"218","DOI":"10.1007\/S10207-004-0041-0","article-title":"Two-party generation of DSA signatures","volume":"2","author":"Philip D. MacKenzie","year":"2004","journal-title":"Intl. J. Info. Security"},{"key":"ref2:Lin17","doi-asserted-by":"publisher","DOI":"10.1007\/S00145-021-09409-9","article-title":"Fast Secure Two-Party ECDSA Signing","volume":"34","author":"Yehuda Lindell","year":"2021","journal-title":"J. Cryptology"},{"key":"ref3:DKLS18","doi-asserted-by":"publisher","first-page":"980","DOI":"10.1109\/SP.2018.00036","article-title":"Secure Two-party Threshold ECDSA from ECDSA\n  Assumptions","author":"Jack Doerner","year":"2018"},{"key":"ref4:DBLP:conf\/crypto\/CastagnosCLST19","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1007\/978-3-030-26954-8_7","article-title":"Two-Party ECDSA from Hash Proof Systems and Efficient\n  Instantiations","volume":"11694","author":"Guilhem Castagnos","year":"2019"},{"key":"ref5:LN18","doi-asserted-by":"publisher","first-page":"1837","DOI":"10.1145\/3243734.3243788","article-title":"Fast Secure Multiparty ECDSA with Practical Distributed\n  Key Generation and Applications to Cryptocurrency Custody","author":"Yehuda Lindell","year":"2018"},{"key":"ref6:DKLS19","doi-asserted-by":"publisher","first-page":"1051","DOI":"10.1109\/SP.2019.00024","article-title":"Threshold ECDSA from ECDSA Assumptions: The Multiparty\n  Case","author":"Jack Doerner","year":"2019"},{"key":"ref7:DBLP:conf\/pkc\/CastagnosCLST20","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1016\/J.TCS.2022.10.016","article-title":"Bandwidth-efficient threshold EC-DSA revisited:\n  Online\/offline extensions, identifiable aborts proactive and adaptive\n  security","volume":"939","author":"Guilhem Castagnos","year":"2023","journal-title":"Theoretical Computer Science"},{"key":"ref8:CGGMP","doi-asserted-by":"publisher","first-page":"1769","DOI":"10.1145\/3372297.3423367","article-title":"UC Non-Interactive, Proactive, Threshold ECDSA with\n  Identifiable Aborts","author":"Ran Canetti","year":"2020"},{"key":"ref9:DKLS23","doi-asserted-by":"publisher","DOI":"10.1109\/SP54263.2024.00178","article-title":"Threshold ECDSA in Three Rounds","author":"Jack Doerner","year":"2023"},{"key":"ref10:GJKR","doi-asserted-by":"publisher","first-page":"54","DOI":"10.1006\/INCO.2000.2881","article-title":"Robust Threshold DSS Signatures","volume":"164","author":"Rosario Gennaro","year":"2001","journal-title":"Information and Computarion"},{"key":"ref11:cryptoeprint:2019\/889","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"654","DOI":"10.1007\/978-3-030-59013-0_32","article-title":"Securing DNSSEC Keys via Threshold ECDSA from Generic\n  MPC","volume":"12309","author":"Anders P. K. Dalskov","year":"2020"},{"key":"ref12:cryptoeprint:2020\/498","volume-title":"Threshold ECDSA for Decentralized Asset Custody","author":"Adam G\u0105gol","year":"2020"},{"key":"ref13:DamgardJNPO22","doi-asserted-by":"publisher","first-page":"167","DOI":"10.3233\/JCS-200112","article-title":"Fast threshold ECDSA with honest majority","volume":"30","author":"Ivan Damg\u00e5rd","year":"2022","journal-title":"J. Comp. Security"},{"key":"ref14:DBLP:conf\/cans\/Pettit21","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"116","DOI":"10.1007\/978-3-030-92548-2_7","article-title":"Efficient Threshold-Optimal ECDSA","volume":"13099","author":"Michaella Pettit","year":"2021"},{"key":"ref15:Cramer2005ShareCP","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"342","DOI":"10.1007\/978-3-540-30576-7_19","article-title":"Share Conversion, Pseudorandom Secret-Sharing and\n  Applications to Secure Computation","volume":"3378","author":"Ronald Cramer","year":"2005"},{"key":"ref16:GS21","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1007\/978-3-031-06944-4_13","article-title":"On the Security of ECDSA with Additive Key Derivation and\n  Presignatures","volume":"13275","author":"Jens Groth","year":"2022"},{"key":"ref17:DBLP:conf\/crypto\/GoyalSZ20","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"618","DOI":"10.1007\/978-3-030-56880-1_22","article-title":"Guaranteed Output Delivery Comes Free in Honest Majority\n  MPC","volume":"12171","author":"Vipul Goyal","year":"2020"},{"key":"ref18:chida2018fast","doi-asserted-by":"publisher","DOI":"10.1007\/S00145-023-09453-7","article-title":"Fast Large-Scale Honest-Majority MPC for Malicious\n  Adversaries","volume":"36","author":"Koji Chida","year":"2023","journal-title":"J. Cryptology"}],"container-title":["IACR Communications in Cryptology"],"original-title":[],"language":"en","deposited":{"date-parts":[[2025,4,8]],"date-time":"2025-04-08T21:23:40Z","timestamp":1744147420000},"score":1,"resource":{"primary":{"URL":"https:\/\/cic.iacr.org\/p\/2\/1\/8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,4,8]]},"references-count":18,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2025,4,8]]}},"URL":"https:\/\/doi.org\/10.62056\/a0l5wol7","archive":["Internet Archive","Internet Archive"],"relation":{},"ISSN":["3006-5496"],"issn-type":[{"value":"3006-5496","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,4,8]]},"assertion":[{"value":"2024-12-12","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2025-03-11","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}}],"article-number":"cc2-1-4"}}