{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:34:28Z","timestamp":1750221268515,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":39,"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":[{"DOI":"10.13039\/100000001","name":"NSF","doi-asserted-by":"publisher","award":["1464113"],"award-info":[{"award-number":["1464113"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"name":"NIH","award":["1U01EB023685-01"],"award-info":[{"award-number":["1U01EB023685-01"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2017,10,30]]},"DOI":"10.1145\/3133956.3134070","type":"proceedings-article","created":{"date-parts":[[2017,10,27]],"date-time":"2017-10-27T12:48:18Z","timestamp":1509108498000},"page":"245-257","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":6,"title":["Pool"],"prefix":"10.1145","author":[{"given":"Ruiyu","family":"Zhu","sequence":"first","affiliation":[{"name":"Indiana University, Bloomington, IN, USA"}]},{"given":"Yan","family":"Huang","sequence":"additional","affiliation":[{"name":"Indiana University, Bloomington, IN, USA"}]},{"given":"Darion","family":"Cassel","sequence":"additional","affiliation":[{"name":"Carnegie Mellon University & Indiana University, Pittsburgh, PA, USA"}]}],"member":"320","published-online":{"date-parts":[[2017,10,30]]},"reference":[{"key":"e_1_3_2_2_1_1","doi-asserted-by":"crossref","unstructured":"Arash Afshar Zhangxiang Hu Payman Mohassel and Mike Rosulek 2015. How to efficiently evaluate RAM programs with malicious security EUROCRYPT.","DOI":"10.1007\/978-3-662-46800-5_27"},{"key":"e_1_3_2_2_2_1","doi-asserted-by":"publisher","unstructured":"Donald Beaver Silvio Micali and Phillip Rogaway. 1990. The round complexity of secure protocols. In STOC. 10.1145\/100216.100287","DOI":"10.1145\/100216.100287"},{"key":"e_1_3_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/s001459910006"},{"key":"e_1_3_2_2_4_1","doi-asserted-by":"crossref","unstructured":"Ran Canetti. 2001. Universally composable security: A new paradigm for cryptographic protocols FOCS.","DOI":"10.1109\/SFCS.2001.959888"},{"key":"e_1_3_2_2_5_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 ESORICS.","DOI":"10.1007\/978-3-642-40203-6_1"},{"key":"e_1_3_2_2_6_1","volume-title":"Nigel Smart, and Sarah Zakarias","author":"Damg\u00e5rd Ivan","year":"2012","unstructured":"Ivan Damg\u00e5rd, Valerio Pastro, Nigel Smart, and Sarah Zakarias 2012. Multiparty computation from somewhat homomorphic encryption CRYPTO."},{"key":"e_1_3_2_2_7_1","doi-asserted-by":"publisher","unstructured":"Jack Doerner David Evans and Abhi Shelat. 2016. Secure Stable Matching at Scale. In ACM CCS. 10.1145\/2976749.2978373","DOI":"10.1145\/2976749.2978373"},{"key":"e_1_3_2_2_8_1","volume-title":"Minilego: Efficient secure two-party computation from general assumptions 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 EUROCRYPT."},{"key":"e_1_3_2_2_9_1","unstructured":"Tore Frederiksen Thomas Jakobsen Jesper Nielsen and Roberto Trifiletti 2015. TinyLEGO: An Interactive Garbling Scheme for Maliciously Secure Two-party Computation.http:\/\/eprint.iacr.org\/2015\/309"},{"key":"e_1_3_2_2_10_1","volume-title":"Faster Secure Two-Party Computation Using Garbled Circuits USENIX Security Symposium.","author":"Huang Yan","year":"2011","unstructured":"Yan Huang, David Evans, Jonathan Katz, and Lior Malka. 2011. Faster Secure Two-Party Computation Using Garbled Circuits USENIX Security Symposium."},{"key":"e_1_3_2_2_11_1","doi-asserted-by":"crossref","unstructured":"Yan Huang Jonathan Katz and David Evans 2012. Quid-pro-quo-tocols: Strengthening semi-honest protocols with dual execution IEEE Symposium on Security and Privacy.","DOI":"10.1109\/SP.2012.43"},{"key":"e_1_3_2_2_12_1","doi-asserted-by":"publisher","unstructured":"Yan Huang Jonathan Katz Vladimir Kolesnikov Ranjit Kumaresan and Alex Malozemoff 2014. Amortizing garbled circuits. In CRYPTO. 10.1007\/978-3-662-44381-1_26","DOI":"10.1007\/978-3-662-44381-1_26"},{"key":"e_1_3_2_2_13_1","doi-asserted-by":"publisher","unstructured":"Yuval Ishai Joe Kilian Kobbi Nissim and Erez Petrank. 2003. Extending oblivious transfers efficiently. In CRYPTO. 10.1007\/978-3-540-45146-4_9","DOI":"10.1007\/978-3-540-45146-4_9"},{"key":"e_1_3_2_2_14_1","doi-asserted-by":"crossref","unstructured":"Marcel Keller Emmanuela Orsini and Peter Scholl. 2015. Actively secure OT extension with optimal overhead CRYPTO.","DOI":"10.1007\/978-3-662-47989-6_35"},{"key":"e_1_3_2_2_15_1","doi-asserted-by":"crossref","unstructured":"Vladimir Kolesnikov Payman Mohassel Ben Riva and Mike Rosulek 2015. Richer efficiency\/security trade-offs in 2PC. In TCC.","DOI":"10.1007\/978-3-662-46494-6_11"},{"key":"e_1_3_2_2_16_1","unstructured":"Vladimir Kolesnikov and Thomas Schneider 2008. Improved garbled circuit: Free XOR gates and applications International Colloquium on Automata Languages and Programming."},{"key":"e_1_3_2_2_17_1","volume-title":"Billion-Gate Secure Computation with Malicious Adversaries 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 USENIX Security Symposium."},{"key":"e_1_3_2_2_18_1","doi-asserted-by":"crossref","unstructured":"Yehuda Lindell and Ben Riva 2014. Cut-and-choose Yao-based secure computation in the online\/offline and batch settings CRYPTO.","DOI":"10.1007\/978-3-662-44381-1_27"},{"key":"e_1_3_2_2_19_1","doi-asserted-by":"crossref","unstructured":"Yehuda Lindell and Ben Riva 2015. Blazing fast 2pc in the offline\/online setting with security for malicious adversaries ACM CCS.","DOI":"10.1145\/2810103.2813666"},{"key":"e_1_3_2_2_20_1","doi-asserted-by":"crossref","unstructured":"Chang Liu Xiao Wang Kartik Nayak Yan Huang and Elaine Shi 2015. Oblivm: A programming framework for secure computation IEEE Symposium on Security and Privacy.","DOI":"10.1109\/SP.2015.29"},{"key":"e_1_3_2_2_21_1","volume-title":"Fairplay-Secure Two-Party Computation System. In USENIX Security Symposium.","author":"Malkhi Dahlia","year":"2004","unstructured":"Dahlia Malkhi, Noam Nisan, Benny Pinkas, and Yaron Sella. 2004. Fairplay-Secure Two-Party Computation System. In USENIX Security Symposium."},{"key":"e_1_3_2_2_22_1","doi-asserted-by":"crossref","unstructured":"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_23_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2015.30"},{"key":"e_1_3_2_2_24_1","doi-asserted-by":"publisher","unstructured":"Jesper Nielsen and Claudio Orlandi 2009. LEGO for two-party secure computation. In TCC. 10.1007\/978-3-642-00457-5_22","DOI":"10.1007\/978-3-642-00457-5_22"},{"key":"e_1_3_2_2_25_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 NDSS.","DOI":"10.14722\/ndss.2017.23075"},{"key":"e_1_3_2_2_26_1","unstructured":"Chris Peikert Vinod Vaikuntanathan and Brent Waters. 2008. A framework for efficient and composable oblivious transfer CRYPTO."},{"key":"e_1_3_2_2_27_1","unstructured":"Peter Rindal and Mike Rosulek 2016. Faster malicious 2-party secure computation with online\/offline dual execution USENIX Security Symposium."},{"key":"e_1_3_2_2_28_1","volume-title":"Tinygarble: Highly compressed and scalable sequential garbled circuits IEEE Symposium on Security and Privacy.","author":"Songhori Ebrahim","year":"2015","unstructured":"Ebrahim Songhori, Siam Hussain, Ahmad-Reza Sadeghi, Thomas Schneider, and Farinaz Koushanfar. 2015. Tinygarble: Highly compressed and scalable sequential garbled circuits IEEE Symposium on Security and Privacy."},{"key":"e_1_3_2_2_29_1","unstructured":"Stefan Tillich and Nigel Smart 2014. Circuits of Basic Functions Suitable For MPC and FHE. http:\/\/www.cs.bris.ac.uk\/Research\/CryptographySecurity\/MPC\/"},{"key":"e_1_3_2_2_30_1","doi-asserted-by":"crossref","unstructured":"Xiao Wang Hubert Chan and Elaine Shi 2015. Circuit oram: On tightness of the goldreich-ostrovsky lower bound ACM CCS.","DOI":"10.1145\/2810103.2813634"},{"key":"e_1_3_2_2_31_1","doi-asserted-by":"publisher","unstructured":"Xiao Wang Yan Huang Hubert Chan Abhi Shelat and Elaine Shi 2014. SCORAM: oblivious RAM for secure computation. In ACM CCS. 10.1145\/2660267.2660365","DOI":"10.1145\/2660267.2660365"},{"key":"e_1_3_2_2_32_1","doi-asserted-by":"crossref","unstructured":"Xiao Wang Yan Huang Yongan Zhao Haixu Tang XiaoFeng Wang and Diyue Bu. 2015. Efficient genome-wide privacy-preserving similar patient query based on private edit distance ACM CCS.","DOI":"10.1145\/2810103.2813725"},{"key":"e_1_3_2_2_33_1","unstructured":"Xiao Wang Chang Liu Yan Huang Kartik Nayak Elaine Shi and Michael Hicks. 2015natexlabc. ObliVM. https:\/\/github.com\/oblivm"},{"key":"e_1_3_2_2_34_1","unstructured":"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_35_1","doi-asserted-by":"crossref","unstructured":"Xiao Wang Alex Malozemoff and Jonathan Katz. 2017. Faster Secure Two-Party Computation in the Single-Execution Setting EUROCRYPT.","DOI":"10.1007\/978-3-319-56617-7_14"},{"key":"e_1_3_2_2_36_1","doi-asserted-by":"crossref","unstructured":"Xiao Wang Samuel Ranellucci and Jonathan Katz. 2017. Authenticated garbling and efficient maliciously secure two-party computation ACM CCS.","DOI":"10.1145\/3133956.3134053"},{"key":"e_1_3_2_2_37_1","doi-asserted-by":"crossref","unstructured":"Samee Zahur Xiao Wang Mariana Raykova Adri\u00e0 Gasc\u00f3n Jack Doerner David Evans and Jonathan Katz 2016. Revisiting square-root oram: Efficient random access in multi-party computation IEEE Symposium on Security and Privacy.","DOI":"10.1109\/SP.2016.21"},{"key":"e_1_3_2_2_38_1","doi-asserted-by":"crossref","unstructured":"Ruiyu Zhu and Yan Huang 2017. JIMU: Faster LEGO-based Secure Computation using Additive Homomorphic Hashes ASIACRYPT.","DOI":"10.1007\/978-3-319-70697-9_19"},{"key":"e_1_3_2_2_39_1","unstructured":"Ruiyu Zhu Yan Huang Abhi Shelat and Jonathan Katz. 2016. The Cut-and-Choose Game and its Application to Cryptographic Protocols USENIX Security Symposium."}],"event":{"name":"CCS '17: 2017 ACM SIGSAC Conference on Computer and Communications Security","sponsor":["SIGSAC ACM Special Interest Group on Security, Audit, and Control"],"location":"Dallas Texas USA","acronym":"CCS '17"},"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.3134070","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3133956.3134070","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3133956.3134070","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T02:11:03Z","timestamp":1750212663000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3133956.3134070"}},"subtitle":["Scalable On-Demand Secure Computation Service Against Malicious Adversaries"],"short-title":[],"issued":{"date-parts":[[2017,10,30]]},"references-count":39,"alternative-id":["10.1145\/3133956.3134070","10.1145\/3133956"],"URL":"https:\/\/doi.org\/10.1145\/3133956.3134070","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"}}]}}