{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,25]],"date-time":"2026-01-25T04:35:33Z","timestamp":1769315733474,"version":"3.49.0"},"publisher-location":"New York, NY, USA","reference-count":57,"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.3243784","type":"proceedings-article","created":{"date-parts":[[2018,10,16]],"date-time":"2018-10-16T17:38:33Z","timestamp":1539711513000},"page":"677-694","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":14,"title":["Fast Secure Computation for Small Population over the Internet"],"prefix":"10.1145","author":[{"given":"Megha","family":"Byali","sequence":"first","affiliation":[{"name":"Indian Institute of Science, Bangalore, India"}]},{"given":"Arun","family":"Joseph","sequence":"additional","affiliation":[{"name":"Indian Institute of Science, Bangalore, India"}]},{"given":"Arpita","family":"Patra","sequence":"additional","affiliation":[{"name":"Indian Institute of Science, Bangalore, India"}]},{"given":"Divya","family":"Ravi","sequence":"additional","affiliation":[{"name":"Indian Institute of Science, Bangalore, India"}]}],"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 EUROCRYPT.  Arash Afshar Payman Mohassel Benny Pinkas and Ben Riva. 2014. Non-Interactive Secure Computation Based on Cut-and-Choose EUROCRYPT.","DOI":"10.1007\/978-3-642-55220-5_22"},{"key":"e_1_3_2_2_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2017.15"},{"key":"e_1_3_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/2976749.2989035"},{"key":"e_1_3_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/2976749.2978331"},{"key":"e_1_3_2_2_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-29011-4_29"},{"key":"e_1_3_2_2_6_1","unstructured":"Donald Beaver. 1991. Efficient Multiparty Protocols Using Circuit Randomization CRYPTO.   Donald Beaver. 1991. Efficient Multiparty Protocols Using Circuit Randomization CRYPTO."},{"key":"e_1_3_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/100216.100287"},{"key":"e_1_3_2_2_8_1","unstructured":"Zuzana Beerliov\u00e1-Trub'iniov\u00e1 and Martin Hirt. 2007. Simple and Efficient Perfectly-Secure Asynchronous MPC ASIACRYPT.  Zuzana Beerliov\u00e1-Trub'iniov\u00e1 and Martin Hirt. 2007. Simple and Efficient Perfectly-Secure Asynchronous MPC ASIACRYPT."},{"key":"e_1_3_2_2_9_1","unstructured":"Zuzana Beerliov\u00e1-Trub'iniov\u00e1 and Martin Hirt. 2008. Perfectly-Secure MPC with Linear Communication Complexity TCC.  Zuzana Beerliov\u00e1-Trub'iniov\u00e1 and Martin Hirt. 2008. Perfectly-Secure MPC with Linear Communication Complexity TCC."},{"key":"e_1_3_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/2382196.2382279"},{"key":"e_1_3_2_2_11_1","volume-title":"Optimizing Semi-Honest Secure Multiparty Computation for the Internet. IACR Cryptology ePrint Archive bibinfovolume2016","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. IACR Cryptology ePrint Archive bibinfovolume2016 ( 2016 ), 1066. Aner Ben-Efraim, Yehuda Lindell, and Eran Omri. 2016. Optimizing Semi-Honest Secure Multiparty Computation for the Internet. IACR Cryptology ePrint Archive bibinfovolume2016 (2016), 1066."},{"key":"e_1_3_2_2_12_1","unstructured":"Aner Ben-Efraim and Eran Omri. 2017. Concrete efficiency improvements for multiparty garbling with an honest majority LATINCRYPT.  Aner Ben-Efraim and Eran Omri. 2017. Concrete efficiency improvements for multiparty garbling with an honest majority LATINCRYPT."},{"key":"e_1_3_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/62212.62213"},{"key":"e_1_3_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-32009-5_39"},{"key":"e_1_3_2_2_15_1","doi-asserted-by":"crossref","unstructured":"Rikke Bendlin Ivan Damg\u00e5rd Claudio Orlandi and Sarah Zakarias. 2011. Semi-homomorphic Encryption and Multiparty Computation EUROCRYPT.   Rikke Bendlin Ivan Damg\u00e5rd Claudio Orlandi and Sarah Zakarias. 2011. Semi-homomorphic Encryption and Multiparty Computation EUROCRYPT.","DOI":"10.1007\/978-3-642-20465-4_11"},{"key":"e_1_3_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-88313-5_13"},{"key":"e_1_3_2_2_17_1","doi-asserted-by":"crossref","unstructured":"Dan Bogdanov Riivo Talviste and Jan Willemson. 2012. Deploying Secure Multi-Party Computation for Financial Data Analysis - (Short Paper) FC.  Dan Bogdanov Riivo Talviste and Jan Willemson. 2012. Deploying Secure Multi-Party Computation for Financial Data Analysis - (Short Paper) FC.","DOI":"10.1007\/978-3-642-32946-3_5"},{"key":"e_1_3_2_2_18_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-03549-4_20"},{"key":"e_1_3_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.1007\/s001459910006"},{"key":"e_1_3_2_2_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/3133956.3134100"},{"key":"e_1_3_2_2_22_1","doi-asserted-by":"crossref","unstructured":"David Chaum Ivan Damg\u00e5rd and Jeroen Graaf. 1987. Multiparty Computations Ensuring Privacy of Each Party's Input and Correctness of the Result CRYPTO.   David Chaum Ivan Damg\u00e5rd and Jeroen Graaf. 1987. Multiparty Computations Ensuring Privacy of Each Party's Input and Correctness of the Result CRYPTO.","DOI":"10.1007\/3-540-48184-2_7"},{"key":"e_1_3_2_2_23_1","unstructured":"Seung Geol Choi Jonathan Katz Alex J. Malozemoff and Vassilis Zikas. 2014. Efficient Three-Party Computation from Cut-and-Choose CRYPTO.  Seung Geol Choi Jonathan Katz Alex J. Malozemoff and Vassilis Zikas. 2014. Efficient Three-Party Computation from Cut-and-Choose CRYPTO."},{"key":"e_1_3_2_2_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/12130.12168"},{"key":"e_1_3_2_2_25_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-49096-9_25"},{"key":"e_1_3_2_2_26_1","doi-asserted-by":"crossref","unstructured":"Ran Cohen and Yehuda Lindell. 2014. Fairness versus Guaranteed Output Delivery in Secure Multiparty Computation ASIACRYPT.  Ran Cohen and Yehuda Lindell. 2014. Fairness versus Guaranteed Output Delivery in Secure Multiparty Computation ASIACRYPT.","DOI":"10.1007\/978-3-662-45608-8_25"},{"key":"e_1_3_2_2_27_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-30576-7_19"},{"key":"e_1_3_2_2_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/276698.276722"},{"key":"e_1_3_2_2_29_1","doi-asserted-by":"crossref","unstructured":"Ivan Damg\u00e5rd and Jesper Buus Nielsen. 2007. Scalable and Unconditionally Secure Multiparty Computation CRYPTO.  Ivan Damg\u00e5rd and Jesper Buus Nielsen. 2007. Scalable and Unconditionally Secure Multiparty Computation CRYPTO.","DOI":"10.1007\/11818175_30"},{"key":"e_1_3_2_2_30_1","doi-asserted-by":"crossref","unstructured":"Ivan Damg\u00e5rd and Claudio Orlandi. 2010. Multiparty Computation for Dishonest Majority: From Passive to Active Security at Low Cost CRYPTO.  Ivan Damg\u00e5rd and Claudio Orlandi. 2010. Multiparty Computation for Dishonest Majority: From Passive to Active Security at Low Cost CRYPTO.","DOI":"10.1007\/978-3-642-14623-7_30"},{"key":"e_1_3_2_2_31_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. Ivan Damg\u00e5rd, Valerio Pastro, Nigel P. Smart, and Sarah Zakarias. 2012. Multiparty Computation from Somewhat Homomorphic Encryption CRYPTO."},{"key":"e_1_3_2_2_32_1","doi-asserted-by":"crossref","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.  Jun Furukawa Yehuda Lindell Ariel Nof and Or Weinstein. 2017. High-Throughput Secure Three-Party Computation for Malicious Adversaries and an Honest Majority EUROCRYPT.","DOI":"10.1007\/978-3-319-56614-6_8"},{"key":"e_1_3_2_2_33_1","doi-asserted-by":"crossref","unstructured":"Sanjam Garg Craig Gentry Shai Halevi and Mariana Raykova. 2014. Two-Round Secure MPC from Indistinguishability Obfuscation TCC.  Sanjam Garg Craig Gentry Shai Halevi and Mariana Raykova. 2014. Two-Round Secure MPC from Indistinguishability Obfuscation TCC.","DOI":"10.1007\/978-3-642-54242-8_4"},{"key":"e_1_3_2_2_34_1","volume-title":"Viff: Virtual ideal functionality framework.","author":"Geisler Martin","year":"2007","unstructured":"Martin Geisler . 2007 . Viff: Virtual ideal functionality framework. (2007). Martin Geisler. 2007. Viff: Virtual ideal functionality framework. (2007)."},{"key":"e_1_3_2_2_35_1","volume-title":"The Foundations of Cryptography -","author":"Goldreich Oded","unstructured":"Oded Goldreich . 2001. The Foundations of Cryptography - Volume 1 , Basic Techniques. Cambridge University Press . Oded Goldreich. 2001. The Foundations of Cryptography - Volume 1, Basic Techniques. Cambridge University Press."},{"key":"e_1_3_2_2_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/28395.28420"},{"key":"e_1_3_2_2_37_1","doi-asserted-by":"crossref","unstructured":"S. Dov Gordon Feng-Hao Liu and Elaine Shi. 2015. Constant-Round MPC with Fairness and Guarantee of Output Delivery CRYPTO.  S. Dov Gordon Feng-Hao Liu and Elaine Shi. 2015. Constant-Round MPC with Fairness and Guarantee of Output Delivery CRYPTO.","DOI":"10.1007\/978-3-662-48000-7_4"},{"key":"e_1_3_2_2_38_1","volume-title":"Secure Computation with Low Communication from Cross-checking. IACR Cryptology ePrint Archive bibinfovolume2018","author":"Gordon S. Dov","year":"2018","unstructured":"S. Dov Gordon , Samuel Ranellucci , and Xiao Wang . 2018. Secure Computation with Low Communication from Cross-checking. IACR Cryptology ePrint Archive bibinfovolume2018 ( 2018 ), 216. S. Dov Gordon, Samuel Ranellucci, and Xiao Wang. 2018. Secure Computation with Low Communication from Cross-checking. IACR Cryptology ePrint Archive bibinfovolume2018 (2018), 216."},{"key":"e_1_3_2_2_39_1","doi-asserted-by":"publisher","DOI":"10.1145\/2810103.2813619"},{"key":"e_1_3_2_2_40_1","doi-asserted-by":"crossref","unstructured":"Yuval Ishai Ranjit Kumaresan Eyal Kushilevitz and Anat Paskin-Cherniavsky. 2015. Secure Computation with Minimal Interaction Revisited CRYPTO.  Yuval Ishai Ranjit Kumaresan Eyal Kushilevitz and Anat Paskin-Cherniavsky. 2015. Secure Computation with Minimal Interaction Revisited CRYPTO.","DOI":"10.1007\/978-3-662-48000-7_18"},{"key":"e_1_3_2_2_41_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-85174-5_32"},{"key":"e_1_3_2_2_42_1","volume-title":"Secret sharing scheme realizing general access structure. Electronics and Communications in Japan (Part III: Fundamental Electronic Science)","author":"Ito Mitsuru","year":"1989","unstructured":"Mitsuru Ito , Akira Saito , and Takao Nishizeki . 1989. Secret sharing scheme realizing general access structure. Electronics and Communications in Japan (Part III: Fundamental Electronic Science) ( 1989 ). Mitsuru Ito, Akira Saito, and Takao Nishizeki. 1989. Secret sharing scheme realizing general access structure. Electronics and Communications in Japan (Part III: Fundamental Electronic Science) (1989)."},{"key":"e_1_3_2_2_43_1","doi-asserted-by":"publisher","DOI":"10.1145\/2508859.2516662"},{"key":"e_1_3_2_2_44_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-54833-8_2"},{"key":"e_1_3_2_2_45_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00145-015-9198-0"},{"key":"e_1_3_2_2_46_1","doi-asserted-by":"crossref","unstructured":"Yehuda Lindell. 2017. How to Simulate It - A Tutorial on the Simulation Proof Technique. Tutorials on the Foundations of Cryptography. 277--346.   Yehuda Lindell. 2017. How to Simulate It - A Tutorial on the Simulation Proof Technique. Tutorials on the Foundations of Cryptography. 277--346.","DOI":"10.1007\/978-3-319-57048-8_6"},{"key":"e_1_3_2_2_47_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-72540-4_4"},{"key":"e_1_3_2_2_48_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00145-011-9107-0"},{"key":"e_1_3_2_2_49_1","volume-title":"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 CRYPTO. Yehuda Lindell, Benny Pinkas, Nigel P. Smart, and Avishay Yanai. 2015. Efficient Constant Round Multi-party Computation Combining BMR and SPDZ CRYPTO."},{"key":"e_1_3_2_2_50_1","volume-title":"Smart, and Frederik Vercauteren","author":"Makri Eleftheria","year":"2017","unstructured":"Eleftheria Makri , Dragos Rotaru , Nigel P. Smart, and Frederik Vercauteren . 2017 . EPIC : Efficient Private Image Classification (or: Learning from the Masters). Cryptology ePrint Archive, Report 2017\/1190. (2017). https:\/\/eprint.iacr.org\/2017\/1190 Eleftheria Makri, Dragos Rotaru, Nigel P. Smart, and Frederik Vercauteren. 2017. EPIC: Efficient Private Image Classification (or: Learning from the Masters). Cryptology ePrint Archive, Report 2017\/1190. (2017). https:\/\/eprint.iacr.org\/2017\/1190"},{"key":"e_1_3_2_2_51_1","doi-asserted-by":"publisher","DOI":"10.1145\/2810103.2813705"},{"key":"e_1_3_2_2_52_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF00196774"},{"key":"e_1_3_2_2_53_1","doi-asserted-by":"crossref","unstructured":"Jesper Buus Nielsen and Claudio Orlandi. 2016. Cross and Clean: Amortized Garbled Circuits with Constant Overhead TCC.  Jesper Buus Nielsen and Claudio Orlandi. 2016. Cross and Clean: Amortized Garbled Circuits with Constant Overhead TCC.","DOI":"10.1007\/978-3-662-53641-4_22"},{"key":"e_1_3_2_2_54_1","volume-title":"On the Exact Round Complexity of Secure Three-Party Computation. IACR Cryptology ePrint Archive bibinfovolume2018","author":"Patra Arpita","year":"2018","unstructured":"Arpita Patra and Divya Ravi . 2018. On the Exact Round Complexity of Secure Three-Party Computation. IACR Cryptology ePrint Archive bibinfovolume2018 ( 2018 ), 481. Arpita Patra and Divya Ravi. 2018. On the Exact Round Complexity of Secure Three-Party Computation. IACR Cryptology ePrint Archive bibinfovolume2018 (2018), 481."},{"key":"e_1_3_2_2_55_1","doi-asserted-by":"publisher","DOI":"10.1145\/73007.73014"},{"key":"e_1_3_2_2_56_1","doi-asserted-by":"crossref","unstructured":"Phillip Rogaway and Thomas Shrimpton. 2004. Cryptographic Hash-Function Basics: Definitions Implications and Separations for Preimage Resistance Second-Preimage Resistance and Collision Resistance FSE.  Phillip Rogaway and Thomas Shrimpton. 2004. Cryptographic Hash-Function Basics: Definitions Implications and Separations for Preimage Resistance Second-Preimage Resistance and Collision Resistance FSE.","DOI":"10.1007\/978-3-540-25937-4_24"},{"key":"e_1_3_2_2_57_1","unstructured":"Andrew Chi-Chih Yao. 1982. Protocols for Secure Computations (Extended Abstract) FOCS.  Andrew Chi-Chih Yao. 1982. Protocols for Secure Computations (Extended Abstract) FOCS."},{"key":"e_1_3_2_2_58_1","doi-asserted-by":"crossref","unstructured":"Samee Zahur Mike Rosulek and David Evans. 2015. Two Halves Make a Whole - Reducing Data Transfer in Garbled Circuits Using Half Gates. EUROCRYPT.  Samee Zahur Mike Rosulek and David Evans. 2015. Two Halves Make a Whole - Reducing Data Transfer in Garbled Circuits Using Half Gates. EUROCRYPT.","DOI":"10.1007\/978-3-662-46803-6_8"}],"event":{"name":"CCS '18: 2018 ACM SIGSAC Conference on Computer and Communications Security","location":"Toronto Canada","acronym":"CCS '18","sponsor":["SIGSAC ACM Special Interest Group on Security, Audit, and Control"]},"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.3243784","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3243734.3243784","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T02:08:18Z","timestamp":1750212498000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3243734.3243784"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,10,15]]},"references-count":57,"alternative-id":["10.1145\/3243734.3243784","10.1145\/3243734"],"URL":"https:\/\/doi.org\/10.1145\/3243734.3243784","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"}}]}}