{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,11]],"date-time":"2026-04-11T02:13:02Z","timestamp":1775873582556,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":50,"publisher":"ACM","license":[{"start":{"date-parts":[[2022,11,7]],"date-time":"2022-11-07T00:00:00Z","timestamp":1667779200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"Deutsche Forschungsgemeinschaft (DFG, German Research Foundation)","award":["507237585"],"award-info":[{"award-number":["507237585"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2022,11,7]]},"DOI":"10.1145\/3548606.3560656","type":"proceedings-article","created":{"date-parts":[[2022,11,7]],"date-time":"2022-11-07T11:41:28Z","timestamp":1667821288000},"page":"193-207","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":75,"title":["On the Adaptive Security of the Threshold BLS Signature Scheme"],"prefix":"10.1145","author":[{"given":"Renas","family":"Bacho","sequence":"first","affiliation":[{"name":"CISPA Helmoltz Center for Information Security, Saarbr\u00fccken, Germany"}]},{"given":"Julian","family":"Loss","sequence":"additional","affiliation":[{"name":"CISPA Helmoltz Center for Information Security, Saarbr\u00fccken, Germany"}]}],"member":"320","published-online":{"date-parts":[[2022,11,7]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"2022. Chia Network FAQ. (2022). https:\/\/www.chia.net\/faq\/.  2022. Chia Network FAQ. (2022). https:\/\/www.chia.net\/faq\/."},{"key":"e_1_3_2_1_2_1","volume-title":"Revisited. In 38th ACM Symposium Annual on Principles of Distributed Computing, Peter Robinson and Faith Ellen (Eds.). Association for Computing Machinery","author":"Abraham Ittai","year":"2019","unstructured":"Ittai Abraham , T.-H. Hubert Chan , Danny Dolev , Kartik Nayak , Rafael Pass , Ling Ren , and Elaine Shi . 2019 . Communication Complexity of Byzantine Agreement , Revisited. In 38th ACM Symposium Annual on Principles of Distributed Computing, Peter Robinson and Faith Ellen (Eds.). Association for Computing Machinery , Toronto, ON, Canada, 317--326. https:\/\/doi.org\/10.1145\/3293611.3331629 10.1145\/3293611.3331629 Ittai Abraham, T.-H. Hubert Chan, Danny Dolev, Kartik Nayak, Rafael Pass, Ling Ren, and Elaine Shi. 2019. Communication Complexity of Byzantine Agreement, Revisited. In 38th ACM Symposium Annual on Principles of Distributed Computing, Peter Robinson and Faith Ellen (Eds.). Association for Computing Machinery, Toronto, ON, Canada, 317--326. https:\/\/doi.org\/10.1145\/3293611.3331629"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-32101-7_20"},{"key":"e_1_3_2_1_4_1","volume-title":"Reaching Consensus for Asynchronous Distributed Key Generation. In 40th ACM Symposium Annual on Principles of Distributed Computing. Association for Computing Machinery","author":"Abraham Ittai","year":"2021","unstructured":"Ittai Abraham , Philipp Jovanovic , Mary Maller , Sarah Meiklejohn , Gilad Stern , and Alin Tomescu . 2021 . Reaching Consensus for Asynchronous Distributed Key Generation. In 40th ACM Symposium Annual on Principles of Distributed Computing. Association for Computing Machinery , Portland, OR, USA, 363--373. Ittai Abraham, Philipp Jovanovic, Mary Maller, Sarah Meiklejohn, Gilad Stern, and Alin Tomescu. 2021. Reaching Consensus for Asynchronous Distributed Key Generation. In 40th ACM Symposium Annual on Principles of Distributed Computing. Association for Computing Machinery, Portland, OR, USA, 363--373."},{"key":"e_1_3_2_1_5_1","volume-title":"38th ACM Symposium Annual on Principles of Distributed Computing","author":"Abraham Ittai","unstructured":"Ittai Abraham , Dahlia Malkhi , and Alexander Spiegelman . 2019. Asymptotically Optimal Validated Asynchronous Byzantine Agreement . In 38th ACM Symposium Annual on Principles of Distributed Computing , Peter Robinson and Faith Ellen (Eds.). Association for Computing Machinery , Toronto, ON , Canada, 337--346. https:\/\/doi.org\/10.1145\/3293611.3331612 10.1145\/3293611.3331612 Ittai Abraham, Dahlia Malkhi, and Alexander Spiegelman. 2019. Asymptotically Optimal Validated Asynchronous Byzantine Agreement. In 38th ACM Symposium Annual on Principles of Distributed Computing, Peter Robinson and Faith Ellen (Eds.). Association for Computing Machinery, Toronto, ON, Canada, 337--346. https:\/\/doi.org\/10.1145\/3293611.3331612"},{"key":"e_1_3_2_1_7_1","volume-title":"Advances in Cryptology -- CRYPTO","author":"Alper Handan Kilin\u00e7","year":"2021","unstructured":"Handan Kilin\u00e7 Alper and Jeffrey Burdges . 2021. Two-Round Trip Schnorr Multisignatures via Delinearized Witnesses . In Advances in Cryptology -- CRYPTO 2021 , Part I (Lecture Notes in Computer Science), Tal Malkin and Chris Peikert (Eds.), Vol. 12825 . Springer , Heidelberg, Germany, Virtual Event, 157--188. https:\/\/doi. org\/10.1007\/978-3-030-84242-0_7 Handan Kilin\u00e7 Alper and Jeffrey Burdges. 2021. Two-Round Trip Schnorr Multisignatures via Delinearized Witnesses. In Advances in Cryptology -- CRYPTO 2021, Part I (Lecture Notes in Computer Science), Tal Malkin and Chris Peikert (Eds.), Vol. 12825. Springer, Heidelberg, Germany, Virtual Event, 157--188. https:\/\/doi. org\/10.1007\/978-3-030-84242-0_7"},{"key":"#cr-split#-e_1_3_2_1_8_1.1","doi-asserted-by":"crossref","unstructured":"Diego F. Aranha Anders P. K. Dalskov Daniel Escudero and Claudio Orlandi. 2021. Improved Threshold Signatures Proactive Secret Sharing and Input Certification from LSS Isomorphisms. In Progress in Cryptology - LATINCRYPT 2021: 7th International Conference on Cryptology and Information Security in Latin America (Lecture Notes in Computer Science) Patrick Longa and Carla R\u00e0fols (Eds.) Vol. 12912. Springer Heidelberg Germany Bogot\u00e1 Colombia 382--404. https:\/\/doi.org\/10.1007\/978-3-030-88238-9_19 10.1007\/978-3-030-88238-9_19","DOI":"10.1007\/978-3-030-88238-9_19"},{"key":"#cr-split#-e_1_3_2_1_8_1.2","doi-asserted-by":"crossref","unstructured":"Diego F. Aranha Anders P. K. Dalskov Daniel Escudero and Claudio Orlandi. 2021. Improved Threshold Signatures Proactive Secret Sharing and Input Certification from LSS Isomorphisms. In Progress in Cryptology - LATINCRYPT 2021: 7th International Conference on Cryptology and Information Security in Latin America (Lecture Notes in Computer Science) Patrick Longa and Carla R\u00e0fols (Eds.) Vol. 12912. Springer Heidelberg Germany Bogot\u00e1 Colombia 382--404. https:\/\/doi.org\/10.1007\/978-3-030-88238-9_19","DOI":"10.1007\/978-3-030-88238-9_19"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-56880-1_5"},{"key":"e_1_3_2_1_10_1","volume-title":"ACM CCS 2006: 13th Conference on Computer and Communications Security, Ari Juels, Rebecca N. Wright, and Sabrina De Capitani di Vimercati (Eds.). ACM Press","author":"Bellare Mihir","year":"2006","unstructured":"Mihir Bellare and Gregory Neven . 2006 . Multi-signatures in the plain publicKey model and a general forking lemma . In ACM CCS 2006: 13th Conference on Computer and Communications Security, Ari Juels, Rebecca N. Wright, and Sabrina De Capitani di Vimercati (Eds.). ACM Press , Alexandria, Virginia, USA, 390--399. https:\/\/doi.org\/10.1145\/1 180405.1180453 10.1145\/1180405.1180453 Mihir Bellare and Gregory Neven. 2006. Multi-signatures in the plain publicKey model and a general forking lemma. In ACM CCS 2006: 13th Conference on Computer and Communications Security, Ari Juels, Rebecca N. Wright, and Sabrina De Capitani di Vimercati (Eds.). ACM Press, Alexandria, Virginia, USA, 390--399. https:\/\/doi.org\/10.1145\/1180405.1180453"},{"key":"e_1_3_2_1_11_1","volume-title":"TCC 2020: 18th Theory of Cryptography Conference, Part I (Lecture Notes in Computer Science)","author":"Blum Erica","unstructured":"Erica Blum , Jonathan Katz , Chen-Da Liu-Zhang , and Julian Loss . 2020. Asynchronous Byzantine Agreement with Subquadratic Communication . In TCC 2020: 18th Theory of Cryptography Conference, Part I (Lecture Notes in Computer Science) , Rafael Pass and Krzysztof Pietrzak (Eds.), Vol. 12550 . Springer , Heidelberg, Germany , Durham, NC, USA, 353--380. https:\/\/doi.org\/10.1007\/978-3-030-64375-1_13 10.1007\/978-3-030-64375-1_13 Erica Blum, Jonathan Katz, Chen-Da Liu-Zhang, and Julian Loss. 2020. Asynchronous Byzantine Agreement with Subquadratic Communication. In TCC 2020: 18th Theory of Cryptography Conference, Part I (Lecture Notes in Computer Science), Rafael Pass and Krzysztof Pietrzak (Eds.), Vol. 12550. Springer, Heidelberg, Germany, Durham, NC, USA, 353--380. https:\/\/doi.org\/10.1007\/978-3-030-64375-1_13"},{"key":"e_1_3_2_1_12_1","volume-title":"PKC 2003: 6th International Workshop on Theory and Practice in Public Key Cryptography (Lecture Notes in Computer Science)","author":"Boldyreva Alexandra","unstructured":"Alexandra Boldyreva . 2003. Threshold Signatures , Multisignatures and Blind Signatures Based on the Gap-Diffie-Hellman-Group Signature Scheme . In PKC 2003: 6th International Workshop on Theory and Practice in Public Key Cryptography (Lecture Notes in Computer Science) , Yvo Desmedt (Ed.), Vol. 2567 . Springer , Heidelberg, Germany , Miami, FL, USA, 31--46. https:\/\/doi.org\/10.1007\/3-540-36288-6_3 10.1007\/3-540-36288-6_3 Alexandra Boldyreva. 2003. Threshold Signatures, Multisignatures and Blind Signatures Based on the Gap-Diffie-Hellman-Group Signature Scheme. In PKC 2003: 6th International Workshop on Theory and Practice in Public Key Cryptography (Lecture Notes in Computer Science), Yvo Desmedt (Ed.), Vol. 2567. Springer, Heidelberg, Germany, Miami, FL, USA, 31--46. https:\/\/doi.org\/10.1007\/3-540-36288-6_3"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-03329-3_15"},{"key":"e_1_3_2_1_14_1","volume-title":"Progress in Cryptology - LATINCRYPT 2017: 5th International Conference on Cryptology and Information Security in Latin America (Lecture Notes in Computer Science)","author":"Boneh Dan","unstructured":"Dan Boneh , Rosario Gennaro , and Steven Goldfeder . 2017. Using Level-1 Homomorphic Encryption to Improve Threshold DSA Signatures for Bitcoin Wallet Security . In Progress in Cryptology - LATINCRYPT 2017: 5th International Conference on Cryptology and Information Security in Latin America (Lecture Notes in Computer Science) , Tanja Lange and Orr Dunkelman (Eds.), Vol. 11368 . Springer , Heidelberg, Germany , Havana, Cuba, 352--377. https:\/\/doi.org\/10.1007\/978-3-030-25283-0_19 10.1007\/978-3-030-25283-0_19 Dan Boneh, Rosario Gennaro, and Steven Goldfeder. 2017. Using Level-1 Homomorphic Encryption to Improve Threshold DSA Signatures for Bitcoin Wallet Security. In Progress in Cryptology - LATINCRYPT 2017: 5th International Conference on Cryptology and Information Security in Latin America (Lecture Notes in Computer Science), Tanja Lange and Orr Dunkelman (Eds.), Vol. 11368. Springer, Heidelberg, Germany, Havana, Cuba, 352--377. https:\/\/doi.org\/10.1007\/978-3-030-25283-0_19"},{"key":"e_1_3_2_1_15_1","volume-title":"Asynchronous Verifiable Secret Sharing and Proactive Cryptosystems. In ACM CCS 2002: 9th Conference on Computer and Communications Security, Vijayalakshmi Atluri (Ed.). ACM Press","author":"Cachin Christian","year":"2002","unstructured":"Christian Cachin , Klaus Kursawe , Anna Lysyanskaya , and Reto Strobl . 2002 . Asynchronous Verifiable Secret Sharing and Proactive Cryptosystems. In ACM CCS 2002: 9th Conference on Computer and Communications Security, Vijayalakshmi Atluri (Ed.). ACM Press , Washington, DC, USA, 88--97. https:\/\/doi.org\/10.1145\/586110.586124 10.1145\/586110.586124 Christian Cachin, Klaus Kursawe, Anna Lysyanskaya, and Reto Strobl. 2002. Asynchronous Verifiable Secret Sharing and Proactive Cryptosystems. In ACM CCS 2002: 9th Conference on Computer and Communications Security, Vijayalakshmi Atluri (Ed.). ACM Press, Washington, DC, USA, 88--97. https:\/\/doi.org\/10.1145\/586110.586124"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/343477.343531"},{"key":"e_1_3_2_1_17_1","volume-title":"Threshold ECDSA with Identifiable Aborts. In ACM CCS 2020: 27th Conference on Computer and Communications Security, Jay Ligatti, Xinming Ou, Jonathan Katz, and Giovanni Vigna (Eds.). ACM Press","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: 27th Conference on Computer and Communications Security, Jay Ligatti, Xinming Ou, Jonathan Katz, and Giovanni Vigna (Eds.). ACM Press , Virtual Event, USA, 1769--1787. https:\/\/doi.org\/10.1145\/3372297.3423367 10.1145\/3372297.3423367 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: 27th Conference on Computer and Communications Security, Jay Ligatti, Xinming Ou, Jonathan Katz, and Giovanni Vigna (Eds.). ACM Press, Virtual Event, USA, 1769--1787. https:\/\/doi.org\/10.1145\/3372297.3423367"},{"key":"e_1_3_2_1_19_1","volume-title":"Advances in Cryptology -- CRYPTO'99 (Lecture Notes in Computer Science), Michael J","author":"Canetti Ran","unstructured":"Ran Canetti , Rosario Gennaro , Stanislaw Jarecki , Hugo Krawczyk , and Tal Rabin . 1999. Adaptive Security for Threshold Cryptosystems . In Advances in Cryptology -- CRYPTO'99 (Lecture Notes in Computer Science), Michael J . Wiener (Ed.), Vol. 1666 . Springer, Heidelberg , Germany, Santa Barbara, CA, USA, 98--115. https:\/\/doi.org\/ 10.1007\/3-540-48405-1_7 10.1007\/3-540-48405-1_7 Ran Canetti, Rosario Gennaro, Stanislaw Jarecki, Hugo Krawczyk, and Tal Rabin. 1999. Adaptive Security for Threshold Cryptosystems. In Advances in Cryptology -- CRYPTO'99 (Lecture Notes in Computer Science), Michael J. Wiener (Ed.), Vol. 1666. Springer, Heidelberg, Germany, Santa Barbara, CA, USA, 98--115. https:\/\/doi.org\/ 10.1007\/3-540-48405-1_7"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/167088.167105"},{"key":"e_1_3_2_1_21_1","volume-title":"34th International Symposium on Distributed Computing (LIPICS)","volume":"25","author":"Cohen Shir","year":"2020","unstructured":"Shir Cohen , Idit Keidar , and Alexander Spiegelman . 2020 . Not a COINcidence: Sub-Quadratic Asynchronous Byzantine Agreement WHP . In 34th International Symposium on Distributed Computing (LIPICS) , Vol. 25 . Schloss Dagstuhl- LeibnizZentrum fur Informatik GmbH, Dagstuhl Publishing, 1--25. Shir Cohen, Idit Keidar, and Alexander Spiegelman. 2020. Not a COINcidence: Sub-Quadratic Asynchronous Byzantine Agreement WHP. In 34th International Symposium on Distributed Computing (LIPICS), Vol. 25. Schloss Dagstuhl- LeibnizZentrum fur Informatik GmbH, Dagstuhl Publishing, 1--25."},{"key":"e_1_3_2_1_22_1","volume-title":"Advances in Cryptology -- EUROCRYPT 2002 (Lecture Notes in Computer Science), Lars R","author":"Coron Jean-S\u00e9bastien","unstructured":"Jean-S\u00e9bastien Coron . 2002. Optimal Security Proofs for PSS and Other Signature Schemes . In Advances in Cryptology -- EUROCRYPT 2002 (Lecture Notes in Computer Science), Lars R . Knudsen (Ed.), Vol. 2332 . Springer , Heidelberg, Germany , Amsterdam, The Netherlands, 272--287. https:\/\/doi.org\/10.1007\/3-540-46035-7_18 10.1007\/3-540-46035-7_18 Jean-S\u00e9bastien Coron. 2002. Optimal Security Proofs for PSS and Other Signature Schemes. In Advances in Cryptology -- EUROCRYPT 2002 (Lecture Notes in Computer Science), Lars R. Knudsen (Ed.), Vol. 2332. Springer, Heidelberg, Germany, Amsterdam, The Netherlands, 272--287. https:\/\/doi.org\/10.1007\/3-540-46035-7_18"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-59013-0_32"},{"key":"e_1_3_2_1_25_1","volume-title":"Practical Asynchronous Distributed Key Generation. In 43rd IEEE Symposium on Security and Privacy (to appear). IEEE Computer Society Press","author":"Das Sourav","year":"2022","unstructured":"Sourav Das , Tom Yurek , Zhuolun Xiang , Andrew Miller , Lefteris Kokoris-Kogias , and Ling Ren . 2022 . Practical Asynchronous Distributed Key Generation. In 43rd IEEE Symposium on Security and Privacy (to appear). IEEE Computer Society Press , San Francisco, CA, USA. Sourav Das, Tom Yurek, Zhuolun Xiang, Andrew Miller, Lefteris Kokoris-Kogias, and Ling Ren. 2022. Practical Asynchronous Distributed Key Generation. In 43rd IEEE Symposium on Security and Privacy (to appear). IEEE Computer Society Press, San Francisco, CA, USA."},{"key":"e_1_3_2_1_26_1","volume-title":"Advances in Cryptology -- CRYPTO'87 (Lecture Notes in Computer Science)","author":"Desmedt Yvo","unstructured":"Yvo Desmedt . 1988. Society and Group Oriented Cryptography: A New Concept . In Advances in Cryptology -- CRYPTO'87 (Lecture Notes in Computer Science) , Carl Pomerance (Ed.), Vol. 293 . Springer , Heidelberg, Germany , Santa Barbara, CA, USA, 120--127. https:\/\/doi.org\/10.1007\/3-540-48184-2_8 10.1007\/3-540-48184-2_8 Yvo Desmedt. 1988. Society and Group Oriented Cryptography: A New Concept. In Advances in Cryptology -- CRYPTO'87 (Lecture Notes in Computer Science), Carl Pomerance (Ed.), Vol. 293. Springer, Heidelberg, Germany, Santa Barbara, CA, USA, 120--127. https:\/\/doi.org\/10.1007\/3-540-48184-2_8"},{"key":"e_1_3_2_1_27_1","volume-title":"On the Security of Two-Round Multi Signatures. In 2019 IEEE Symposium on Security and Privacy. IEEE Computer Society Press","author":"Drijvers Manu","year":"2019","unstructured":"Manu Drijvers , Kasra Edalatnejad , Bryan Ford , Eike Kiltz , Julian Loss , Gregory Neven , and Igors Stepanovs . 2019 . On the Security of Two-Round Multi Signatures. In 2019 IEEE Symposium on Security and Privacy. IEEE Computer Society Press , San Francisco, CA, USA, 1084--1101. https:\/\/doi.org\/10.1109\/SP. 2019.00050 10.1109\/SP Manu Drijvers, Kasra Edalatnejad, Bryan Ford, Eike Kiltz, Julian Loss, Gregory Neven, and Igors Stepanovs. 2019. On the Security of Two-Round Multi Signatures. In 2019 IEEE Symposium on Security and Privacy. IEEE Computer Society Press, San Francisco, CA, USA, 1084--1101. https:\/\/doi.org\/10.1109\/SP. 2019.00050"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/3149.214121"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-96881-0_2"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-45724-2_3"},{"key":"e_1_3_2_1_31_1","volume-title":"ACM CCS 2018: 25th Conference on Computer and Communications Security","author":"Gennaro Rosario","unstructured":"Rosario Gennaro and Steven Goldfeder . 2018. Fast Multiparty Threshold ECDSA with Fast Trustless Setup . In ACM CCS 2018: 25th Conference on Computer and Communications Security , David Lie, Mohammad Mannan, Michael Backes, and XiaoFeng Wang (Eds.). ACM Press , Toronto, ON , Canada, 1179--1194. https: \/\/doi.org\/10.1145\/3243734.3243859 10.1145\/3243734.3243859 Rosario Gennaro and Steven Goldfeder. 2018. Fast Multiparty Threshold ECDSA with Fast Trustless Setup. In ACM CCS 2018: 25th Conference on Computer and Communications Security, David Lie, Mohammad Mannan, Michael Backes, and XiaoFeng Wang (Eds.). ACM Press, Toronto, ON, Canada, 1179--1194. https: \/\/doi.org\/10.1145\/3243734.3243859"},{"key":"e_1_3_2_1_32_1","volume-title":"ACNS 16: 14th International Conference on Applied Cryptography and Network Security (Lecture Notes in Computer Science), Mark Manulis, Ahmad-Reza Sadeghi, and Steve Schneider (Eds.)","volume":"9696","author":"Gennaro Rosario","year":"2016","unstructured":"Rosario Gennaro , Steven Goldfeder , and Arvind Narayanan . 2016 . ThresholdOptimal DSA\/ECDSA Signatures and an Application to Bitcoin Wallet Security . In ACNS 16: 14th International Conference on Applied Cryptography and Network Security (Lecture Notes in Computer Science), Mark Manulis, Ahmad-Reza Sadeghi, and Steve Schneider (Eds.) , Vol. 9696 . Springer, Heidelberg, Germany, Guildford, UK, 156--174. https:\/\/doi.org\/10.1007\/978-3-319-39555-5_9 10.1007\/978-3-319-39555-5_9 Rosario Gennaro, Steven Goldfeder, and Arvind Narayanan. 2016. ThresholdOptimal DSA\/ECDSA Signatures and an Application to Bitcoin Wallet Security. In ACNS 16: 14th International Conference on Applied Cryptography and Network Security (Lecture Notes in Computer Science), Mark Manulis, Ahmad-Reza Sadeghi, and Steve Schneider (Eds.), Vol. 9696. Springer, Heidelberg, Germany, Guildford, UK, 156--174. https:\/\/doi.org\/10.1007\/978-3-319-39555-5_9"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00145-006-0347-3"},{"key":"e_1_3_2_1_34_1","volume-title":"Dumbo: Faster Asynchronous BFT Protocols. In ACM CCS 2020: 27th Conference on Computer and Communications Security, Jay Ligatti, Xinming Ou, Jonathan Katz, and Giovanni Vigna (Eds.). ACM Press","author":"Guo Bingyong","year":"2020","unstructured":"Bingyong Guo , Zhenliang Lu , Qiang Tang , Jing Xu , and Zhenfeng Zhang . 2020 . Dumbo: Faster Asynchronous BFT Protocols. In ACM CCS 2020: 27th Conference on Computer and Communications Security, Jay Ligatti, Xinming Ou, Jonathan Katz, and Giovanni Vigna (Eds.). ACM Press , Virtual Event, USA, 803--818. https: \/\/doi.org\/10.1145\/3372297.3417262 10.1145\/3372297.3417262 Bingyong Guo, Zhenliang Lu, Qiang Tang, Jing Xu, and Zhenfeng Zhang. 2020. Dumbo: Faster Asynchronous BFT Protocols. In ACM CCS 2020: 27th Conference on Computer and Communications Security, Jay Ligatti, Xinming Ou, Jonathan Katz, and Giovanni Vigna (Eds.). ACM Press, Virtual Event, USA, 803--818. https: \/\/doi.org\/10.1145\/3372297.3417262"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45539-6_16"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00145-017-9257-9"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-97131-1_16"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1145\/3372297.3423364"},{"key":"e_1_3_2_1_39_1","volume-title":"FROST: Flexible Round-Optimized Schnorr Threshold Signatures. In Selected Areas in Cryptography-SAC. 34--65.","author":"Komlo Chelsea","year":"2020","unstructured":"Chelsea Komlo and Ian Goldberg . 2020 . FROST: Flexible Round-Optimized Schnorr Threshold Signatures. In Selected Areas in Cryptography-SAC. 34--65. Chelsea Komlo and Ian Goldberg. 2020. FROST: Flexible Round-Optimized Schnorr Threshold Signatures. In Selected Areas in Cryptography-SAC. 34--65."},{"key":"e_1_3_2_1_40_1","volume-title":"Refresh When You Wake Up: Proactive Threshold Wallets with Offline Devices. In 2021 IEEE Symposium on Security and Privacy. IEEE Computer Society Press","author":"Kondi Yashvanth","year":"2021","unstructured":"Yashvanth Kondi , Bernardo Magri , Claudio Orlandi , and Omer Shlomovits . 2021 . Refresh When You Wake Up: Proactive Threshold Wallets with Offline Devices. In 2021 IEEE Symposium on Security and Privacy. IEEE Computer Society Press , San Francisco, CA, USA, 608--625. https:\/\/doi.org\/10.1109\/SP40001. 2021.00067 10.1109\/SP40001.2021.00067 Yashvanth Kondi, Bernardo Magri, Claudio Orlandi, and Omer Shlomovits. 2021. Refresh When You Wake Up: Proactive Threshold Wallets with Offline Devices. In 2021 IEEE Symposium on Security and Privacy. IEEE Computer Society Press, San Francisco, CA, USA, 608--625. https:\/\/doi.org\/10.1109\/SP40001.2021.00067"},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1145\/2611462.2611498"},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-63715-0_21"},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1145\/3243734.3243788"},{"key":"e_1_3_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.1145\/3382734.3405707"},{"key":"e_1_3_2_1_48_1","volume-title":"Very Simple and Efficient Byzantine Agreement. In ITCS 2017: 8th Innovations in Theoretical Computer Science Conference, Christos H. Papadimitriou (Ed.)","volume":"4266","author":"Micali Silvio","year":"2017","unstructured":"Silvio Micali . 2017 . Very Simple and Efficient Byzantine Agreement. In ITCS 2017: 8th Innovations in Theoretical Computer Science Conference, Christos H. Papadimitriou (Ed.) , Vol. 4266 . LIPIcs, Berkeley, CA, USA, 6:1--6:1. https:\/\/doi. org\/10.4230\/LIPIcs.ITCS. 2017.6 Silvio Micali. 2017. Very Simple and Efficient Byzantine Agreement. In ITCS 2017: 8th Innovations in Theoretical Computer Science Conference, Christos H. Papadimitriou (Ed.), Vol. 4266. LIPIcs, Berkeley, CA, USA, 6:1--6:1. https:\/\/doi. org\/10.4230\/LIPIcs.ITCS.2017.6"},{"key":"e_1_3_2_1_49_1","volume-title":"Verifiable Random Functions. In 40th Annual Symposium on Foundations of Computer Science. IEEE Computer Society Press","author":"Micali Silvio","year":"1999","unstructured":"Silvio Micali , Michael O. Rabin , and Salil P. Vadhan . 1999 . Verifiable Random Functions. In 40th Annual Symposium on Foundations of Computer Science. IEEE Computer Society Press , New York, NY, USA, 120--130. https:\/\/doi.org\/10.1109\/ SFFCS. 1999 .814584 Silvio Micali, Michael O. Rabin, and Salil P. Vadhan. 1999. Verifiable Random Functions. In 40th Annual Symposium on Foundations of Computer Science. IEEE Computer Society Press, New York, NY, USA, 120--130. https:\/\/doi.org\/10.1109\/ SFFCS.1999.814584"},{"key":"e_1_3_2_1_50_1","unstructured":"Fabrice Mouhartem. 2018. Implementation of Libert et al.'s Threshold BLS Signature. (2018). https:\/\/gitlab.inria.fr\/fmouhart\/threshold-signature.  Fabrice Mouhartem. 2018. Implementation of Libert et al.'s Threshold BLS Signature. (2018). https:\/\/gitlab.inria.fr\/fmouhart\/threshold-signature."},{"key":"e_1_3_2_1_51_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-84242-0_8"},{"key":"e_1_3_2_1_52_1","volume-title":"ACM CCS 2020: 27th Conference on Computer and Communications Security","author":"Nick Jonas","unstructured":"Jonas Nick , Tim Ruffing , Yannick Seurin , and Pieter Wuille . 2020. MuSig-DN: Schnorr Multi-Signatures with Verifiably Deterministic Nonces . In ACM CCS 2020: 27th Conference on Computer and Communications Security , Jay Ligatti, Xinming Ou, Jonathan Katz, and Giovanni Vigna (Eds.). ACM Press , Virtual Event, USA , 1717--1731. https:\/\/doi.org\/10.1145\/3372297.3417236 10.1145\/3372297.3417236 Jonas Nick, Tim Ruffing, Yannick Seurin, and Pieter Wuille. 2020. MuSig-DN: Schnorr Multi-Signatures with Verifiably Deterministic Nonces. In ACM CCS 2020: 27th Conference on Computer and Communications Security, Jay Ligatti, Xinming Ou, Jonathan Katz, and Giovanni Vigna (Eds.). ACM Press, Virtual Event, USA, 1717--1731. https:\/\/doi.org\/10.1145\/3372297.3417236"},{"key":"e_1_3_2_1_53_1","volume-title":"Advances in Cryptology -- CRYPTO'91 (Lecture Notes in Computer Science)","author":"Pedersen Torben P.","unstructured":"Torben P. Pedersen . 1992. Non-Interactive and Information-Theoretic Secure Verifiable Secret Sharing . In Advances in Cryptology -- CRYPTO'91 (Lecture Notes in Computer Science) , Joan Feigenbaum (Ed.), Vol. 576 . Springer, Heidelberg , Germany, Santa Barbara, CA, USA, 129--140. https:\/\/doi.org\/10.1007\/3-540-46766-1_9 10.1007\/3-540-46766-1_9 Torben P. Pedersen. 1992. Non-Interactive and Information-Theoretic Secure Verifiable Secret Sharing. In Advances in Cryptology -- CRYPTO'91 (Lecture Notes in Computer Science), Joan Feigenbaum (Ed.), Vol. 576. Springer, Heidelberg, Germany, Santa Barbara, CA, USA, 129--140. https:\/\/doi.org\/10.1007\/3-540-46766-1_9"},{"key":"e_1_3_2_1_54_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45539-6_15"},{"key":"e_1_3_2_1_56_1","doi-asserted-by":"crossref","unstructured":"Stefano Tessaro and Chenzhi Zhu. 2022. Short Pairing-Free Blind Signatures with Exponential Security. In Advances in Cryptology - EUROCRYPT (to appear).  Stefano Tessaro and Chenzhi Zhu. 2022. Short Pairing-Free Blind Signatures with Exponential Security. In Advances in Cryptology - EUROCRYPT (to appear).","DOI":"10.1007\/978-3-031-07085-3_27"}],"event":{"name":"CCS '22: 2022 ACM SIGSAC Conference on Computer and Communications Security","location":"Los Angeles CA USA","acronym":"CCS '22","sponsor":["SIGSAC ACM Special Interest Group on Security, Audit, and Control"]},"container-title":["Proceedings of the 2022 ACM SIGSAC Conference on Computer and Communications Security"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3548606.3560656","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3548606.3560656","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T17:48:59Z","timestamp":1750182539000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3548606.3560656"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,11,7]]},"references-count":50,"alternative-id":["10.1145\/3548606.3560656","10.1145\/3548606"],"URL":"https:\/\/doi.org\/10.1145\/3548606.3560656","relation":{},"subject":[],"published":{"date-parts":[[2022,11,7]]},"assertion":[{"value":"2022-11-07","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}