{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,2]],"date-time":"2026-07-02T15:49:27Z","timestamp":1783007367831,"version":"3.54.5"},"publisher-location":"New York, NY, USA","reference-count":30,"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"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2022,11,7]]},"DOI":"10.1145\/3548606.3559397","type":"proceedings-article","created":{"date-parts":[[2022,11,7]],"date-time":"2022-11-07T11:41:28Z","timestamp":1667821288000},"page":"323-336","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":17,"title":["Threshold Cryptography as a Service (in the Multiserver and YOSO Models)"],"prefix":"10.1145","author":[{"given":"Fabrice","family":"Benhamouda","sequence":"first","affiliation":[{"name":"Algorand Foundation, New York, NY, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Shai","family":"Halevi","sequence":"additional","affiliation":[{"name":"Algorand Foundation, New York, NY, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Hugo","family":"Krawczyk","sequence":"additional","affiliation":[{"name":"Algorand Foundation, New York, NY, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Alex","family":"Miao","sequence":"additional","affiliation":[{"name":"No affiliation, New York, NY, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Tal","family":"Rabin","sequence":"additional","affiliation":[{"name":"University of Pennsylvania & Algorand Foundation, New York, NY, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2022,11,7]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/2611462.2611474"},{"key":"e_1_3_2_1_2_1","volume-title":"ACNS 2015","author":"Baron Joshua","year":"2015","unstructured":"Joshua Baron , Karim El Defrawy , Joshua Lampkins , and Rafail Ostrovsky . 2015 . Communication-Optimal Proactive Secret Sharing for Dynamic Groups. In Applied Cryptography and Network Security - 13th International Conference , ACNS 2015 , New York, NY, USA , June 2-5, 2015, Revised Selected Papers (Lecture Notes in Computer Science, Vol. 9092), Tal Malkin, Vladimir Kolesnikov, Allison Bishop Lewko, and Michalis Polychronakis (Eds.). Springer, 23--41. https:\/\/doi.org\/10.1007\/978-3-319-28166-7_2 10.1007\/978-3-319-28166-7_2 Joshua Baron, Karim El Defrawy, Joshua Lampkins, and Rafail Ostrovsky. 2015. Communication-Optimal Proactive Secret Sharing for Dynamic Groups. In Applied Cryptography and Network Security - 13th International Conference, ACNS 2015, New York, NY, USA, June 2-5, 2015, Revised Selected Papers (Lecture Notes in Computer Science, Vol. 9092), Tal Malkin, Vladimir Kolesnikov, Allison Bishop Lewko, and Michalis Polychronakis (Eds.). Springer, 23--41. https:\/\/doi.org\/10.1007\/978-3-319-28166-7_2"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/248052.248090"},{"key":"e_1_3_2_1_4_1","volume-title":"Fast Batch Verification for Modular Exponentiation and Digital Signatures. In EUROCRYPT'98 (LNCS","volume":"250","author":"Bellare Mihir","year":"1998","unstructured":"Mihir Bellare , Juan A. Garay , and Tal Rabin . 1998 . Fast Batch Verification for Modular Exponentiation and Digital Signatures. In EUROCRYPT'98 (LNCS , Vol. 1403), , Kaisa Nyberg (Ed.). Springer, Heidelberg, 236-- 250 . https:\/\/doi.org\/10.1007\/BFb0054130 10.1007\/BFb0054130 Mihir Bellare, Juan A. Garay, and Tal Rabin. 1998. Fast Batch Verification for Modular Exponentiation and Digital Signatures. In EUROCRYPT'98 (LNCS, Vol. 1403), , Kaisa Nyberg (Ed.). Springer, Heidelberg, 236--250. https:\/\/doi.org\/10.1007\/BFb0054130"},{"key":"e_1_3_2_1_5_1","volume-title":"TCC 2020, Durham, NC, USA, November 16--19, 2020, Proceedings, Part I (Lecture Notes in Computer Science","volume":"290","author":"Benhamouda Fabrice","year":"2020","unstructured":"Fabrice Benhamouda , Craig Gentry , Sergey Gorbunov , Shai Halevi , Hugo Krawczyk , Chengyu Lin , Tal Rabin , and Leonid Reyzin . 2020 . Can a Public Blockchain Keep a Secret?. In Theory of Cryptography - 18th International Conference , TCC 2020, Durham, NC, USA, November 16--19, 2020, Proceedings, Part I (Lecture Notes in Computer Science , Vol. 12550), Rafael Pass and Krzysztof Pietrzak (Eds.). Springer, 260-- 290 . https:\/\/doi.org\/10.1007\/978-3-030-64375-1_10 10.1007\/978-3-030-64375-1_10 Fabrice Benhamouda, Craig Gentry, Sergey Gorbunov, Shai Halevi, Hugo Krawczyk, Chengyu Lin, Tal Rabin, and Leonid Reyzin. 2020. Can a Public Blockchain Keep a Secret?. In Theory of Cryptography - 18th International Conference, TCC 2020, Durham, NC, USA, November 16--19, 2020, Proceedings, Part I (Lecture Notes in Computer Science, Vol. 12550), Rafael Pass and Krzysztof Pietrzak (Eds.). Springer, 260--290. https:\/\/doi.org\/10.1007\/978-3-030-64375-1_10"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-64375-1_13"},{"key":"e_1_3_2_1_7_1","volume-title":"SCRAPE: Scalable Randomness Attested by Public Entities. In ACNS 17 (LNCS","author":"Cascudo Ignacio","year":"2017","unstructured":"Ignacio Cascudo and Bernardo David . 2017 . SCRAPE: Scalable Randomness Attested by Public Entities. In ACNS 17 (LNCS , Vol. 10355),, Dieter Gollmann, Atsuko Miyaji, and Hiroaki Kikuchi (Eds.). Springer, Heidelberg, 537-- 556 . https:\/\/doi.org\/10.1007\/978-3-319-61204-1_27 10.1007\/978-3-319-61204-1_27 Ignacio Cascudo and Bernardo David. 2017. SCRAPE: Scalable Randomness Attested by Public Entities. In ACNS 17 (LNCS, Vol. 10355),, Dieter Gollmann, Atsuko Miyaji, and Hiroaki Kikuchi (Eds.). Springer, Heidelberg, 537--556. https:\/\/doi.org\/10.1007\/978-3-319-61204-1_27"},{"key":"e_1_3_2_1_8_1","volume-title":"Vector Commitments and Their Applications. In PKC 2013 (LNCS","volume":"72","author":"Catalano Dario","year":"2013","unstructured":"Dario Catalano and Dario Fiore . 2013 . Vector Commitments and Their Applications. In PKC 2013 (LNCS , Vol. 7778), Kaoru Kurosawa and Goichiro Hanaoka (Eds.). Springer, Heidelberg, 55-- 72 . https:\/\/doi.org\/10.1007\/978-3-642-36362-7_5 10.1007\/978-3-642-36362-7_5 Dario Catalano and Dario Fiore. 2013. Vector Commitments and Their Applications. In PKC 2013 (LNCS, Vol. 7778), Kaoru Kurosawa and Goichiro Hanaoka (Eds.). Springer, Heidelberg, 55--72. https:\/\/doi.org\/10.1007\/978-3-642-36362-7_5"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2019.02.001"},{"key":"e_1_3_2_1_10_1","volume-title":"26th","author":"Chor Benny","year":"1985","unstructured":"Benny Chor , Shafi Goldwasser , Silvio Micali , and Baruch Awerbuch . 1985. Verifiable Secret Sharing and Achieving Simultaneity in the Presence of Faults (Extended Abstract) . In 26th FOCS. IEEE Computer Society Press , 383--395. https:\/\/doi.org\/10.1109\/SFCS. 1985 .64 10.1109\/SFCS.1985.64 Benny Chor, Shafi Goldwasser, Silvio Micali, and Baruch Awerbuch. 1985. Verifiable Secret Sharing and Achieving Simultaneity in the Presence of Faults (Extended Abstract). In 26th FOCS. IEEE Computer Society Press, 383--395. https:\/\/doi.org\/10.1109\/SFCS.1985.64"},{"key":"e_1_3_2_1_11_1","volume-title":"CRYPTO 2021, Virtual Event, August 16-20, 2021, Proceedings, Part II (Lecture Notes in Computer Science","volume":"123","author":"Choudhuri Arka Rai","year":"2021","unstructured":"Arka Rai Choudhuri , Aarushi Goel , Matthew Green , Abhishek Jain , and Gabriel Kaptchuk . 2021 . Fluid MPC: Secure Multiparty Computation with Dynamic Participants. In Advances in Cryptology - CRYPTO 2021 - 41st Annual International Cryptology Conference , CRYPTO 2021, Virtual Event, August 16-20, 2021, Proceedings, Part II (Lecture Notes in Computer Science , Vol. 12826), Tal Malkin and Chris Peikert (Eds.). Springer, 94-- 123 . https:\/\/doi.org\/10.1007\/978-3-030-84245-1_4 10.1007\/978-3-030-84245-1_4 Arka Rai Choudhuri, Aarushi Goel, Matthew Green, Abhishek Jain, and Gabriel Kaptchuk. 2021. Fluid MPC: Secure Multiparty Computation with Dynamic Participants. In Advances in Cryptology - CRYPTO 2021 - 41st Annual International Cryptology Conference, CRYPTO 2021, Virtual Event, August 16-20, 2021, Proceedings, Part II (Lecture Notes in Computer Science, Vol. 12826), Tal Malkin and Chris Peikert (Eds.). Springer, 94--123. https:\/\/doi.org\/10.1007\/978-3-030-84245-1_4"},{"key":"e_1_3_2_1_13_1","unstructured":"Ivan Damg\u00e5rd. 2010. On \u03a3 Protocols. https:\/\/cs.au.dk\/%7Eivan\/Sigma.pdf.  Ivan Damg\u00e5rd. 2010. On \u03a3 Protocols. https:\/\/cs.au.dk\/%7Eivan\/Sigma.pdf."},{"key":"e_1_3_2_1_14_1","volume-title":"Scalable Secure Multiparty Computation. In CRYPTO 2006 (LNCS","volume":"520","author":"Damg\u00e5rd Ivan","year":"2006","unstructured":"Ivan Damg\u00e5rd and Yuval Ishai . 2006 . Scalable Secure Multiparty Computation. In CRYPTO 2006 (LNCS , Vol. 4117), Cynthia Dwork (Ed.). Springer, Heidelberg, 501-- 520 . https:\/\/doi.org\/10.1007\/11818175_30 10.1007\/11818175_30 Ivan Damg\u00e5rd and Yuval Ishai. 2006. Scalable Secure Multiparty Computation. In CRYPTO 2006 (LNCS, Vol. 4117), Cynthia Dwork (Ed.). Springer, Heidelberg, 501--520. https:\/\/doi.org\/10.1007\/11818175_30"},{"key":"e_1_3_2_1_15_1","volume-title":"Scalable Multiparty Computation with Nearly Optimal Work and Resilience. In CRYPTO 2008 (LNCS","volume":"261","author":"Damg\u00e5rd Ivan","year":"2008","unstructured":"Ivan Damg\u00e5rd , Yuval Ishai , Mikkel Kr\u00f8igaard , Jesper Buus Nielsen , and Adam Smith . 2008 . Scalable Multiparty Computation with Nearly Optimal Work and Resilience. In CRYPTO 2008 (LNCS , Vol. 5157), , David Wagner (Ed.). Springer, Heidelberg, 241-- 261 . https:\/\/doi.org\/10.1007\/978-3-540-85174-5_14 10.1007\/978-3-540-85174-5_14 Ivan Damg\u00e5rd, Yuval Ishai, Mikkel Kr\u00f8igaard, Jesper Buus Nielsen, and Adam Smith. 2008. Scalable Multiparty Computation with Nearly Optimal Work and Resilience. In CRYPTO 2008 (LNCS, Vol. 5157), , David Wagner (Ed.). Springer, Heidelberg, 241--261. https:\/\/doi.org\/10.1007\/978-3-540-85174-5_14"},{"key":"e_1_3_2_1_16_1","unstructured":"Frank Denis. 2022. The Sodium cryptography library. https:\/\/download.libsodium.org\/doc\/  Frank Denis. 2022. The Sodium cryptography library. https:\/\/download.libsodium.org\/doc\/"},{"key":"e_1_3_2_1_17_1","volume-title":"Franklin and Moti Yung","author":"Matthew","year":"1992","unstructured":"Matthew K. Franklin and Moti Yung . 1992 . Communication Complexity of Secure Computation (Extended Abstract). In 24th ACM STOC. ACM Press , 699--710. https:\/\/doi.org\/10.1145\/129712.129780 10.1145\/129712.129780 Matthew K. Franklin and Moti Yung. 1992. Communication Complexity of Secure Computation (Extended Abstract). In 24th ACM STOC. ACM Press, 699--710. https:\/\/doi.org\/10.1145\/129712.129780"},{"key":"e_1_3_2_1_18_1","unstructured":"Sadayuki Furuhashi. 2013. MessagePack Serialization Format. https:\/\/msgpack.org\/  Sadayuki Furuhashi. 2013. MessagePack Serialization Format. https:\/\/msgpack.org\/"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00145-006-0347-3"},{"key":"e_1_3_2_1_20_1","volume-title":"17th ACM PODC,, Brian A","author":"Gennaro Rosario","unstructured":"Rosario Gennaro , Michael O. Rabin , and Tal Rabin . 1998. Simplified VSS and Fast-Track Multiparty Computations with Applications to Threshold Cryptography . In 17th ACM PODC,, Brian A . Coan and Yehuda Afek (Eds.). ACM , 101--111. https:\/\/doi.org\/10.1145\/277697.277716 10.1145\/277697.277716 Rosario Gennaro, Michael O. Rabin, and Tal Rabin. 1998. Simplified VSS and Fast-Track Multiparty Computations with Applications to Threshold Cryptography. In 17th ACM PODC,, Brian A. Coan and Yehuda Afek (Eds.). ACM, 101--111. https:\/\/doi.org\/10.1145\/277697.277716"},{"key":"e_1_3_2_1_21_1","volume-title":"Tal Rabin, and Sophia Yakoubov.","author":"Gentry Craig","year":"2021","unstructured":"Craig Gentry , Shai Halevi , Hugo Krawczyk , Bernardo Magri , Jesper Buus Nielsen , Tal Rabin, and Sophia Yakoubov. 2021 b. YOSO : You Only Speak Once \/ Secure MPC with Stateless Ephemeral Roles. In CRYPTO 2021, to appear. https:\/\/ia.cr\/2021\/210. Craig Gentry, Shai Halevi, Hugo Krawczyk, Bernardo Magri, Jesper Buus Nielsen, Tal Rabin, and Sophia Yakoubov. 2021b. YOSO: You Only Speak Once \/ Secure MPC with Stateless Ephemeral Roles. In CRYPTO 2021, to appear. https:\/\/ia.cr\/2021\/210."},{"key":"e_1_3_2_1_22_1","unstructured":"Craig Gentry Shai Halevi and Vadim Lyubashevsky. 2021a. Practical Non-interactive Publicly Verifiable Secret Sharing with Thousands of Parties. IACR Cryptol. ePrint Arch. (2021) 1397. https:\/\/eprint.iacr.org\/2021\/1397  Craig Gentry Shai Halevi and Vadim Lyubashevsky. 2021a. Practical Non-interactive Publicly Verifiable Secret Sharing with Thousands of Parties. IACR Cryptol. ePrint Arch. (2021) 1397. https:\/\/eprint.iacr.org\/2021\/1397"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-44750-4_27"},{"key":"e_1_3_2_1_24_1","volume-title":"Robust Multiparty Computation with Linear Communication Complexity. In CRYPTO 2006 (LNCS","volume":"482","author":"Hirt Martin","year":"2006","unstructured":"Martin Hirt and Jesper Buus Nielsen . 2006 . Robust Multiparty Computation with Linear Communication Complexity. In CRYPTO 2006 (LNCS , Vol. 4117),, Cynthia Dwork (Ed.). Springer, Heidelberg, 463-- 482 . https:\/\/doi.org\/10.1007\/11818175_28 10.1007\/11818175_28 Martin Hirt and Jesper Buus Nielsen. 2006. Robust Multiparty Computation with Linear Communication Complexity. In CRYPTO 2006 (LNCS, Vol. 4117),, Cynthia Dwork (Ed.). Springer, Heidelberg, 463--482. https:\/\/doi.org\/10.1007\/11818175_28"},{"key":"e_1_3_2_1_25_1","volume-title":"Secret Sharing Made Short. In CRYPTO'93 (LNCS","volume":"146","author":"Krawczyk Hugo","year":"1994","unstructured":"Hugo Krawczyk . 1994 . Secret Sharing Made Short. In CRYPTO'93 (LNCS , Vol. 773), Douglas R. Stinson (Ed.). Springer, Heidelberg, 136-- 146 . https:\/\/doi.org\/10.1007\/3-540-48329-2_12 10.1007\/3-540-48329-2_12 Hugo Krawczyk. 1994. Secret Sharing Made Short. In CRYPTO'93 (LNCS, Vol. 773), Douglas R. Stinson (Ed.). Springer, Heidelberg, 136--146. https:\/\/doi.org\/10.1007\/3-540-48329-2_12"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.5220\/0006133003030311"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/3243734.3243788"},{"key":"e_1_3_2_1_28_1","volume-title":"10th ACM PODC,, Luigi Logrippo (Ed.). ACM, 51--59. https:\/\/doi.org\/10.1145\/112600.112605","author":"Ostrovsky Rafail","unstructured":"Rafail Ostrovsky and Moti Yung . 1991. How to Withstand Mobile Virus Attacks (Extended Abstract) . In 10th ACM PODC,, Luigi Logrippo (Ed.). ACM, 51--59. https:\/\/doi.org\/10.1145\/112600.112605 10.1145\/112600.112605 Rafail Ostrovsky and Moti Yung. 1991. How to Withstand Mobile Virus Attacks (Extended Abstract). In 10th ACM PODC,, Luigi Logrippo (Ed.). ACM, 51--59. https:\/\/doi.org\/10.1145\/112600.112605"},{"key":"e_1_3_2_1_29_1","volume-title":"EUROCRYPT'91 (LNCS","volume":"526","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 (LNCS , Vol. 547), Donald W. Davies (Ed.). Springer, Heidelberg, 522-- 526 . https:\/\/doi.org\/10.1007\/3-540-46416-6_47 10.1007\/3-540-46416-6_47 Torben P. Pedersen. 1991. A Threshold Cryptosystem without a Trusted Party (Extended Abstract) (Rump Session). In EUROCRYPT'91 (LNCS, Vol. 547), Donald W. Davies (Ed.). Springer, Heidelberg, 522--526. https:\/\/doi.org\/10.1007\/3-540-46416-6_47"},{"key":"e_1_3_2_1_30_1","volume-title":"Non-Interactive and Information-Theoretic Secure Verifiable Secret Sharing. In CRYPTO'91 (LNCS","volume":"140","author":"Pedersen Torben P.","year":"1992","unstructured":"Torben P. Pedersen . 1992 . Non-Interactive and Information-Theoretic Secure Verifiable Secret Sharing. In CRYPTO'91 (LNCS , Vol. 576),, Joan Feigenbaum (Ed.). Springer, Heidelberg, 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 CRYPTO'91 (LNCS, Vol. 576),, Joan Feigenbaum (Ed.). Springer, Heidelberg, 129--140. https:\/\/doi.org\/10.1007\/3-540-46766-1_9"},{"key":"e_1_3_2_1_31_1","volume-title":"NTL: A Library for doing Number Theory. https:\/\/libntl.org\/","author":"Shoup Victor","year":"2022","unstructured":"Victor Shoup . 2022 . NTL: A Library for doing Number Theory. https:\/\/libntl.org\/ Victor Shoup. 2022. NTL: A Library for doing Number Theory. https:\/\/libntl.org\/"}],"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.3559397","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3548606.3559397","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T17:50:57Z","timestamp":1750182657000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3548606.3559397"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,11,7]]},"references-count":30,"alternative-id":["10.1145\/3548606.3559397","10.1145\/3548606"],"URL":"https:\/\/doi.org\/10.1145\/3548606.3559397","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"}}]}}