{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,5]],"date-time":"2026-06-05T04:43:40Z","timestamp":1780634620650,"version":"3.54.1"},"publisher-location":"New York, NY, USA","reference-count":37,"publisher":"ACM","license":[{"start":{"date-parts":[[2017,10,30]],"date-time":"2017-10-30T00:00:00Z","timestamp":1509321600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"DARPA SPAWAR","award":["N66001-15-C-4065"],"award-info":[{"award-number":["N66001-15-C-4065"]}]},{"DOI":"10.13039\/100000001","name":"NSF","doi-asserted-by":"publisher","award":["1111599 1563722 1564088"],"award-info":[{"award-number":["1111599 1563722 1564088"]}],"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":[[2017,10,30]]},"DOI":"10.1145\/3133956.3133979","type":"proceedings-article","created":{"date-parts":[[2017,10,27]],"date-time":"2017-10-27T12:48:18Z","timestamp":1509108498000},"page":"39-56","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":138,"title":["Global-Scale Secure Multiparty Computation"],"prefix":"10.1145","author":[{"given":"Xiao","family":"Wang","sequence":"first","affiliation":[{"name":"University of Maryland, College Park, MD, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Samuel","family":"Ranellucci","sequence":"additional","affiliation":[{"name":"University of Maryland & George Mason University, College Park, MD, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jonathan","family":"Katz","sequence":"additional","affiliation":[{"name":"University of Maryland, College Park, MD, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2017,10,30]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"Non-Interactive Secure Computation Based on Cut-and-Choose Eurocrypt 2014 (LNCS)","author":"Afshar Arash","unstructured":"Arash Afshar, Payman Mohassel, Benny Pinkas, and Ben Riva. 2014. Non-Interactive Secure Computation Based on Cut-and-Choose Eurocrypt 2014 (LNCS), Vol. Vol. 8441. 387--404."},{"key":"e_1_3_2_1_2_1","volume-title":"High-Throughput Semi-Honest Secure Three-Party Computation with an Honest Majority ACM CCS","author":"Araki Toshinori","year":"2016","unstructured":"Toshinori Araki, Jun Furukawa, Yehuda Lindell, Ariel Nof, and Kazuma Ohara 2016. High-Throughput Semi-Honest Secure Three-Party Computation with an Honest Majority ACM CCS 2016. 805--817."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/100216.100287"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2013.39"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"crossref","unstructured":"Assaf Ben-David Noam Nisan and Benny Pinkas. 2008. FairplayMP: a system for secure multi-party computation ACM CCS 2008. 257--266.","DOI":"10.1145\/1455770.1455804"},{"key":"e_1_3_2_1_6_1","volume-title":"Optimizing Semi-Honest Secure Multiparty Computation for the Internet ACM CCS","author":"Ben-Efraim Aner","year":"2016","unstructured":"Aner Ben-Efraim, Yehuda Lindell, and Eran Omri. 2016. Optimizing Semi-Honest Secure Multiparty Computation for the Internet ACM CCS 2016. 578--590."},{"key":"e_1_3_2_1_7_1","volume-title":"Semi-homomorphic Encryption and Multiparty Computation Eurocrypt 2011 (LNCS)","author":"Bendlin Rikke","unstructured":"Rikke Bendlin, Ivan Damg\u00e5rd, Claudio Orlandi, and Sarah Zakarias 2011. Semi-homomorphic Encryption and Multiparty Computation Eurocrypt 2011 (LNCS), Vol. Vol. 6632. 169--188."},{"key":"e_1_3_2_1_8_1","volume-title":"Students and Taxes: A Privacy-Preserving Social Study Using Secure Computation Privacy Enhancing Technologies Symposium (PETS).","author":"Bogdanov Dan","year":"2016","unstructured":"Dan Bogdanov, Liina Kamm, Baldur Kubo, Reimo Rebane, Ville Sokk, and Riivo Talviste. 2016. Students and Taxes: A Privacy-Preserving Social Study Using Secure Computation Privacy Enhancing Technologies Symposium (PETS)."},{"key":"e_1_3_2_1_9_1","volume-title":"Sharemind: A Framework for Fast Privacy-Preserving Computations ESORICS 2008 (LNCS)","volume":"5283","author":"Bogdanov Dan","year":"2008","unstructured":"Dan Bogdanov, Sven Laur, and Jan Willemson 2008. Sharemind: A Framework for Fast Privacy-Preserving Computations ESORICS 2008 (LNCS), Vol. Vol. 5283. 192--206."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-03549-4_20"},{"key":"e_1_3_2_1_11_1","volume-title":"SEPIA: Privacy-preserving aggregation of multi-domain network events and statistics 19th USENIX Security Symposium, bibfieldeditor","author":"Burkhart Martin","unstructured":"Martin Burkhart, Mario Strasser, Dilip Many, and Xenofontas Dimitropoulos 2010. SEPIA: Privacy-preserving aggregation of multi-domain network events and statistics 19th USENIX Security Symposium, bibfieldeditorIan Goldberg (Ed.). USENIX Association, Washington, D.C., USA."},{"key":"e_1_3_2_1_12_1","volume-title":"Peter Sebastian Nordholt, Claudio Orlandi, Emmanuela Orsini, Peter Scholl, and Nigel P. Smart","author":"Burra Sai Sheshank","year":"2015","unstructured":"Sai Sheshank Burra, Enrique Larraia, Jesper Buus Nielsen, Peter Sebastian Nordholt, Claudio Orlandi, Emmanuela Orsini, Peter Scholl, and Nigel P. Smart 2015. High Performance Multi-Party Computation for Binary Circuits Based on Oblivious Transfer. Cryptology ePrint Archive, Report 2015\/472. (2015). shownotehttp:\/\/eprint.iacr.org\/2015\/472."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-27954-6_26"},{"key":"e_1_3_2_1_14_1","volume-title":"Efficient Three-Party Computation from Cut-and-Choose Crypto","author":"Choi Seung Geol","year":"2014","unstructured":"Seung Geol Choi, Jonathan Katz, Alex J. Malozemoff, and Vassilis Zikas 2014. Efficient Three-Party Computation from Cut-and-Choose Crypto 2014, Part II (LNCS), Vol. Vol. 8617. 513--530."},{"key":"e_1_3_2_1_15_1","volume-title":"Asynchronous Multiparty Computation: Theory and Implementation PKC 2009 (LNCS)","volume":"5443","author":"Damg\u00e5rd Ivan","year":"2009","unstructured":"Ivan Damg\u00e5rd, Martin Geisler, Mikkel Kr\u00f8igaard, and Jesper Buus Nielsen 2009. Asynchronous Multiparty Computation: Theory and Implementation PKC 2009 (LNCS), Vol. Vol. 5443. 160--179."},{"key":"e_1_3_2_1_16_1","volume-title":"Constant-Round Multiparty Computation Using a Black-Box Pseudorandom Generator Crypto 2005 (LNCS)","author":"Damg\u00e5rd Ivan","unstructured":"Ivan Damg\u00e5rd and Yuval Ishai 2005. Constant-Round Multiparty Computation Using a Black-Box Pseudorandom Generator Crypto 2005 (LNCS), Vol. Vol. 3621. 378--394."},{"key":"e_1_3_2_1_17_1","volume-title":"Smart","author":"Damg\u00e5rd Ivan","year":"2012","unstructured":"Ivan Damg\u00e5rd, Marcel Keller, Enrique Larraia, Christian Miles, and Nigel P. Smart. 2012. Implementing AES via an Actively\/Covertly Secure Dishonest-Majority MPC Protocol SCN 12 (LNCS), Vol. Vol. 7485. 241--263."},{"key":"e_1_3_2_1_18_1","volume-title":"Practical Covertly Secure MPC for Dishonest Majority - Or: Breaking the SPDZ Limits ESORICS 2013 (LNCS)","volume":"8134","author":"Ivan Damgr","unstructured":"Ivan Damgr ard, Marcel Keller, Enrique Larraia, Valerio Pastro, Peter Scholl, and Nigel P. Smart. 2013. Practical Covertly Secure MPC for Dishonest Majority - Or: Breaking the SPDZ Limits ESORICS 2013 (LNCS), Vol. Vol. 8134. 1--18."},{"key":"e_1_3_2_1_19_1","volume-title":"Smart, and Sarah Zakarias","author":"Damg\u00e5rd Ivan","year":"2012","unstructured":"Ivan Damg\u00e5rd, Valerio Pastro, Nigel P. Smart, and Sarah Zakarias 2012. Multiparty Computation from Somewhat Homomorphic Encryption Crypto 2012 (LNCS), Vol. Vol. 7417. 643--662."},{"key":"e_1_3_2_1_20_1","volume-title":"Part I (LNCS)","volume":"9452","author":"Frederiksen Tore Kasper","year":"2015","unstructured":"Tore Kasper Frederiksen, Marcel Keller, Emmanuela Orsini, and Peter Scholl 2015. A Unified Approach to MPC with Preprocessing Using OT ASIACRYPT 2015, Part I (LNCS), Vol. Vol. 9452. 711--735."},{"key":"e_1_3_2_1_21_1","volume-title":"High-Throughput Secure Three-Party Computation for Malicious Adversaries and an Honest Majority Eurocrypt","author":"Furukawa Jun","year":"2017","unstructured":"Jun Furukawa, Yehuda Lindell, Ariel Nof, and Or Weinstein. 2017. High-Throughput Secure Three-Party Computation for Malicious Adversaries and an Honest Majority Eurocrypt 2017, Part II (LNCS), Vol. Vol. 10211. 225--255."},{"key":"e_1_3_2_1_22_1","volume-title":"Foundations of Cryptography","author":"Goldreich Oded","unstructured":"Oded Goldreich. 2009. Foundations of Cryptography: Volume 2, Basic Applications. Vol. Vol. 2. Cambridge University Press."},{"key":"e_1_3_2_1_23_1","volume-title":"How to Play any Mental Game, or A Completeness Theorem for Protocols with Honest Majority 19th ACM STOC. 218--229","author":"Goldreich Oded","unstructured":"Oded Goldreich, Silvio Micali, and Avi Wigderson. 1987. How to Play any Mental Game, or A Completeness Theorem for Protocols with Honest Majority 19th ACM STOC. 218--229."},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00145-005-0319-z"},{"key":"e_1_3_2_1_26_1","volume-title":"Efficient Implementation of the Orlandi Protocol ACNS 10 (LNCS)","author":"Jakobsen Thomas P.","unstructured":"Thomas P. Jakobsen, Marc X. Makkes, and Janus Dam Nielsen. 2010. Efficient Implementation of the Orlandi Protocol ACNS 10 (LNCS), Vol. Vol. 6123. 255--272."},{"key":"e_1_3_2_1_27_1","volume-title":"Actively Secure OT Extension with Optimal Overhead Crypto","author":"Keller Marcel","year":"2015","unstructured":"Marcel Keller, Emmanuela Orsini, and Peter Scholl. 2015. Actively Secure OT Extension with Optimal Overhead Crypto 2015, Part I (LNCS), Vol. Vol. 9215. 724--741."},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/2976749.2978357"},{"key":"e_1_3_2_1_29_1","volume-title":"Smart","author":"Keller Marcel","year":"2013","unstructured":"Marcel Keller, Peter Scholl, and Nigel P. Smart. 2013. An architecture for practical actively secure MPC with dishonest majority ACM CCS 2013. 549--560."},{"key":"e_1_3_2_1_30_1","volume-title":"Smart","author":"Larraia Enrique","year":"2014","unstructured":"Enrique Larraia, Emmanuela Orsini, and Nigel P. Smart. 2014. Dishonest Majority Multi-Party Computation for Binary Circuits Crypto 2014, Part II (LNCS), Vol. Vol. 8617. 495--512."},{"key":"e_1_3_2_1_31_1","volume-title":"Part II (LNCS)","volume":"9216","author":"Lindell Yehuda","year":"2015","unstructured":"Yehuda Lindell, Benny Pinkas, Nigel P. Smart, and Avishay Yanai 2015. Efficient Constant Round Multi-party Computation Combining BMR and SPDZ Crypto 2015, Part II (LNCS), Vol. Vol. 9216. 319--338."},{"key":"e_1_3_2_1_32_1","volume-title":"Part I (LNCS)","volume":"9985","author":"Lindell Yehuda","year":"2016","unstructured":"Yehuda Lindell, Nigel P. Smart, and Eduardo Soria-Vazquez. 2016. More Efficient Constant-Round Multi-party Computation from BMR and SHE TCC 2016-B, Part I (LNCS), Vol. Vol. 9985. 554--581."},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/2810103.2813705"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"crossref","unstructured":"Jesper Nielsen Thomas Schneider and Roberto Trifiletti. 2017. Constant-Round Maliciously Secure 2PC with Function-Independent Preprocessing Using LEGO Network and Distributed System Security Symposium (NDSS).","DOI":"10.14722\/ndss.2017.23075"},{"key":"e_1_3_2_1_35_1","volume-title":"Claudio Orlandi, and Sai Sheshank Burra.","author":"Nielsen Jesper Buus","year":"2012","unstructured":"Jesper Buus Nielsen, Peter Sebastian Nordholt, Claudio Orlandi, and Sai Sheshank Burra. 2012. A New Approach to Practical Active-Secure Two-Party Computation Crypto 2012 (LNCS), Vol. Vol. 7417. 681--700."},{"key":"e_1_3_2_1_36_1","unstructured":"Xiao Wang Alex J. Malozemoff and Jonathan Katz. 2016. EMP-Toolkit: Efficient Multiparty Computation Toolkit. https:\/\/github.com\/emp-toolkit. (2016)."},{"key":"e_1_3_2_1_37_1","volume-title":"Authenticated Garbling and Efficient Maliciously Secure Two-Party Computation ACM CCS","author":"Wang Xiao","year":"2017","unstructured":"Xiao Wang, Samuel Ranellucci, and Jonathan Katz. 2017. Authenticated Garbling and Efficient Maliciously Secure Two-Party Computation ACM CCS 2017."},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1986.25"}],"event":{"name":"CCS '17: 2017 ACM SIGSAC Conference on Computer and Communications Security","location":"Dallas Texas USA","acronym":"CCS '17","sponsor":["SIGSAC ACM Special Interest Group on Security, Audit, and Control"]},"container-title":["Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3133956.3133979","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3133956.3133979","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3133956.3133979","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T02:13:26Z","timestamp":1750212806000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3133956.3133979"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,10,30]]},"references-count":37,"alternative-id":["10.1145\/3133956.3133979","10.1145\/3133956"],"URL":"https:\/\/doi.org\/10.1145\/3133956.3133979","relation":{},"subject":[],"published":{"date-parts":[[2017,10,30]]},"assertion":[{"value":"2017-10-30","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}