{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,1]],"date-time":"2026-02-01T04:31:12Z","timestamp":1769920272041,"version":"3.49.0"},"publisher-location":"New York, NY, USA","reference-count":51,"publisher":"ACM","funder":[{"name":"NWO","award":["024.006.037"],"award-info":[{"award-number":["024.006.037"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2025,11,19]]},"DOI":"10.1145\/3719027.3765041","type":"proceedings-article","created":{"date-parts":[[2025,11,22]],"date-time":"2025-11-22T23:37:25Z","timestamp":1763854645000},"page":"3664-3677","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":3,"title":["Separating Broadcast from Cheater Identification"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0009-0008-1848-9234","authenticated-orcid":false,"given":"Yashvanth","family":"Kondi","sequence":"first","affiliation":[{"name":"Silence Laboratories, Singapore, Singapore"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6423-8331","authenticated-orcid":false,"given":"Divya","family":"Ravi","sequence":"additional","affiliation":[{"name":"University of Amsterdam, Amsterdam, Netherlands"}]}],"member":"320","published-online":{"date-parts":[[2025,11,22]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-32101-7_20"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"crossref","unstructured":"Damiano Abram Ariel Nof Claudio Orlandi Peter Scholl and Omer Shlomovits. 2022. Low-Bandwidth Threshold ECDSA via Pseudorandom Correlation Generators.","DOI":"10.1109\/SP46214.2022.9833559"},{"key":"e_1_3_2_1_3_1","volume-title":"Calling Out Cheaters: Covert Security with Public Verifiability. In ASIACRYPT","author":"Asharov Gilad","year":"2012","unstructured":"Gilad Asharov and Claudio Orlandi. 2012. Calling Out Cheaters: Covert Security with Public Verifiability. In ASIACRYPT 2012."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00145-009-9040-7"},{"key":"e_1_3_2_1_5_1","volume-title":"Ivan Damgr ard, and Claudio Orlandi","author":"Baum Carsten","year":"2014","unstructured":"Carsten Baum, Ivan Damgr ard, and Claudio Orlandi. 2014. Publicly Auditable Secure Multi-Party Computation. In SCN 14."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-68397-8_14"},{"key":"e_1_3_2_1_7_1","volume-title":"Efficient Secure Multiparty Computation with Identifiable Abort. In TCC 2016-B, Part I.","author":"Baum Carsten","year":"2016","unstructured":"Carsten Baum, Emmanuela Orsini, and Peter Scholl. 2016. Efficient Secure Multiparty Computation with Identifiable Abort. In TCC 2016-B, Part I."},{"key":"e_1_3_2_1_8_1","volume-title":"Efficient Constant-Round MPC with Identifiable Abort and Public Verifiability. In CRYPTO","author":"Baum Carsten","year":"2020","unstructured":"Carsten Baum, Emmanuela Orsini, Peter Scholl, and Eduardo Soria-Vazquez. 2020. Efficient Constant-Round MPC with Identifiable Abort and Public Verifiability. In CRYPTO 2020, Part II."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.2001.959888"},{"key":"e_1_3_2_1_10_1","volume-title":"Threshold ECDSA with Identifiable Aborts. In ACM CCS","author":"Canetti Ran","year":"2020","unstructured":"Ran Canetti, Rosario Gennaro, Steven Goldfeder, Nikolaos Makriyannis, and Udi Peled. 2020. UC Non-Interactive, Proactive, Threshold ECDSA with Identifiable Aborts. In ACM CCS 2020."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1016\/J.TCS.2022.10.016"},{"key":"e_1_3_2_1_12_1","volume-title":"30th FOCS.","author":"Chor Benny","unstructured":"Benny Chor and Lior Moscovici. 1989. Solvability in Asynchronous Environments (Extended Abstract). In 30th FOCS."},{"key":"e_1_3_2_1_13_1","volume-title":"18th ACM STOC.","author":"Cleve Richard","unstructured":"Richard Cleve. 1986. Limits on the Security of Coin Flips when Half the Processors Are Faulty (Extended Abstract). In 18th ACM STOC."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00145-018-9279-y"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-68397-8_2"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00145-016-9245-5"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"crossref","unstructured":"Robert K. Cunningham Benjamin Fuller and Sophia Yakoubov. 2017. Catching MPC Cheaters: Identification and Openability. In ICITS 17.","DOI":"10.1007\/978-3-319-72089-0_7"},{"key":"e_1_3_2_1_18_1","volume-title":"Jesper Buus Nielsen, Jakob Illeborg Pagter, and Michael B\u00e6ksvang \u00d8stergaard.","author":"Ivan Damgr","year":"2020","unstructured":"Ivan Damgr ard, Thomas Pelle Jakobsen, Jesper Buus Nielsen, Jakob Illeborg Pagter, and Michael B\u00e6ksvang \u00d8stergaard. 2020. Fast Threshold ECDSA with Honest Majority. In SCN 20."},{"key":"e_1_3_2_1_19_1","first-page":"129","article-title":"Minimizing Setup in Broadcast-Optimal Two Round MPC. In EUROCRYPT (Lecture Notes in Computer Science, Vol. 14005)","author":"Damg\u00e5rd Ivan","year":"2023","unstructured":"Ivan Damg\u00e5rd, Divya Ravi, Luisa Siniscalchi, and Sophia Yakoubov. 2023. Minimizing Setup in Broadcast-Optimal Two Round MPC. In EUROCRYPT (Lecture Notes in Computer Science, Vol. 14005). Springer, 129-158.","journal-title":"Springer"},{"key":"e_1_3_2_1_20_1","volume-title":"Threshold ECDSA in Three Rounds. In 45th IEEE Symposium on Security and Privacy, SP","author":"Doerner Jack","year":"2024","unstructured":"Jack Doerner, Yashvanth Kondi, Eysa Lee, and abhi shelat. 2024. Threshold ECDSA in Three Rounds. In 45th IEEE Symposium on Security and Privacy, SP 2024. IEEE."},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1137\/0212045"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1987.4"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/3662158.3662771"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(82)90033-3"},{"key":"e_1_3_2_1_25_1","volume-title":"Communication-Efficient Non-interactive Proofs of Knowledge with Online Extractors. In CRYPTO","author":"Fischlin Marc","year":"2005","unstructured":"Marc Fischlin. 2005. Communication-Efficient Non-interactive Proofs of Knowledge with Online Extractors. In CRYPTO 2005."},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-46035-7_32"},{"key":"e_1_3_2_1_27_1","volume-title":"21st ACM PODC.","author":"Fitzi Matthias","unstructured":"Matthias Fitzi, Daniel Gottesman, Martin Hirt, Thomas Holenstein, and Adam Smith. 2002 b. Detectable byzantine agreement secure against faulty majorities. In 21st ACM PODC."},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00145-006-0347-3"},{"key":"e_1_3_2_1_29_1","volume-title":"19th ACM STOC.","author":"Goldreich Oded","unstructured":"Oded Goldreich, Silvio Micali, and Avi Wigderson. 1987 a. How to Play any Mental Game or A Completeness Theorem for Protocols with Honest Majority. In 19th ACM STOC."},{"key":"e_1_3_2_1_30_1","volume-title":"CRYPTO'86","author":"Goldreich Oded","year":"1987","unstructured":"Oded Goldreich, Silvio Micali, and Avi Wigderson. 1987 b. How to Prove all NP-Statements in Zero-Knowledge, and a Methodology of Cryptographic Protocol Design. In CRYPTO'86."},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00145-005-0319-z"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-97121-2_10"},{"key":"e_1_3_2_1_33_1","volume-title":"Blockchains Enable Non-interactive MPC. In TCC","author":"Goyal Vipul","year":"2021","unstructured":"Vipul Goyal, Elisaweta Masserova, Bryan Parno, and Yifan Song. 2021. Blockchains Enable Non-interactive MPC. In TCC 2021, Part II."},{"key":"e_1_3_2_1_34_1","unstructured":"Jens Groth and Victor Shoup. 2022. Design and analysis of a distributed ECDSA signing service. Cryptology ePrint Archive Report 2022\/506. https:\/\/eprint.iacr.org\/2022\/506."},{"key":"e_1_3_2_1_35_1","unstructured":"Iftach Haitner Yehuda Lindell Ariel Nof and Samuel Ranellucci. 2023. Fast Secure Multiparty ECDSA with Practical Distributed Key Generation and Applications to Cryptocurrency Custody. IACR Cryptol. ePrint Arch. (2023). https:\/\/eprint.iacr.org\/2018\/987."},{"key":"e_1_3_2_1_36_1","volume-title":"On Expected Constant-Round Protocols for Byzantine Agreement. In CRYPTO","author":"Katz Jonathan","year":"2006","unstructured":"Jonathan Katz and Chiu-Yuen Koo. 2006. On Expected Constant-Round Protocols for Byzantine Agreement. In CRYPTO 2006."},{"key":"e_1_3_2_1_37_1","volume-title":"Round-Efficient Secure Computation in Point-to-Point Networks. In EUROCRYPT","author":"Katz Jonathan","year":"2007","unstructured":"Jonathan Katz and Chiu-Yuen Koo. 2007. Round-Efficient Secure Computation in Point-to-Point Networks. In EUROCRYPT 2007."},{"key":"e_1_3_2_1_38_1","unstructured":"Jonathan Katz and Antoine Urban. 2024. Honest-Majority Threshold ECDSA with Batch Generation of Key-Independent Presignatures. Cryptology ePrint Archive Paper 2024\/2011. https:\/\/eprint.iacr.org\/2024\/2011"},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-49896-5_25"},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"crossref","unstructured":"Yashvanth Kondi and Divya Ravi. 2025. Separating Broadcast from Cheater Identification. Cryptology ePrint Archive Paper 2025\/052. https:\/\/eprint.iacr.org\/2025\/052","DOI":"10.1145\/3719027.3765041"},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1145\/357172.357176"},{"key":"e_1_3_2_1_42_1","unstructured":"Yehuda Lindell. 2022. Simple Three-Round Multiparty Schnorr Signing with Full Simulatability. Cryptology ePrint Archive Paper 2022\/374. https:\/\/eprint.iacr.org\/archive\/2022\/374\/20220322:132756 Paper has since been updated to remove section on Identifiable Abort. See https:\/\/eprint.iacr.org\/archive\/2022\/374\/20220322:132756. ."},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1145\/3243734.3243788"},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1145\/322186.322188"},{"key":"e_1_3_2_1_45_1","volume-title":"EUROCRYPT'91","author":"Pedersen Torben P.","year":"1991","unstructured":"Torben P. Pedersen. 1991. A Threshold Cryptosystem without a Trusted Party (Extended Abstract) (Rump Session). In EUROCRYPT'91."},{"key":"e_1_3_2_1_46_1","volume-title":"Non-Interactive and Information-Theoretic Secure Verifiable Secret Sharing. In CRYPTO'91","author":"Pedersen Torben P.","year":"1992","unstructured":"Torben P. Pedersen. 1992. Non-Interactive and Information-Theoretic Secure Verifiable Secret Sharing. In CRYPTO'91."},{"key":"e_1_3_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-92548-2_7"},{"key":"e_1_3_2_1_48_1","doi-asserted-by":"crossref","unstructured":"Berry Schoenmakers and Meilof Veeningen. 2015. Universally Verifiable Multiparty Computation from Threshold Homomorphic Cryptosystems. In ACNS 15.","DOI":"10.1007\/978-3-319-28166-7_1"},{"key":"e_1_3_2_1_49_1","unstructured":"Victor Shoup. 2023. The many faces of Schnorr. IACR Cryptol. ePrint Arch. (2023) 1019. https:\/\/eprint.iacr.org\/2023\/1019"},{"key":"e_1_3_2_1_50_1","volume-title":"Eigenlayer: The restaking collective. White paper","author":"Team EigenLayer","year":"2024","unstructured":"EigenLayer Team. 2024. Eigenlayer: The restaking collective. White paper (2024), 1-19."},{"key":"e_1_3_2_1_51_1","volume-title":"Unstoppable Wallets: Chain-assisted Threshold ECDSA and its Applications. IACR Cryptol. ePrint Arch.","author":"Zyskind Guy","year":"2023","unstructured":"Guy Zyskind, Avishay Yanai, and Alex 'Sandy' Pentland. 2023. Unstoppable Wallets: Chain-assisted Threshold ECDSA and its Applications. IACR Cryptol. ePrint Arch. (2023), 832. https:\/\/eprint.iacr.org\/2023\/832"}],"event":{"name":"CCS '25: ACM SIGSAC Conference on Computer and Communications Security","location":"Taipei Taiwan","acronym":"CCS '25","sponsor":["SIGSAC ACM Special Interest Group on Security, Audit, and Control"]},"container-title":["Proceedings of the 2025 ACM SIGSAC Conference on Computer and Communications Security"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3719027.3765041","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,12,22]],"date-time":"2025-12-22T22:26:30Z","timestamp":1766442390000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3719027.3765041"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,11,19]]},"references-count":51,"alternative-id":["10.1145\/3719027.3765041","10.1145\/3719027"],"URL":"https:\/\/doi.org\/10.1145\/3719027.3765041","relation":{},"subject":[],"published":{"date-parts":[[2025,11,19]]},"assertion":[{"value":"2025-11-22","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}