{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,28]],"date-time":"2026-05-28T02:28:46Z","timestamp":1779935326875,"version":"3.53.1"},"publisher-location":"New York, NY, USA","reference-count":35,"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":"DARPA","award":["HR00112020025"],"award-info":[{"award-number":["HR00112020025"]}]},{"DOI":"10.13039\/100000001","name":"NSF (National Science Foundation)","doi-asserted-by":"publisher","award":["1916939"],"award-info":[{"award-number":["1916939"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2022,11,7]]},"DOI":"10.1145\/3548606.3560633","type":"proceedings-article","created":{"date-parts":[[2022,11,7]],"date-time":"2022-11-07T11:41:28Z","timestamp":1667821288000},"page":"951-964","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":28,"title":["TurboPack"],"prefix":"10.1145","author":[{"given":"Daniel","family":"Escudero","sequence":"first","affiliation":[{"name":"J.P. Morgan AI Research, New York, NY, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Vipul","family":"Goyal","sequence":"additional","affiliation":[{"name":"NTT Research & Carnegie Mellon University, Sunnyvale, CA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Antigoni","family":"Polychroniadou","sequence":"additional","affiliation":[{"name":"J.P. Morgan AI Research, New York, NY, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yifan","family":"Song","sequence":"additional","affiliation":[{"name":"Carnegie Mellon University, Pittsburgh, PA, 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.1007\/978-3-030-92075-3_8"},{"key":"e_1_3_2_1_2_1","volume-title":"Advances in Cryptology -- CRYPTO '91","author":"Beaver Donald","unstructured":"Donald Beaver . 1992. Efficient Multiparty Protocols Using Circuit Randomization . In Advances in Cryptology -- CRYPTO '91 , Joan Feigenbaum (Ed.). Springer Berlin Heidelberg , Berlin, Heidelberg , 420--432. Donald Beaver. 1992. Efficient Multiparty Protocols Using Circuit Randomization. In Advances in Cryptology -- CRYPTO '91, Joan Feigenbaum (Ed.). Springer Berlin Heidelberg, Berlin, Heidelberg, 420--432."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-77886-6_23"},{"key":"e_1_3_2_1_4_1","volume-title":"Order-C Secure Multiparty Computation for Highly Repetitive Circuits. In Annual International Conference on the Theory and Applications of Cryptographic Techniques. Springer, 663--693","author":"Beck Gabrielle","year":"2021","unstructured":"Gabrielle Beck , Aarushi Goel , Abhishek Jain , and Gabriel Kaptchuk . 2021 b. Order-C Secure Multiparty Computation for Highly Repetitive Circuits. In Annual International Conference on the Theory and Applications of Cryptographic Techniques. Springer, 663--693 . Gabrielle Beck, Aarushi Goel, Abhishek Jain, and Gabriel Kaptchuk. 2021b. Order-C Secure Multiparty Computation for Highly Repetitive Circuits. In Annual International Conference on the Theory and Applications of Cryptographic Techniques. Springer, 663--693."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-21568-2_26"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-20465-4_11"},{"key":"e_1_3_2_1_7_1","volume-title":"Theory of Cryptography,","author":"Benhamouda Fabrice","unstructured":"Fabrice Benhamouda , Elette Boyle , Niv Gilboa , Shai Halevi , Yuval Ishai , and Ariel Nof . 2021. Generalized Pseudorandom Secret Sharing and Efficient Straggler-Resilient Secure Computation . In Theory of Cryptography, , Kobbi Nissim and Brent Waters (Eds.). Springer International Publishing , Cham , 129--161. Fabrice Benhamouda, Elette Boyle, Niv Gilboa, Shai Halevi, Yuval Ishai, and Ariel Nof. 2021. Generalized Pseudorandom Secret Sharing and Efficient Straggler-Resilient Secure Computation. In Theory of Cryptography,, Kobbi Nissim and Brent Waters (Eds.). Springer International Publishing, Cham, 129--161."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-26954-8_3"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/3319535.3363227"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-64840-4_9"},{"key":"e_1_3_2_1_11_1","volume-title":"Fast Large-Scale Honest-Majority MPC for Malicious Adversaries. In Annual International Cryptology Conference. Springer, 34--64","author":"Chida Koji","year":"2018","unstructured":"Koji Chida , Daniel Genkin , Koki Hamada , Dai Ikarashi , Ryo Kikuchi , Yehuda Lindell , and Ariel Nof . 2018 . Fast Large-Scale Honest-Majority MPC for Malicious Adversaries. In Annual International Cryptology Conference. Springer, 34--64 . Koji Chida, Daniel Genkin, Koki Hamada, Dai Ikarashi, Ryo Kikuchi, Yehuda Lindell, and Ariel Nof. 2018. Fast Large-Scale Honest-Majority MPC for Malicious Adversaries. In Annual International Cryptology Conference. Springer, 34--64."},{"key":"e_1_3_2_1_12_1","volume-title":"Honest Majority MPC with Abort with Minimal Online Communication. In International Conference on Cryptology and Information Security in Latin America. Springer, 453--472","author":"Dalskov Anders","year":"2021","unstructured":"Anders Dalskov and Daniel Escudero . 2021 a. Honest Majority MPC with Abort with Minimal Online Communication. In International Conference on Cryptology and Information Security in Latin America. Springer, 453--472 . Anders Dalskov and Daniel Escudero. 2021a. Honest Majority MPC with Abort with Minimal Online Communication. In International Conference on Cryptology and Information Security in Latin America. Springer, 453--472."},{"key":"e_1_3_2_1_13_1","volume-title":"Honest Majority MPC with Abort with Minimal Online Communication. In International Conference on Cryptology and Information Security in Latin America. Springer, 453--472","author":"Dalskov Anders","year":"2021","unstructured":"Anders Dalskov and Daniel Escudero . 2021 b. Honest Majority MPC with Abort with Minimal Online Communication. In International Conference on Cryptology and Information Security in Latin America. Springer, 453--472 . Anders Dalskov and Daniel Escudero. 2021b. Honest Majority MPC with Abort with Minimal Online Communication. In International Conference on Cryptology and Information Security in Latin America. Springer, 453--472."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-13190-5_23"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-40203-6_1"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-26951-7_3"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-74143-5_32"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-53008-5_16"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-32009-5_38"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-84245-1_12"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/129712.129780"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-63688-7_14"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-48000-7_35"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/2591796.2591861"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-77886-6_24"},{"key":"e_1_3_2_1_26_1","volume-title":"ATLAS: Efficient and Scalable MPC in\u00a0the Honest Majority Setting. In Advances in Cryptology -- CRYPTO","author":"Goyal Vipul","year":"2021","unstructured":"Vipul Goyal , Hanjun Li , Rafail Ostrovsky , Antigoni Polychroniadou , and Yifan Song . 2021 a. ATLAS: Efficient and Scalable MPC in\u00a0the Honest Majority Setting. In Advances in Cryptology -- CRYPTO 2021. Springer International Publishing , Cham , 244--274. Vipul Goyal, Hanjun Li, Rafail Ostrovsky, Antigoni Polychroniadou, and Yifan Song. 2021a. ATLAS: Efficient and Scalable MPC in\u00a0the Honest Majority Setting. In Advances in Cryptology -- CRYPTO 2021. Springer International Publishing, Cham, 244--274."},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-84245-1_10"},{"key":"e_1_3_2_1_28_1","volume-title":"Sharing Transformation and Dishonest Majority MPC with Packed Secret Sharing. Annual International Cryptology Conference","author":"Goyal Vipul","year":"2022","unstructured":"Vipul Goyal , Antigoni Polychroniadou , and Yifan Song . 2022 . Sharing Transformation and Dishonest Majority MPC with Packed Secret Sharing. Annual International Cryptology Conference (2022). Vipul Goyal, Antigoni Polychroniadou, and Yifan Song. 2022. Sharing Transformation and Dishonest Majority MPC with Packed Secret Sharing. Annual International Cryptology Conference (2022)."},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-56880-1_22"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00145-019-09322-2"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.14722\/ndss.2017.23075"},{"key":"e_1_3_2_1_33_1","volume-title":"Applied Cryptography and Network Security","author":"Nordholt Peter Sebastian","unstructured":"Peter Sebastian Nordholt and Meilof Veeningen . 2018. Minimising Communication in Honest-Majority MPC by Batchwise Multiplication Verification . In Applied Cryptography and Network Security . Springer International Publishing , Cham , 321--339. Peter Sebastian Nordholt and Meilof Veeningen. 2018. Minimising Communication in Honest-Majority MPC by Batchwise Multiplication Verification. In Applied Cryptography and Network Security. Springer International Publishing, Cham, 321--339."},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/359168.359176"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1145\/3133956.3134053"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/3133956.3133979"}],"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.3560633","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3548606.3560633","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3548606.3560633","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.3560633"}},"subtitle":["Honest Majority MPC with Constant Online Communication"],"short-title":[],"issued":{"date-parts":[[2022,11,7]]},"references-count":35,"alternative-id":["10.1145\/3548606.3560633","10.1145\/3548606"],"URL":"https:\/\/doi.org\/10.1145\/3548606.3560633","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"}}]}}