{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,2]],"date-time":"2026-07-02T16:17:50Z","timestamp":1783009070843,"version":"3.54.5"},"publisher-location":"New York, NY, USA","reference-count":57,"publisher":"ACM","license":[{"start":{"date-parts":[[2024,12,2]],"date-time":"2024-12-02T00:00:00Z","timestamp":1733097600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"National Key Research and Development Program of China","award":["2022YFB2701500"],"award-info":[{"award-number":["2022YFB2701500"]}]},{"DOI":"10.13039\/501100006374","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62372292"],"award-info":[{"award-number":["62372292"]}],"id":[{"id":"10.13039\/501100006374","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2024,12,2]]},"DOI":"10.1145\/3658644.3670287","type":"proceedings-article","created":{"date-parts":[[2024,12,9]],"date-time":"2024-12-09T12:19:20Z","timestamp":1733746760000},"page":"4256-4270","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":7,"title":["Batch Range Proof: How to Make Threshold ECDSA More Efficient"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-0121-5471","authenticated-orcid":false,"given":"Guofeng","family":"Tang","sequence":"first","affiliation":[{"name":"Ant Group, Beijing, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8156-7089","authenticated-orcid":false,"given":"Shuai","family":"Han","sequence":"additional","affiliation":[{"name":"Shanghai Jiao Tong University & Ant Group, Shanghai, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5307-2353","authenticated-orcid":false,"given":"Li","family":"Lin","sequence":"additional","affiliation":[{"name":"Ant Group, Beijing, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0000-4635-8946","authenticated-orcid":false,"given":"Changzheng","family":"Wei","sequence":"additional","affiliation":[{"name":"Ant Group, Shanghai, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0003-3890-6238","authenticated-orcid":false,"given":"Ying","family":"Yan","sequence":"additional","affiliation":[{"name":"Ant Group, Beijing, China"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2024,12,9]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"Binance. https:\/\/www.binance.com"},{"key":"e_1_3_2_1_2_1","unstructured":"BitGo. https:\/\/www.bitgo.com"},{"key":"e_1_3_2_1_3_1","unstructured":"Coinbase. https:\/\/www.coinbase.com."},{"key":"e_1_3_2_1_4_1","unstructured":"Fireblocks. https:\/\/www.fireblocks.com"},{"key":"e_1_3_2_1_5_1","unstructured":"Zengo. https:\/\/zengo.com"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"crossref","unstructured":"Thomas Attema Serge Fehr and Nicolas Resch. 2023. Generalized Special-Sound Interactive Proofs and Their Knowledge Soundness. In TCC. 424--454.","DOI":"10.1007\/978-3-031-48621-0_15"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.6028\/NIST.SP.800-57p1r2006"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"crossref","unstructured":"Claudia Bartoli and Ignacio Cascudo. 2024. On Sigma-Protocols and (Packed) Black-Box Secret Sharing Schemes. In PKC. 426--457.","DOI":"10.1007\/978-3-031-57722-2_14"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"crossref","unstructured":"Donald Beaver. 1991. Efficient Multiparty Protocols Using Circuit Randomization. In CRYPTO. 420--432.","DOI":"10.1007\/3-540-46766-1_34"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"crossref","unstructured":"Mihir Bellare and Gregory Neven. 2006. Multi-signatures in the plain public-Key model and a general forking lemma. In CCS. 390--399.","DOI":"10.1145\/1180405.1180453"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"crossref","unstructured":"Mihir Bellare and Phillip Rogaway. 1993. Random Oracles are Practical: A Paradigm for Designing Efficient Protocols. In CCS. 62--73.","DOI":"10.1145\/168588.168596"},{"key":"e_1_3_2_1_12_1","volume-title":"Aurora: Transparent succinct arguments for R1CS. In EUROCRYPT. 103--128.","author":"Ben-Sasson Eli","year":"2019","unstructured":"Eli Ben-Sasson, Alessandro Chiesa, Michael Riabzev, Nicholas Spooner, Madars Virza, and Nicholas P Ward. 2019. Aurora: Transparent succinct arguments for R1CS. In EUROCRYPT. 103--128."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00145-016-9229-5"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"crossref","unstructured":"Dan Boneh Rosario Gennaro and Steven Goldfeder. 2017. Using Level-1 Homomorphic Encryption to Improve Threshold DSA Signatures for Bitcoin Wallet Security. In LATINCRYPT. 352--377.","DOI":"10.1007\/978-3-030-25283-0_19"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"crossref","unstructured":"Jonathan Bootle Andrea Cerulli Pyrros Chaidos Jens Groth and Christophe Petit. 2016. Efficient Zero-Knowledge Arguments for Arithmetic Circuits in the Discrete Log Setting. In EUROCRYPT. 327--357.","DOI":"10.1007\/978-3-662-49896-5_12"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"crossref","unstructured":"Lu\u00eds TAN Brand\u00e3o Michael Davidson Apostol Vassilev et al. 2020. NIST Roadmap Toward Criteria for Threshold Schemes for Cryptographic Primitives. National Institute of Standard and Technology (2020).","DOI":"10.6028\/NIST.IR.8214A"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"crossref","unstructured":"Benedikt B\u00fcnz Jonathan Bootle Dan Boneh Andrew Poelstra Pieter Wuille and Gregory Maxwell. Bulletproofs: Short Proofs for Confidential Transactions and More. In SP. 315--334.","DOI":"10.1109\/SP.2018.00020"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"crossref","unstructured":"Ran Canetti. 2001. Universally Composable Security: A New Paradigm for Cryptographic Protocols. In FOCS. 136--145.","DOI":"10.1109\/SFCS.2001.959888"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"crossref","unstructured":"Ran Canetti Rosario Gennaro Steven Goldfeder Nikolaos Makriyannis and Udi Peled. 2020. UC Non-Interactive Proactive Threshold ECDSA with Identifiable Aborts. In CCS. 1769--1787.","DOI":"10.1145\/3372297.3423367"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"crossref","unstructured":"Ran Canetti Rosario Gennaro Steven Goldfeder Nikolaos Makriyannis and Udi Peled. 2021. UC Non-Interactive Proactive Threshold ECDSA with Identifiable Aborts. IACR Cryptol. ePrint Arch. (2021) 60.","DOI":"10.1145\/3372297.3423367"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"crossref","unstructured":"Guilhem Castagnos Dario Catalano Fabien Laguillaumie Federico Savasta and Ida Tucker. 2020. Bandwidth-Efficient Threshold EC-DSA. In PKC. 266--296.","DOI":"10.1007\/978-3-030-45388-6_10"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"crossref","unstructured":"Guilhem Castagnos Dario Catalano Fabien Laguillaumie Federico Savasta and Ida Tucker. 2023. Bandwidth-efficient threshold EC-DSA revisited: Online\/ offline extensions identifiable aborts proactive and adaptive security. Theor. Comput. Sci. (2023) 78--104.","DOI":"10.1016\/j.tcs.2022.10.016"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"crossref","unstructured":"Chaochao Chen Jun Zhou LiWang XibinWu Wenjing Fang Jin Tan LeiWang Alex X. Liu Hao Wang and Cheng Hong. 2021. When Homomorphic Encryption Marries Secret Sharing: Secure Large-Scale Sparse Logistic Regression and Applications in Risk Control. In KDD. 2652--2662.","DOI":"10.1145\/3447548.3467210"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"crossref","unstructured":"Jack Doerner Yashvanth Kondi Eysa Lee and Abhi Shelat. 2018. Secure Twoparty Threshold ECDSA from ECDSA Assumptions. In SP. 980--997.","DOI":"10.1109\/SP.2018.00036"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"crossref","unstructured":"Jack Doerner Yashvanth Kondi Eysa Lee and Abhi Shelat. 2019. Threshold ECDSA from ECDSA Assumptions: The Multiparty Case. In SP. 1051--1066.","DOI":"10.1109\/SP.2019.00024"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"crossref","unstructured":"Jack Doerner Yashvanth Kondi Eysa Lee and Abhi Shelat. 2024. Threshold ECDSA in Three Rounds. In SP.","DOI":"10.1109\/SP54263.2024.00178"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"crossref","unstructured":"Jack Doerner Yashvanth Kondi Eysa Lee Abhi Shelat and LaKyah Tyner. 2023. Threshold BBS Signatures for Distributed Anonymous Credential Issuance. In SP. 773--789.","DOI":"10.1109\/SP46215.2023.10179470"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"crossref","unstructured":"Amos Fiat and Adi Shamir. 1986. How to Prove Yourself: Practical Solutions to Identification and Signature Problems. In CRYPTO. 186--194.","DOI":"10.1007\/3-540-47721-7_12"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"crossref","unstructured":"Eiichiro Fujisaki and Tatsuaki Okamoto. 1997. Statistical Zero Knowledge Protocols to Prove Modular Polynomial Relations. In CRYPTO. 16--30.","DOI":"10.1007\/BFb0052225"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/3548606.3559379"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"crossref","unstructured":"Rosario Gennaro and Steven Goldfeder. 2018. Fast Multiparty Threshold ECDSA with Fast Trustless Setup. In CCS. 1179--1194.","DOI":"10.1145\/3243734.3243859"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"crossref","unstructured":"Rosario Gennaro Steven Goldfeder and Arvind Narayanan. 2016. Threshold- Optimal DSA\/ECDSA Signatures and an Application to Bitcoin Wallet Security. In ACNS. 156--174.","DOI":"10.1007\/978-3-319-39555-5_9"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"crossref","unstructured":"Rosario Gennaro Stanislaw Jarecki Hugo Krawczyk and Tal Rabin. 1996. Robust Threshold DSS Signatures. In EUROCRYPT. 354--371.","DOI":"10.1007\/3-540-68339-9_31"},{"key":"e_1_3_2_1_34_1","volume-title":"Yerazunis","author":"Gennaro Rosario","year":"2004","unstructured":"Rosario Gennaro, Darren Leigh, Ravi Sundaram, and William S. Yerazunis. 2004. Batching Schnorr Identification Scheme with Applications to Privacy- Preserving Authorization and Low-Bandwidth Communication Devices. In ASIACRYPT. 276--292."},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"crossref","unstructured":"B. Gong W. Lau M. Au R. Yang H. Xue and L. Li. 2024. Efficient Zero- Knowledge Arguments For Paillier Cryptosystem. In SP.","DOI":"10.1109\/SP54263.2024.00093"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"crossref","unstructured":"Jens Groth. 2006. Simulation-Sound NIZK Proofs for a Practical Language and Constant Size Group Signatures. In ASIACRYPT. 444--459.","DOI":"10.1007\/11935230_29"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"crossref","unstructured":"Jens Groth and Yuval Ishai. 2008. Sub-linear Zero-Knowledge Argument for Correctness of a Shuffle. In EUROCRYPT. 379--396.","DOI":"10.1007\/978-3-540-78967-3_22"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"crossref","unstructured":"Yotam Harchol Ittai Abraham and Benny Pinkas. 2018. Distributed SSH key management with proactive RSA threshold signatures. In ACNS. 22--43.","DOI":"10.1007\/978-3-319-93387-0_2"},{"key":"e_1_3_2_1_39_1","unstructured":"Xiaoyang Hou Jian Liu Jingyu Li Yuhan Li Wen-jie Lu Cheng Hong and Kui Ren. 2023. CipherGPT: Secure Two-Party GPT Inference. IACR Cryptol. ePrint Arch. (2023) 1147."},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"crossref","unstructured":"Marc Joye and Beno\u00eet Libert. 2013. Efficient Cryptosystems From 2k-th Power Residue Symbols. EUROCRYPT 76--92.","DOI":"10.1007\/978-3-642-38348-9_5"},{"key":"e_1_3_2_1_41_1","unstructured":"Mads Jurik. 2003. Extensions to the Paillier cryptosystem with applications to cryptological protocols. PhD Thesis (2003)."},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00145-002-0143-7"},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"crossref","unstructured":"Yehuda Lindell. 2017. Fast Secure Two-Party ECDSA Signing. In CRYPTO. 613-- 644.","DOI":"10.1007\/978-3-319-63715-0_21"},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"crossref","unstructured":"Yehuda Lindell and Ariel Nof. 2018. Fast Secure Multiparty ECDSA with Practical Distributed Key Generation and Applications to Cryptocurrency Custody. In CCS. 1837--1854.","DOI":"10.1145\/3243734.3243788"},{"key":"e_1_3_2_1_45_1","volume-title":"Candid: Can-do decentralized identity with legacy compatibility, sybilresistance, and accountability. In SP. 1348--1366.","author":"Maram Deepak","year":"2021","unstructured":"Deepak Maram, Harjasleen Malvai, Fan Zhang, Nerla Jean-Louis, Alexander Frolov, Tyler Kell, Tyrone Lobban, Christine Moy, Ari Juels, and Andrew Miller. 2021. Candid: Can-do decentralized identity with legacy compatibility, sybilresistance, and accountability. In SP. 1348--1366."},{"key":"e_1_3_2_1_46_1","doi-asserted-by":"crossref","unstructured":"Daniel Masny and Peter Rindal. 2019. Endemic Oblivious Transfer. In CCS. 309-- 326.","DOI":"10.1145\/3319535.3354210"},{"key":"e_1_3_2_1_47_1","doi-asserted-by":"crossref","unstructured":"Pascal Paillier. 1999. Public-Key Cryptosystems Based on Composite Degree Residuosity Classes. In EUROCRYPT. 223--238.","DOI":"10.1007\/3-540-48910-X_16"},{"key":"e_1_3_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.1137\/0108018"},{"key":"e_1_3_2_1_49_1","doi-asserted-by":"crossref","unstructured":"Peter Rindal and Phillipp Schoppmann. 2021. VOLE-PSI: Fast OPRF and Circuit- PSI from Vector-OLE. In EUROCRYPT. 901--930.","DOI":"10.1007\/978-3-030-77886-6_31"},{"key":"e_1_3_2_1_50_1","unstructured":"Lawrence Roy. 2022. SoftSpokenOT: Communication-Computation Tradeoffs in OT Extension. IACR Cryptol. ePrint Arch. (2022) 192."},{"key":"e_1_3_2_1_51_1","doi-asserted-by":"crossref","unstructured":"Victor Shoup. 2000. Practical Threshold Signatures. In EUROCRYPT. 207--220.","DOI":"10.1007\/3-540-45539-6_15"},{"key":"e_1_3_2_1_52_1","unstructured":"Dmytro Tymokhanov and Omer Shlomovits. 2021. Alpha-Rays: Key Extraction Attacks on Threshold ECDSA Implementations. IACR Cryptol. ePrint Arch. (2021) 1621."},{"key":"e_1_3_2_1_53_1","volume-title":"Chow","author":"Wong Harry W. H.","year":"2023","unstructured":"Harry W. H. Wong, Jack P. K. Ma, Hoover H. F. Yin, and Sherman S. M. Chow. 2023. Real Threshold ECDSA. In NDSS."},{"key":"e_1_3_2_1_54_1","volume-title":"Mengling Liu, Kwan Yin Chan, Handong Cui, Xiang Xie, Tsz Hon Yuen, and Chengru Zhang.","author":"Xue Haiyang","year":"2023","unstructured":"Haiyang Xue, Man Ho Au, Mengling Liu, Kwan Yin Chan, Handong Cui, Xiang Xie, Tsz Hon Yuen, and Chengru Zhang. 2023. Efficient Multiplicative-to- Additive Function from Joye-Libert Cryptosystem and Its Application to Threshold ECDSA. CCS."},{"key":"e_1_3_2_1_55_1","volume-title":"Zhenfei Zhang, Qiuliang Xu, Zuoxia Yu, and William Whyte.","author":"Yang Rupeng","year":"2019","unstructured":"Rupeng Yang, Man Ho Au, Zhenfei Zhang, Qiuliang Xu, Zuoxia Yu, and William Whyte. 2019. Efficient Lattice-Based Zero-Knowledge Arguments with Standard Soundness: Construction and Applications. In CRYPTO. 147--175."},{"key":"e_1_3_2_1_56_1","volume-title":"Guy Golan Gueta, and Ittai Abraham","author":"Yin Maofan","year":"2019","unstructured":"Maofan Yin, Dahlia Malkhi, Michael K Reiter, Guy Golan Gueta, and Ittai Abraham. 2019. HotStuff: BFT consensus with linearity and responsiveness. In PODC. 347--356."},{"key":"e_1_3_2_1_57_1","volume-title":"Man Ho Au, and Zhimin Ding","author":"Yuen Tsz Hon","year":"2021","unstructured":"Tsz Hon Yuen, Muhammed F Esgin, Joseph K Liu, Man Ho Au, and Zhimin Ding. 2021. DualRing: generic construction of ring signatures with efficient instantiations. In CRYPTO. 251--281."}],"event":{"name":"CCS '24: ACM SIGSAC Conference on Computer and Communications Security","location":"Salt Lake City UT USA","acronym":"CCS '24","sponsor":["SIGSAC ACM Special Interest Group on Security, Audit, and Control"]},"container-title":["Proceedings of the 2024 on ACM SIGSAC Conference on Computer and Communications Security"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3658644.3670287","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3658644.3670287","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,22]],"date-time":"2025-08-22T06:08:54Z","timestamp":1755842934000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3658644.3670287"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,12,2]]},"references-count":57,"alternative-id":["10.1145\/3658644.3670287","10.1145\/3658644"],"URL":"https:\/\/doi.org\/10.1145\/3658644.3670287","relation":{},"subject":[],"published":{"date-parts":[[2024,12,2]]},"assertion":[{"value":"2024-12-09","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}