{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,22]],"date-time":"2025-08-22T00:40:23Z","timestamp":1755823223981,"version":"3.44.0"},"publisher-location":"New York, NY, USA","reference-count":30,"publisher":"ACM","license":[{"start":{"date-parts":[[2023,11,15]],"date-time":"2023-11-15T00:00:00Z","timestamp":1700006400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"name":"nsf","award":["1955264"],"award-info":[{"award-number":["1955264"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2023,11,15]]},"DOI":"10.1145\/3576915.3623162","type":"proceedings-article","created":{"date-parts":[[2023,11,21]],"date-time":"2023-11-21T12:35:13Z","timestamp":1700570113000},"page":"2173-2187","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Linear Communication in Malicious Majority MPC"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0009-0001-6490-1786","authenticated-orcid":false,"given":"S. Dov","family":"Gordon","sequence":"first","affiliation":[{"name":"George Mason University & TripleBlind, Fairfax, VA, USA"}]},{"ORCID":"https:\/\/orcid.org\/0009-0009-1469-2136","authenticated-orcid":false,"given":"Phi Hung","family":"Le","sequence":"additional","affiliation":[{"name":"George Mason University, Fairfax, VA, USA"}]},{"ORCID":"https:\/\/orcid.org\/0009-0007-0553-4844","authenticated-orcid":false,"given":"Daniel","family":"McVicker","sequence":"additional","affiliation":[{"name":"George Mason University, Fairfax, VA, USA"}]}],"member":"320","published-online":{"date-parts":[[2023,11,21]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"crossref","unstructured":"Abdelrahaman Aly and Nigel P. Smart. Benchmarking privacy preserving scientific operations. In Robert H. Deng Val\u00e9rie Gauthier-Uma\u00f1a Mart\u00edn Ochoa and Moti Yung editors ACNS 19 volume 11464 of LNCS pages 509--529. Springer Heidelberg June 2019.","DOI":"10.1007\/978-3-030-21568-2_25"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"crossref","unstructured":"Carsten Baum Daniele Cozzo and Nigel P. Smart. Using TopGear in overdrive: A more efficient ZKPoK for SPDZ. In Kenneth G. Paterson and Douglas Stebila editors SAC 2019 volume 11959 of LNCS pages 274--302. Springer Heidelberg August 2019.","DOI":"10.1007\/978-3-030-38471-5_12"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"crossref","unstructured":"Donald Beaver. Efficient multiparty protocols using circuit randomization. In Joan Feigenbaum editor CRYPTO'91 volume 576 of LNCS pages 420--432. Springer Heidelberg August 1992.","DOI":"10.1007\/3-540-46766-1_34"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"crossref","unstructured":"Eli Ben-Sasson Serge Fehr and Rafail Ostrovsky. Near-linear unconditionallysecure multiparty computation with a dishonest minority. In Reihaneh SafaviNaini and Ran Canetti editors CRYPTO 2012 volume 7417 of LNCS pages 663-- 680. Springer Heidelberg August 2012.","DOI":"10.1007\/978-3-642-32009-5_39"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"crossref","unstructured":"Rikke Bendlin Ivan Damg\u00e5rd Claudio Orlandi and Sarah Zakarias. Semihomomorphic encryption and multiparty computation. In Kenneth G. Paterson editor EUROCRYPT 2011 volume 6632 of LNCS pages 169--188. Springer Heidelberg May 2011.","DOI":"10.1007\/978-3-642-20465-4_11"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"crossref","unstructured":"Elette Boyle Geoffroy Couteau Niv Gilboa Yuval Ishai Lisa Kohl and Peter Scholl. Efficient pseudorandom correlation generators: Silent OT extension and more. In Alexandra Boldyreva and Daniele Micciancio editors CRYPTO 2019 Part III volume 11694 of LNCS pages 489--518. Springer Heidelberg August 2019.","DOI":"10.1007\/978-3-030-26954-8_16"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"crossref","unstructured":"Elette Boyle Geoffroy Couteau Niv Gilboa Yuval Ishai Lisa Kohl and Peter Scholl. Efficient pseudorandom correlation generators from ring-LPN. In Daniele Micciancio and Thomas Ristenpart editors CRYPTO 2020 Part II volume 12171 of LNCS pages 387--416. Springer Heidelberg August 2020.","DOI":"10.1007\/978-3-030-56880-1_14"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"crossref","unstructured":"Elette Boyle Niv Gilboa Yuval Ishai and Ariel Nof. Efficient fully secure computation via distributed zero-knowledge proofs. In Shiho Moriai and Huaxiong Wang editors ASIACRYPT 2020 Part III volume 12493 of LNCS pages 244--276. Springer Heidelberg December 2020.","DOI":"10.1007\/978-3-030-64840-4_9"},{"key":"e_1_3_2_1_9_1","first-page":"261","volume":"2022","author":"Boyle Elette","year":"2021","unstructured":"Elette Boyle, Niv Gilboa, Yuval Ishai, and Ariel Nof. Sublinear gmw-style compiler for mpc with preprocessing. IACR Cryptol. ePrint Arch., 2022:261, 2021.","journal-title":"Print Arch."},{"key":"e_1_3_2_1_10_1","first-page":"309","volume-title":"ITCS 2012","author":"Brakerski Zvika","year":"2012","unstructured":"Zvika Brakerski, Craig Gentry, and Vinod Vaikuntanathan. (Leveled) fully homomorphic encryption without bootstrapping. In Shafi Goldwasser, editor, ITCS 2012, pages 309--325. ACM, January 2012."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2018.00020"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.5555\/874063.875553"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"crossref","unstructured":"Ran Canetti and Marc Fischlin. Universally composable commitments. In Joe Kilian editor CRYPTO 2001 volume 2139 of LNCS pages 19--40. Springer Heidelberg August 2001.","DOI":"10.1007\/3-540-44647-8_2"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"crossref","unstructured":"Ignacio Cascudo Ivan Damg\u00e5rd Bernardo David Nico D\u00f6ttling and Jesper Buus Nielsen. Rate-1 linear time and additively homomorphic UC commitments. In Matthew Robshaw and Jonathan Katz editors CRYPTO 2016 Part III volume 9816 of LNCS pages 179--207. Springer Heidelberg August 2016.","DOI":"10.1007\/978-3-662-53015-3_7"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"crossref","unstructured":"David Chaum Eug\u00e8ne van Heijst and Birgit Pfitzmann. Cryptographically strong undeniable signatures unconditionally secure for the signer. In Joan Feigenbaum editor CRYPTO'91 volume 576 of LNCS pages 470--484. Springer Heidelberg August 1992.","DOI":"10.1007\/3-540-46766-1_38"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"crossref","unstructured":"Ivan Damg\u00e5rd Marcel Keller Enrique Larraia Valerio Pastro Peter Scholl and Nigel P. Smart. Practical covertly secure MPC for dishonest majority - or: Breaking the SPDZ limits. In Jason Crampton Sushil Jajodia and Keith Mayes editors ESORICS 2013 volume 8134 of LNCS pages 1--18. Springer Heidelberg September 2013.","DOI":"10.1007\/978-3-642-40203-6_1"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"crossref","unstructured":"Ivan Damg\u00e5rd Valerio Pastro Nigel P. Smart and Sarah Zakarias. Multiparty computation from somewhat homomorphic encryption. In Reihaneh Safavi-Naini and Ran Canetti editors CRYPTO 2012 volume 7417 of LNCS pages 643--662. Springer Heidelberg August 2012.","DOI":"10.1007\/978-3-642-32009-5_38"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"crossref","unstructured":"Rafa\u00b4 'el del Pino Vadim Lyubashevsky and Gregor Seiler. Short discrete log proofs for FHE and ring-LWE ciphertexts. In Dongdai Lin and Kazue Sako editors PKC 2019 Part I volume 11442 of LNCS pages 344--373. Springer Heidelberg April 2019.","DOI":"10.1007\/978-3-030-17253-4_12"},{"key":"e_1_3_2_1_19_1","volume-title":"Paper 2022\/1316","author":"Escudero Daniel","year":"2022","unstructured":"Daniel Escudero, Vipul Goyal, Antigoni Polychroniadou, and Yifan Song. Turbopack: Honest majority mpc with constant online communication. Cryptology ePrint Archive, Paper 2022\/1316, 2022. https:\/\/eprint.iacr.org\/2022\/1316."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-30617-4_8"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/1536414.1536440"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/28395.28420"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-15985-5_1"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/3372297.3417872"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"crossref","unstructured":"Marcel Keller Emmanuela Orsini and Peter Scholl. Actively secure OT extension with optimal overhead. In Rosario Gennaro and Matthew J. B. Robshaw editors CRYPTO 2015 Part I volume 9215 of LNCS pages 724--741. Springer Heidelberg August 2015.","DOI":"10.1007\/978-3-662-47989-6_35"},{"key":"e_1_3_2_1_26_1","first-page":"830","volume-title":"ACM CCS 2016","author":"Keller Marcel","year":"2016","unstructured":"Marcel Keller, Emmanuela Orsini, and Peter Scholl. MASCOT: Faster malicious arithmetic secure computation with oblivious transfer. In Edgar R. Weippl, Stefan Katzenbeisser, Christopher Kruegel, Andrew C. Myers, and Shai Halevi, editors, ACM CCS 2016, pages 830--842. ACM Press, October 2016."},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"crossref","unstructured":"Marcel Keller Valerio Pastro and Dragos Rotaru. Overdrive: Making SPDZ great again. In Jesper Buus Nielsen and Vincent Rijmen editors EUROCRYPT 2018 Part III volume 10822 of LNCS pages 158--189. Springer Heidelberg April \/ May 2018.","DOI":"10.1007\/978-3-319-78372-7_6"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"crossref","unstructured":"Vadim Lyubashevsky Chris Peikert and Oded Regev. On ideal lattices and learning with errors over rings. In Henri Gilbert editor EUROCRYPT 2010 volume 6110 of LNCS pages 1--23. Springer Heidelberg May \/ June 2010.","DOI":"10.1007\/978-3-642-13190-5_1"},{"key":"e_1_3_2_1_29_1","unstructured":"Dragos Rotaru Nigel P. Smart Titouan Tanguy Frederik Vercauteren and Tim Wood. Actively secure setup for SPDZ. Cryptology ePrint Archive Report 2019\/1300 2019. https:\/\/eprint.iacr.org\/2019\/1300."},{"key":"e_1_3_2_1_30_1","unstructured":"Andreas Wittig. Ec2 network performance cheat sheet. Accessed: 2023-08-07."}],"event":{"name":"CCS '23: ACM SIGSAC Conference on Computer and Communications Security","sponsor":["SIGSAC ACM Special Interest Group on Security, Audit, and Control"],"location":"Copenhagen Denmark","acronym":"CCS '23"},"container-title":["Proceedings of the 2023 ACM SIGSAC Conference on Computer and Communications Security"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3576915.3623162","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3576915.3623162","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,21]],"date-time":"2025-08-21T01:50:49Z","timestamp":1755741049000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3576915.3623162"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,11,15]]},"references-count":30,"alternative-id":["10.1145\/3576915.3623162","10.1145\/3576915"],"URL":"https:\/\/doi.org\/10.1145\/3576915.3623162","relation":{},"subject":[],"published":{"date-parts":[[2023,11,15]]},"assertion":[{"value":"2023-11-21","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}