{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,7]],"date-time":"2025-12-07T13:10:56Z","timestamp":1765113056788,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":25,"publisher":"ACM","license":[{"start":{"date-parts":[[2025,6,13]],"date-time":"2025-06-13T00:00:00Z","timestamp":1749772800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000001","name":"NSF (National Science Foundation)","doi-asserted-by":"publisher","award":["1801369"],"award-info":[{"award-number":["1801369"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000185","name":"Defense Advanced Research Projects Agency","doi-asserted-by":"publisher","award":["FA8750-17-1-0059"],"award-info":[{"award-number":["FA8750-17-1-0059"]}],"id":[{"id":"10.13039\/100000185","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2025,6,16]]},"DOI":"10.1145\/3732772.3733556","type":"proceedings-article","created":{"date-parts":[[2025,6,13]],"date-time":"2025-06-13T14:23:34Z","timestamp":1749824614000},"page":"162-165","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["Brief Announcement: Towards Scalable YOSO MPC via Packed Secret-Sharing"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-2375-0034","authenticated-orcid":false,"given":"Daniel","family":"Escudero","sequence":"first","affiliation":[{"name":"JP Morgan AI Research & JP Morgan AlgoCRYPT CoE, New York, USA"}]},{"ORCID":"https:\/\/orcid.org\/0009-0002-8970-9624","authenticated-orcid":false,"given":"Elisaweta","family":"Masserova","sequence":"additional","affiliation":[{"name":"Carnegie Mellon University, Pittsburgh, USA"}]},{"ORCID":"https:\/\/orcid.org\/0009-0003-0125-2971","authenticated-orcid":false,"given":"Antigoni","family":"Polychroniadou","sequence":"additional","affiliation":[{"name":"JP Morgan AI Research & JP Morgan AlgoCRYPT CoE, New York, USA"}]}],"member":"320","published-online":{"date-parts":[[2025,6,13]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"Anasuya Acharya Carmit Hazay Vladimir Kolesnikov and Manoj Prabhakaran. 2022. SCALES - MPC with Small Clients and Larger Ephemeral Servers. In Theory of Cryptography Eike Kiltz and Vinod Vaikuntanathan (Eds.)."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-64840-4_5"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-46766-1_34"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-64375-1_10"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/3548606.3559397"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-38557-5_9"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-38557-5_20"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-22963-3_22"},{"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","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-84245-1_4"},{"key":"e_1_3_2_1_11_1","volume-title":"International Conference on the Theory and Application of Cryptographic Techniques.","author":"Cramer Ronald","year":"2001","unstructured":"Ronald Cramer, Ivan Damg\u00e5rd, and Jesper Buus Nielsen. 2001. Multiparty Computation from Threshold Homomorphic Encryption. In Advances in Cryptology - EUROCRYPT, International Conference on the Theory and Application of Cryptographic Techniques."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPIcs.ITC.2023.7"},{"key":"e_1_3_2_1_13_1","unstructured":"Giovanni Deligios Aarushi Goel and Chen-Da Liu-Zhang. 2023. Maximally-Fluid MPC with Guaranteed Output Delivery. IACR Cryptol. ePrint Arch. (2023)."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/3548606.3560633"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0055724"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-84245-1_3"},{"key":"e_1_3_2_1_17_1","volume-title":"Public Key Cryptography (1) (Lecture Notes in Computer Science","author":"Goyal Vipul","unstructured":"Vipul Goyal, Abhiram Kothapalli, Elisaweta Masserova, Bryan Parno, and Yifan Song. 2022. Storing and Retrieving Secrets on a Blockchain. In Public Key Cryptography (1) (Lecture Notes in Computer Science, Vol. 13177). Springer, 252\u2013282."},{"key":"e_1_3_2_1_18_1","volume-title":"TCC (2) (Lecture Notes in Computer Science","author":"Goyal Vipul","unstructured":"Vipul Goyal, Elisaweta Masserova, Bryan Parno, and Yifan Song. 2021. Blockchains Enable Non-interactive MPC. In TCC (2) (Lecture Notes in Computer Science, Vol. 13043). Springer, 162\u2013193."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-15985-5_1"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-26948-7_18"},{"key":"e_1_3_2_1_21_1","unstructured":"Sebastian Kolby Divya Ravi and Sophia Yakoubov. 2022. Constant-Round YOSO MPC Without Setup. IACR Cryptol. ePrint Arch. (2022)."},{"key":"e_1_3_2_1_22_1","volume-title":"FC (2) (Lecture Notes in Computer Science","author":"Liu-Zhang Chen-Da","unstructured":"Chen-Da Liu-Zhang, Elisaweta Masserova, Jo\u00e3o Ribeiro, Pratik Soni, and Sri Aravinda Krishnan Thyagarajan. 2024. Improved YOSO Randomness Generation with Worst-Case Corruptions. In FC (2) (Lecture Notes in Computer Science, Vol. 14745). Springer, 73\u201389."},{"key":"e_1_3_2_1_23_1","volume-title":"EUROCRYPT (5) (Lecture Notes in Computer Science","author":"Liu-Zhang Chen-Da","unstructured":"Chen-Da Liu-Zhang, Elisaweta Masserova, Jo\u00e3o Ribeiro, Pratik Soni, and Sri Aravinda Krishnan Thyagarajan. 2025. Efficient Distributed Randomness Generation from Minimal Assumptions Where PArties Speak Sequentially Once. In EUROCRYPT (5) (Lecture Notes in Computer Science, Vol. 15605). Springer, 176\u2013206."},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-15802-5_5"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/3488932.3497774"}],"event":{"name":"PODC '25: ACM Symposium on Principles of Distributed Computing","location":"Hotel Las Brisas Huatulco Huatulco Mexico","acronym":"PODC '25","sponsor":["SIGOPS ACM Special Interest Group on Operating Systems","SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the ACM Symposium on Principles of Distributed Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3732772.3733556","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3732772.3733556","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,13]],"date-time":"2025-06-13T14:24:50Z","timestamp":1749824690000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3732772.3733556"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,6,13]]},"references-count":25,"alternative-id":["10.1145\/3732772.3733556","10.1145\/3732772"],"URL":"https:\/\/doi.org\/10.1145\/3732772.3733556","relation":{},"subject":[],"published":{"date-parts":[[2025,6,13]]},"assertion":[{"value":"2025-06-13","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}