{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,18]],"date-time":"2026-08-18T01:42:04Z","timestamp":1787017324828,"version":"build-2736575974"},"publisher-location":"New York, NY, USA","reference-count":41,"publisher":"ACM","license":[{"start":{"date-parts":[[2020,10,30]],"date-time":"2020-10-30T00:00:00Z","timestamp":1604016000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"National Key Research and Development Program of China","award":["2018YFB0804105, 2017YFB0802005"],"award-info":[{"award-number":["2018YFB0804105, 2017YFB0802005"]}]},{"name":"National Natural Science Foundation of China","award":["61932019, 61802021"],"award-info":[{"award-number":["61932019, 61802021"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2020,10,30]]},"DOI":"10.1145\/3372297.3417285","type":"proceedings-article","created":{"date-parts":[[2020,11,2]],"date-time":"2020-11-02T13:27:02Z","timestamp":1604323622000},"page":"1627-1646","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":43,"title":["More Efficient MPC from Improved Triple Generation and Authenticated Garbling"],"prefix":"10.1145","author":[{"given":"Kang","family":"Yang","sequence":"first","affiliation":[{"name":"State Key Laboratory of Cryptology, Beijing, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Xiao","family":"Wang","sequence":"additional","affiliation":[{"name":"Northwestern University, Evanston, IL, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jiang","family":"Zhang","sequence":"additional","affiliation":[{"name":"State Key Laboratory of Cryptology, Beijing, China"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2020,11,2]]},"reference":[{"key":"e_1_3_2_2_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/3338469.3358943"},{"key":"e_1_3_2_2_2_1","volume-title":"More efficient oblivious transfer and extensions for faster secure computation. In ifnumshortbib=1elseACM Conf. on Computer and Communications Security (CCS)fi","author":"Asharov Gilad","year":"2013"},{"key":"e_1_3_2_2_3_1","volume-title":"22nd ifnumshortbib=1ACM STOCelseAnnual ACM Symposium on Theory of Computing (STOC)fi","author":"Beaver Donald"},{"key":"e_1_3_2_2_4_1","volume-title":"Optimizing Semi-Honest Secure Multiparty Computation for the Internet. In ifnumshortbib=1elseACM Conf. on Computer and Communications Security (CCS)fi","author":"Ben-Efraim Aner","year":"2016"},{"key":"e_1_3_2_2_5_1","volume-title":"Efficient Scalable Constant-Round MPC via Garbled Circuits. In ifnumshortbib=1AsiacryptelseAdvances in Cryptology--Asiacryptfi","author":"Ben-Efraim Aner","year":"2017"},{"key":"e_1_3_2_2_6_1","volume-title":"Semi-homomorphic Encryption and Multiparty Computation. In ifnumshortbib=1Eurocrypt elseAdvances in Cryptology--Eurocryptfi 2011 (ifnumshortbib=1LNCS elseLNCSfi)","author":"Bendlin Rikke"},{"key":"e_1_3_2_2_7_1","volume-title":"Efficient Two-Round OT Extension and Silent Non-Interactive Secure Computation. In ifnumshortbib=1elseACM Conf. on Computer and Communications Security (CCS)fi","author":"Boyle Elette","year":"2019"},{"key":"e_1_3_2_2_8_1","volume-title":"Fast Secure Computation for Small Population over the Internet. In ifnumshortbib=1elseACM Conf. on Computer and Communications Security (CCS)fi 2018","author":"Byali Megha"},{"key":"e_1_3_2_2_9_1","volume-title":"Conference on Theory and Practice of Public Key Cryptographyfi","author":"Canetti Ran","year":"2020"},{"key":"e_1_3_2_2_10_1","volume-title":"Bernardo David, Nico D\u00f6ttling, and Jesper Buus Nielsen.","author":"Cascudo Ignacio","year":"2016"},{"key":"e_1_3_2_2_11_1","volume-title":"Efficient Three-Party Computation from Cut-and-Choose. In ifnumshortbib=1Crypto elseAdvances in Cryptology--Cryptofi","author":"Choi Seung Geol","year":"2014"},{"key":"e_1_3_2_2_12_1","volume-title":"Progress in Cryptology--Latincrypt 2015 (ifnumshortbib=1LNCS elseLNCSfi)","author":"Chou Tung"},{"key":"e_1_3_2_2_13_1","volume-title":"IEEE Symposium on Security and Privacy (S&P)","author":"Ivan Damgr","year":"2019"},{"key":"e_1_3_2_2_14_1","volume-title":"Constant-Round Multiparty Computation Using a Black-Box Pseudorandom Generator. In ifnumshortbib=1Crypto elseAdvances in Cryptology--Cryptofi 2005 (ifnumshortbib=1LNCS elseLNCSfi","author":"Damg\u00e5rd Ivan"},{"key":"e_1_3_2_2_15_1","volume-title":"Smart, and Sarah Zakarias","author":"Damg\u00e5rd Ivan","year":"2012"},{"key":"e_1_3_2_2_16_1","volume-title":"Foundations of Cryptography: Basic Applications","author":"Goldreich Oded"},{"key":"e_1_3_2_2_17_1","volume-title":"19th ifnumshortbib=1ACM STOCelseAnnual ACM Symposium on Theory of Computing (STOC)fi","author":"Goldreich Oded"},{"key":"e_1_3_2_2_18_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00145-005-0319-z"},{"key":"e_1_3_2_2_19_1","volume-title":"Bolt: Anonymous Payment Channels for Decentralized Currencies. In ifnumshortbib=1elseACM Conf. on Computer and Communications Security (CCS)fi 2017","author":"Green Matthew","year":"2017"},{"key":"e_1_3_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP40000.2020.00016"},{"key":"e_1_3_2_2_21_1","volume-title":"Actively Secure Garbled Circuits with Constant Communication Overhead in the Plain Model. In ifnumshortbib=1TCCelseTheory of Cryptography Conference (TCC)fi 2017 (ifnumshortbib=1LNCS elseLNCSfi)","author":"Hazay Carmit"},{"key":"e_1_3_2_2_22_1","volume-title":"Low Cost Constant Round MPC Combining BMR and Oblivious Transfer. In ifnumshortbib=1AsiacryptelseAdvances in Cryptology--Asiacryptfi","author":"Hazay Carmit","year":"2017"},{"key":"e_1_3_2_2_23_1","volume-title":"The Price of Active Security in Cryptographic Protocols. In ifnumshortbib=1Eurocrypt elseAdvances in Cryptology--Eurocryptfi","author":"Hazay Carmit","year":"2020"},{"key":"e_1_3_2_2_24_1","volume-title":"Extending Oblivious Transfers Efficiently. In ifnumshortbib=1Crypto elseAdvances in Cryptology--Cryptofi 2003 (ifnumshortbib=1LNCS elseLNCSfi","author":"Ishai Yuval"},{"key":"e_1_3_2_2_25_1","volume-title":"Optimizing Authenticated Garbling for Faster Secure Two-Party Computation. In ifnumshortbib=1Crypto elseAdvances in Cryptology--Cryptofi","author":"Katz Jonathan","year":"2018"},{"key":"e_1_3_2_2_26_1","volume-title":"Actively Secure OT Extension with Optimal Overhead. In ifnumshortbib=1Crypto elseAdvances in Cryptology--Cryptofi","author":"Keller Marcel","year":"2015"},{"key":"e_1_3_2_2_27_1","volume-title":"Improved Garbled Circuit: Free XOR Gates and Applications. In ifnumshortbib=0Intl. Colloquium on Automata, Languages, and Programming (ICALP)fi (ifnumshortbib=1LNCS elseLNCSfi)","author":"Kolesnikov Vladimir"},{"key":"e_1_3_2_2_28_1","volume-title":"Smart","author":"Larraia Enrique","year":"2014"},{"key":"e_1_3_2_2_29_1","volume-title":"Smart, and Avishay Yanai","author":"Lindell Yehuda","year":"2015"},{"key":"e_1_3_2_2_30_1","volume-title":"Smart, and Eduardo Soria-Vazquez","author":"Lindell Yehuda","year":"2016"},{"key":"e_1_3_2_2_32_1","volume-title":"Claudio Orlandi, and Sai Sheshank Burra.","author":"Nielsen Jesper Buus","year":"2012"},{"key":"e_1_3_2_2_33_1","doi-asserted-by":"crossref","unstructured":"Jesper Buus Nielsen Thomas Schneider and Roberto Trifiletti. 2017. Constant Round Maliciously Secure 2PC with Function-independent Preprocessing using LEGO. In ifnumshortbib=1NDSSelseNetwork and Distributed System Security Symposium (NDSS)fi .  Jesper Buus Nielsen Thomas Schneider and Roberto Trifiletti. 2017. Constant Round Maliciously Secure 2PC with Function-independent Preprocessing using LEGO. In ifnumshortbib=1NDSSelseNetwork and Distributed System Security Symposium (NDSS)fi .","DOI":"10.14722\/ndss.2017.23075"},{"key":"e_1_3_2_2_34_1","volume-title":"A Framework for Efficient and Composable Oblivious Transfer. In ifnumshortbib=1Crypto elseAdvances in Cryptology--Cryptofi 2008 (ifnumshortbib=1LNCS elseLNCSfi","author":"Peikert Chris"},{"key":"e_1_3_2_2_35_1","unstructured":"Peter Rindal. [n.d.]. libOTe: an efficient portable and easy to use Oblivious Transfer Library . https:\/\/github.com\/osu-crypto\/libOTe .  Peter Rindal. [n.d.]. libOTe: an efficient portable and easy to use Oblivious Transfer Library . https:\/\/github.com\/osu-crypto\/libOTe ."},{"key":"e_1_3_2_2_36_1","volume-title":"MArBled Circuits: Mixing Arithmetic and Boolean Circuits with Active Security. In ifnumshortbib=1INDOCRYPTelseProgress in Cryptology -- Indocryptfi 2019 (ifnumshortbib=1LNCS elseLNCSfi)","author":"Rotaru Dragos"},{"key":"e_1_3_2_2_37_1","volume-title":"Authenticated Garbling and Efficient Maliciously Secure Two-Party Computation. In ifnumshortbib=1elseACM Conf. on Computer and Communications Security (CCS)fi","author":"Wang Xiao","year":"2017"},{"key":"e_1_3_2_2_38_1","volume-title":"Global-Scale Secure Multiparty Computation. In ifnumshortbib=1elseACM Conf. on Computer and Communications Security (CCS)fi","author":"Wang Xiao","year":"2017"},{"key":"e_1_3_2_2_40_1","volume-title":"27th ifnumshortbib=1FOCSelseAnnual Symposium on Foundations of Computer Science (FOCS)fi","author":"Chi-Chih Yao Andrew"},{"key":"e_1_3_2_2_41_1","volume-title":"Two Halves Make a Whole - Reducing Data Transfer in Garbled Circuits Using Half Gates. In ifnumshortbib=1Eurocrypt elseAdvances in Cryptology--Eurocryptfi","author":"Zahur Samee","year":"2015"},{"key":"e_1_3_2_2_42_1","volume-title":"Harjasleen Malvai, Steven Goldfeder, and Ari Juels.","author":"Zhang Fan","year":"2020"},{"key":"e_1_3_2_2_43_1","doi-asserted-by":"publisher","DOI":"10.1145\/3243734.3243850"}],"event":{"name":"CCS '20: 2020 ACM SIGSAC Conference on Computer and Communications Security","location":"Virtual Event USA","acronym":"CCS '20","sponsor":["SIGSAC ACM Special Interest Group on Security, Audit, and Control"]},"container-title":["Proceedings of the 2020 ACM SIGSAC Conference on Computer and Communications Security"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3372297.3417285","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3372297.3417285","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T18:01:31Z","timestamp":1750183291000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3372297.3417285"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,10,30]]},"references-count":41,"alternative-id":["10.1145\/3372297.3417285","10.1145\/3372297"],"URL":"https:\/\/doi.org\/10.1145\/3372297.3417285","relation":{},"subject":[],"published":{"date-parts":[[2020,10,30]]},"assertion":[{"value":"2020-11-02","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}