{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,8]],"date-time":"2025-09-08T06:23:57Z","timestamp":1757312637734,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":48,"publisher":"ACM","license":[{"start":{"date-parts":[[2018,10,15]],"date-time":"2018-10-15T00:00:00Z","timestamp":1539561600000},"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":[[2018,10,15]]},"DOI":"10.1145\/3243734.3243850","type":"proceedings-article","created":{"date-parts":[[2018,10,16]],"date-time":"2018-10-16T17:38:33Z","timestamp":1539711513000},"page":"862-879","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":16,"title":["NANOPI"],"prefix":"10.1145","author":[{"given":"Ruiyu","family":"Zhu","sequence":"first","affiliation":[{"name":"Indiana University, Bloomington, IN, USA"}]},{"given":"Darion","family":"Cassel","sequence":"additional","affiliation":[{"name":"Carnegie Mellon University, Pittsburgh, PA, USA"}]},{"given":"Amr","family":"Sabry","sequence":"additional","affiliation":[{"name":"Indiana University, Bloomington, IN, USA"}]},{"given":"Yan","family":"Huang","sequence":"additional","affiliation":[{"name":"Indiana University, Bloomington, IN, USA"}]}],"member":"320","published-online":{"date-parts":[[2018,10,15]]},"reference":[{"key":"e_1_3_2_2_1_1","doi-asserted-by":"crossref","unstructured":"Arash Afshar Payman Mohassel Benny Pinkas and Ben Riva. 2014. Non-interactive secure computation based on cut-and-choose. In EUROCRYPT.  Arash Afshar Payman Mohassel Benny Pinkas and Ben Riva. 2014. Non-interactive secure computation based on cut-and-choose. In EUROCRYPT.","DOI":"10.1007\/978-3-642-55220-5_22"},{"key":"e_1_3_2_2_2_1","volume-title":"Ullman","author":"Aho Alfred V.","year":"2006","unstructured":"Alfred V. Aho , Monica S. Lam , Ravi Sethi , and Jeffrey D . Ullman . 2006 . Compilers : Principles, Techniques, and Tools (2Nd Edition). Addison-Wesley Longman Publishing Co. , Inc., Boston, MA, USA. Alfred V. Aho, Monica S. Lam, Ravi Sethi, and Jeffrey D. Ullman. 2006. Compilers: Principles, Techniques, and Tools (2Nd Edition). Addison-Wesley Longman Publishing Co., Inc., Boston, MA, USA."},{"key":"e_1_3_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/100216.100287"},{"key":"e_1_3_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/62212.62213"},{"key":"e_1_3_2_2_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/2664243.2664255"},{"key":"e_1_3_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.3233\/JCS-150540"},{"key":"e_1_3_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/62212.62214"},{"key":"e_1_3_2_2_8_1","doi-asserted-by":"crossref","unstructured":"Ivan Damg\u00e5rd Marcel Keller Enrique Larraia Valerio Pastro Peter Scholl and Nigel Smart. 2013. Practical covertly secure MPC for dishonest majority--or: breaking the SPDZ limits. In ESORICS.  Ivan Damg\u00e5rd Marcel Keller Enrique Larraia Valerio Pastro Peter Scholl and Nigel Smart. 2013. Practical covertly secure MPC for dishonest majority--or: breaking the SPDZ limits. In ESORICS.","DOI":"10.1007\/978-3-642-40203-6_1"},{"key":"e_1_3_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/2976749.2978373"},{"key":"e_1_3_2_2_10_1","volume-title":"Minilego: Efficient secure two-party computation from general assumptions. In EUROCRYPT.","author":"Frederiksen Tore","year":"2013","unstructured":"Tore Frederiksen , Thomas Jakobsen , Jesper Nielsen , Peter Nordholt , and Claudio Orlandi . 2013 . Minilego: Efficient secure two-party computation from general assumptions. In EUROCRYPT. Tore Frederiksen, Thomas Jakobsen, Jesper Nielsen, Peter Nordholt, and Claudio Orlandi. 2013. Minilego: Efficient secure two-party computation from general assumptions. In EUROCRYPT."},{"key":"e_1_3_2_2_11_1","doi-asserted-by":"crossref","unstructured":"Carmit Hazay Yuval Ishai and Muthuramakrishnan Venkitasubramaniam. 2017a. Actively Secure Garbled Circuits with Constant Communication Overhead in the Plain Model. In TCC.  Carmit Hazay Yuval Ishai and Muthuramakrishnan Venkitasubramaniam. 2017a. Actively Secure Garbled Circuits with Constant Communication Overhead in the Plain Model. In TCC.","DOI":"10.1007\/978-3-319-70503-3_1"},{"key":"e_1_3_2_2_12_1","doi-asserted-by":"crossref","unstructured":"Carmit Hazay Peter Scholl and Eduardo Soria-Vazquez. 2017b. Low cost constant round MPC combining BMR and oblivious transfer. In ASIACRYPT.  Carmit Hazay Peter Scholl and Eduardo Soria-Vazquez. 2017b. Low cost constant round MPC combining BMR and oblivious transfer. In ASIACRYPT.","DOI":"10.1007\/978-3-319-70694-8_21"},{"key":"e_1_3_2_2_13_1","unstructured":"Yan Huang Peter Chapman and David Evans. 2011 a. Privacy-Preserving Applications on Smartphones.. HotSec.   Yan Huang Peter Chapman and David Evans. 2011 a. Privacy-Preserving Applications on Smartphones.. HotSec."},{"key":"e_1_3_2_2_14_1","volume-title":"Faster Secure Two-Party Computation Using Garbled Circuits. In USENIX Security Symposium.","author":"Huang Yan","year":"2011","unstructured":"Yan Huang , David Evans , Jonathan Katz , and Lior Malka . 2011 b . Faster Secure Two-Party Computation Using Garbled Circuits. In USENIX Security Symposium. Yan Huang, David Evans, Jonathan Katz, and Lior Malka. 2011 b. Faster Secure Two-Party Computation Using Garbled Circuits. In USENIX Security Symposium."},{"key":"e_1_3_2_2_15_1","doi-asserted-by":"crossref","unstructured":"Yan Huang Jonathan Katz Vladimir Kolesnikov Ranjit Kumaresan and Alex Malozemoff. 2014. Amortizing garbled circuits. In CRYPTO.  Yan Huang Jonathan Katz Vladimir Kolesnikov Ranjit Kumaresan and Alex Malozemoff. 2014. Amortizing garbled circuits. In CRYPTO.","DOI":"10.1007\/978-3-662-44381-1_26"},{"key":"e_1_3_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/366062.366084"},{"key":"e_1_3_2_2_17_1","doi-asserted-by":"crossref","unstructured":"Yuval Ishai Joe Kilian Kobbi Nissim and Erez Petrank. 2003. Extending oblivious transfers efficiently. In CRYPTO.  Yuval Ishai Joe Kilian Kobbi Nissim and Erez Petrank. 2003. Extending oblivious transfers efficiently. In CRYPTO.","DOI":"10.1007\/978-3-540-45146-4_9"},{"key":"e_1_3_2_2_18_1","doi-asserted-by":"crossref","unstructured":"Marcel Keller Emmanuela Orsini and Peter Scholl. 2015. Actively secure OT extension with optimal overhead. In CRYPTO.  Marcel Keller Emmanuela Orsini and Peter Scholl. 2015. Actively secure OT extension with optimal overhead. In CRYPTO.","DOI":"10.1007\/978-3-662-47989-6_35"},{"key":"e_1_3_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/2976749.2978357"},{"key":"e_1_3_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/3133956.3133991"},{"key":"e_1_3_2_2_21_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-70583-3_40"},{"key":"e_1_3_2_2_22_1","volume-title":"Billion-Gate Secure Computation with Malicious Adversaries. In USENIX Security Symposium.","author":"Kreuter Benjamin","year":"2012","unstructured":"Benjamin Kreuter , Abhi Shelat , and Chih-Hao Shen . 2012 . Billion-Gate Secure Computation with Malicious Adversaries. In USENIX Security Symposium. Benjamin Kreuter, Abhi Shelat, and Chih-Hao Shen. 2012. Billion-Gate Secure Computation with Malicious Adversaries. In USENIX Security Symposium."},{"key":"e_1_3_2_2_23_1","doi-asserted-by":"publisher","DOI":"10.1093\/comjnl\/6.4.308"},{"key":"e_1_3_2_2_24_1","volume-title":"MNIST handwritten digit database. AT&T Labs. Available: http:\/\/yann.lecun.com\/exdb\/mnist","author":"LeCun Yann","year":"2010","unstructured":"Yann LeCun , Corinna Cortes , and CJ Burges . 2010. MNIST handwritten digit database. AT&T Labs. Available: http:\/\/yann.lecun.com\/exdb\/mnist ( 2010 ). Yann LeCun, Corinna Cortes, and CJ Burges. 2010. MNIST handwritten digit database. AT&T Labs. Available: http:\/\/yann.lecun.com\/exdb\/mnist (2010)."},{"key":"e_1_3_2_2_25_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00145-015-9198-0"},{"key":"e_1_3_2_2_26_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00145-001-0019-2"},{"key":"e_1_3_2_2_27_1","volume-title":"Nigel P Smart, and Avishay Yanai","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. In CRYPTO. Yehuda Lindell, Benny Pinkas, Nigel P Smart, and Avishay Yanai. 2015. Efficient constant round multi-party computation combining BMR and SPDZ. In CRYPTO."},{"key":"e_1_3_2_2_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/2810103.2813666"},{"key":"e_1_3_2_2_29_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2015.29"},{"key":"e_1_3_2_2_30_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2017.12"},{"key":"e_1_3_2_2_31_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-32946-3_19"},{"key":"e_1_3_2_2_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/224164.224182"},{"key":"e_1_3_2_2_33_1","doi-asserted-by":"crossref","unstructured":"Moni Naor and Benny Pinkas. 2001. Efficient oblivious transfer protocols. In SODA.   Moni Naor and Benny Pinkas. 2001. Efficient oblivious transfer protocols. In SODA.","DOI":"10.1007\/3-540-44448-3_16"},{"key":"e_1_3_2_2_34_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2015.30"},{"key":"e_1_3_2_2_35_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-32009-5_40"},{"key":"e_1_3_2_2_36_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. In NDSS.  Jesper Nielsen Thomas Schneider and Roberto Trifiletti. 2017. Constant Round Maliciously Secure 2PC with Function-independent Preprocessing using LEGO. In NDSS.","DOI":"10.14722\/ndss.2017.23075"},{"key":"e_1_3_2_2_37_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2013.30"},{"key":"e_1_3_2_2_38_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-10366-7_15"},{"key":"e_1_3_2_2_39_1","volume-title":"USENIX Security Symposium.","author":"Rindal Peter","year":"2016","unstructured":"Peter Rindal and Mike Rosulek . 2016 . Faster malicious 2-party secure computation with online\/offline dual execution . In USENIX Security Symposium. Peter Rindal and Mike Rosulek. 2016. Faster malicious 2-party secure computation with online\/offline dual execution. In USENIX Security Symposium."},{"key":"e_1_3_2_2_40_1","unstructured":"University of Virginia Security Research Group. 2015. Obliv-C: A Language for Extensible Data-Oblivious Computation. https:\/\/oblivc.org\/  University of Virginia Security Research Group. 2015. Obliv-C: A Language for Extensible Data-Oblivious Computation. https:\/\/oblivc.org\/"},{"key":"e_1_3_2_2_41_1","doi-asserted-by":"publisher","DOI":"10.1145\/2810103.2813725"},{"key":"e_1_3_2_2_42_1","unstructured":"Xiao Wang Alex Malozemoff and Jonathan Katz. 2016. EMP-toolkit: Efficient MultiParty computation toolkit. https:\/\/github.com\/emp-toolkit  Xiao Wang Alex Malozemoff and Jonathan Katz. 2016. EMP-toolkit: Efficient MultiParty computation toolkit. https:\/\/github.com\/emp-toolkit"},{"key":"e_1_3_2_2_43_1","doi-asserted-by":"crossref","unstructured":"Xiao Wang Alex Malozemoff and Jonathan Katz. 2017a. Faster Secure Two-Party Computation in the Single-Execution Setting. In EUROCRYPT.  Xiao Wang Alex Malozemoff and Jonathan Katz. 2017a. Faster Secure Two-Party Computation in the Single-Execution Setting. In EUROCRYPT.","DOI":"10.1007\/978-3-319-56617-7_14"},{"key":"e_1_3_2_2_44_1","doi-asserted-by":"publisher","DOI":"10.1145\/3133956.3134053"},{"key":"e_1_3_2_2_45_1","doi-asserted-by":"publisher","DOI":"10.1145\/3133956.3133979"},{"volume-title":"The Formal Semantics of Programming Languages: An Introduction","author":"Winskel Glynn","key":"e_1_3_2_2_46_1","unstructured":"Glynn Winskel . 1993. The Formal Semantics of Programming Languages: An Introduction . MIT Press , Cambridge, MA, USA . Glynn Winskel. 1993. The Formal Semantics of Programming Languages: An Introduction .MIT Press, Cambridge, MA, USA."},{"key":"e_1_3_2_2_47_1","volume-title":"JIMU: Faster LEGO-based Secure Computation using Additive Homomorphic Hashes. In ASIACRYPT.","author":"Zhu Ruiyu","year":"2017","unstructured":"Ruiyu Zhu and Yan Huang . 2017 . JIMU: Faster LEGO-based Secure Computation using Additive Homomorphic Hashes. In ASIACRYPT. Ruiyu Zhu and Yan Huang. 2017. JIMU: Faster LEGO-based Secure Computation using Additive Homomorphic Hashes. In ASIACRYPT."},{"key":"e_1_3_2_2_48_1","doi-asserted-by":"publisher","DOI":"10.1145\/3133956.3134070"}],"event":{"name":"CCS '18: 2018 ACM SIGSAC Conference on Computer and Communications Security","sponsor":["SIGSAC ACM Special Interest Group on Security, Audit, and Control"],"location":"Toronto Canada","acronym":"CCS '18"},"container-title":["Proceedings of the 2018 ACM SIGSAC Conference on Computer and Communications Security"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3243734.3243850","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3243734.3243850","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T00:57:47Z","timestamp":1750208267000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3243734.3243850"}},"subtitle":["Extreme-Scale Actively-Secure Multi-Party Computation"],"short-title":[],"issued":{"date-parts":[[2018,10,15]]},"references-count":48,"alternative-id":["10.1145\/3243734.3243850","10.1145\/3243734"],"URL":"https:\/\/doi.org\/10.1145\/3243734.3243850","relation":{},"subject":[],"published":{"date-parts":[[2018,10,15]]},"assertion":[{"value":"2018-10-15","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}