{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,18]],"date-time":"2026-08-18T01:45:56Z","timestamp":1787017556905,"version":"build-2736575974"},"publisher-location":"New York, NY, USA","reference-count":46,"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"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2020,10,30]]},"DOI":"10.1145\/3372297.3423366","type":"proceedings-article","created":{"date-parts":[[2021,3,4]],"date-time":"2021-03-04T11:21:21Z","timestamp":1614856881000},"page":"1591-1605","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":9,"title":["Is the Classical GMW Paradigm Practical? The Case of Non-Interactive Actively Secure 2PC"],"prefix":"10.1145","author":[{"given":"Jackson","family":"Abascal","sequence":"first","affiliation":[{"name":"University of Rochester, Rochester, NY, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Mohammad Hossein","family":"Faghihi Sereshgi","sequence":"additional","affiliation":[{"name":"University of Rochester, Rochester, NY, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Carmit","family":"Hazay","sequence":"additional","affiliation":[{"name":"Bar-Ilan University, Ramat-Gan, Israel"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yuval","family":"Ishai","sequence":"additional","affiliation":[{"name":"Technion, Haifa, Israel"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Muthuramakrishnan","family":"Venkitasubramaniam","sequence":"additional","affiliation":[{"name":"University of Rochester, Rochester, NY, USA"}],"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":"crossref","unstructured":"Arash Afshar Payman Mohassel Benny Pinkas and Ben Riva. 2014. Non-Interactive Secure Computation Based on Cut-and-Choose. In EUROCRYPT. 387--404.  Arash Afshar Payman Mohassel Benny Pinkas and Ben Riva. 2014. Non-Interactive Secure Computation Based on Cut-and-Choose. In EUROCRYPT. 387--404.","DOI":"10.1007\/978-3-642-55220-5_22"},{"key":"e_1_3_2_2_2_1","doi-asserted-by":"crossref","unstructured":"Martin R. Albrecht Lorenzo Grassi Christian Rechberger Arnab Roy and Tyge Tiessen. 2016. MiMC: Efficient Encryption and Cryptographic Hashing with Minimal Multiplicative Complexity. In ASIACRYPT. 191--219.  Martin R. Albrecht Lorenzo Grassi Christian Rechberger Arnab Roy and Tyge Tiessen. 2016. MiMC: Efficient Encryption and Cryptographic Hashing with Minimal Multiplicative Complexity. In ASIACRYPT. 191--219.","DOI":"10.1007\/978-3-662-53887-6_7"},{"key":"e_1_3_2_2_3_1","first-page":"426","article-title":"Efficient Symmetric Primitives for Advanced Cryptographic Protocols (A Marvellous Contribution)","volume":"2019","author":"Aly Abdelrahaman","year":"2019","unstructured":"Abdelrahaman Aly , Tomer Ashur , Eli Ben-Sasson , Siemen Dhooghe , and Alan Szepieniec . 2019 . Efficient Symmetric Primitives for Advanced Cryptographic Protocols (A Marvellous Contribution) . IACR Cryptol. ePrint Arch. , Vol. 2019 (2019), 426 . Abdelrahaman Aly, Tomer Ashur, Eli Ben-Sasson, Siemen Dhooghe, and Alan Szepieniec. 2019. Efficient Symmetric Primitives for Advanced Cryptographic Protocols (A Marvellous Contribution). IACR Cryptol. ePrint Arch., Vol. 2019 (2019), 426.","journal-title":"IACR Cryptol. ePrint Arch."},{"key":"e_1_3_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/3133956.3134104"},{"key":"e_1_3_2_2_5_1","volume-title":"Viet Tung Hoang, and Phillip Rogaway","author":"Bellare Mihir","year":"2012","unstructured":"Mihir Bellare , Viet Tung Hoang, and Phillip Rogaway . 2012 a. Adaptively Secure Garbling with Applications to One-Time Programs and Secure Outsourcing. In ASIACRYPT. 134--153. Mihir Bellare, Viet Tung Hoang, and Phillip Rogaway. 2012a. Adaptively Secure Garbling with Applications to One-Time Programs and Secure Outsourcing. In ASIACRYPT. 134--153."},{"key":"e_1_3_2_2_6_1","volume-title":"Viet Tung Hoang, and Phillip Rogaway","author":"Bellare Mihir","year":"2012","unstructured":"Mihir Bellare , Viet Tung Hoang, and Phillip Rogaway . 2012 b. Foundations of garbled circuits. In CCS. 784--796. Mihir Bellare, Viet Tung Hoang, and Phillip Rogaway. 2012b. Foundations of garbled circuits. In CCS. 784--796."},{"key":"e_1_3_2_2_7_1","doi-asserted-by":"crossref","unstructured":"Assaf Ben-David Noam Nisan and Benny Pinkas. 2008. FairplayMP: a system for secure multi-party computation. In CCS Peng Ning Paul F. Syverson and Somesh Jha (Eds.). ACM 257--266.  Assaf Ben-David Noam Nisan and Benny Pinkas. 2008. FairplayMP: a system for secure multi-party computation. In CCS Peng Ning Paul F. Syverson and Somesh Jha (Eds.). ACM 257--266.","DOI":"10.1145\/1455770.1455804"},{"key":"e_1_3_2_2_8_1","doi-asserted-by":"crossref","unstructured":"Eli Ben-Sasson Iddo Bentov Yinon Horesh and Michael Riabzev. 2019 a. Scalable Zero Knowledge with No Trusted Setup. In CRYPTO. 701--732.  Eli Ben-Sasson Iddo Bentov Yinon Horesh and Michael Riabzev. 2019 a. Scalable Zero Knowledge with No Trusted Setup. In CRYPTO. 701--732.","DOI":"10.1007\/978-3-030-26954-8_23"},{"key":"e_1_3_2_2_9_1","doi-asserted-by":"crossref","unstructured":"Eli Ben-Sasson Alessandro Chiesa Michael Riabzev Nicholas Spooner Madars Virza and Nicholas P. Ward. 2019 b. Aurora: Transparent Succinct Arguments for R1CS. In EUROCRYPT. 103--128.  Eli Ben-Sasson Alessandro Chiesa Michael Riabzev Nicholas Spooner Madars Virza and Nicholas P. Ward. 2019 b. Aurora: Transparent Succinct Arguments for R1CS. In EUROCRYPT. 103--128.","DOI":"10.1007\/978-3-030-17653-2_4"},{"key":"e_1_3_2_2_10_1","doi-asserted-by":"crossref","unstructured":"Elette Boyle Geoffroy Couteau Niv Gilboa Yuval Ishai Lisa Kohl Peter Rindal and Peter Scholl. 2019. Efficient Two-Round OT Extension and Silent Non-Interactive Secure Computation. In CCS Lorenzo Cavallaro Johannes Kinder XiaoFeng Wang and Jonathan Katz (Eds.). ACM 291--308.  Elette Boyle Geoffroy Couteau Niv Gilboa Yuval Ishai Lisa Kohl Peter Rindal and Peter Scholl. 2019. Efficient Two-Round OT Extension and Silent Non-Interactive Secure Computation. In CCS Lorenzo Cavallaro Johannes Kinder XiaoFeng Wang and Jonathan Katz (Eds.). ACM 291--308.","DOI":"10.1145\/3319535.3354255"},{"key":"e_1_3_2_2_11_1","doi-asserted-by":"crossref","unstructured":"Ronald Cramer Ivan Damg\u00e5rd and Jesper Buus Nielsen. 2001. Multiparty Computation from Threshold Homomorphic Encryption. In EUROCRYPT. 280--299.  Ronald Cramer Ivan Damg\u00e5rd and Jesper Buus Nielsen. 2001. Multiparty Computation from Threshold Homomorphic Encryption. In EUROCRYPT. 280--299.","DOI":"10.1007\/3-540-44987-6_18"},{"key":"e_1_3_2_2_12_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. In CRYPTO. 643--662. Ivan Damg\u00e5rd, Valerio Pastro, Nigel P. Smart, and Sarah Zakarias. 2012. Multiparty Computation from Somewhat Homomorphic Encryption. In CRYPTO. 643--662."},{"key":"e_1_3_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1985.1057074"},{"key":"e_1_3_2_2_14_1","doi-asserted-by":"crossref","unstructured":"Rosario Gennaro Craig Gentry Bryan Parno and Mariana Raykova. 2013. Quadratic Span Programs and Succinct NIZKs without PCPs. In EUROCRYPT. 626--645.  Rosario Gennaro Craig Gentry Bryan Parno and Mariana Raykova. 2013. Quadratic Span Programs and Succinct NIZKs without PCPs. In EUROCRYPT. 626--645.","DOI":"10.1007\/978-3-642-38348-9_37"},{"key":"e_1_3_2_2_15_1","doi-asserted-by":"crossref","unstructured":"Oded Goldreich Silvio Micali and Avi Wigderson. 1987. How to Play any Mental Game or A Completeness Theorem for Protocols with Honest Majority. In STOC. 218--229.  Oded Goldreich Silvio Micali and Avi Wigderson. 1987. How to Play any Mental Game or A Completeness Theorem for Protocols with Honest Majority. In STOC. 218--229.","DOI":"10.1145\/28395.28420"},{"key":"e_1_3_2_2_16_1","doi-asserted-by":"crossref","unstructured":"Jens Groth. 2016. On the Size of Pairing-Based Non-interactive Arguments. In EUROCRYPT. 305--326.  Jens Groth. 2016. On the Size of Pairing-Based Non-interactive Arguments. In EUROCRYPT. 305--326.","DOI":"10.1007\/978-3-662-49896-5_11"},{"key":"e_1_3_2_2_17_1","doi-asserted-by":"crossref","unstructured":"Carmit Hazay Yuval Ishai and Muthuramakrishnan Venkitasubramaniam. 2017. Actively Secure Garbled Circuits with Constant Communication Overhead in the Plain Model. In TCC. 3--39.  Carmit Hazay Yuval Ishai and Muthuramakrishnan Venkitasubramaniam. 2017. Actively Secure Garbled Circuits with Constant Communication Overhead in the Plain Model. In TCC. 3--39.","DOI":"10.1007\/978-3-319-70503-3_1"},{"key":"e_1_3_2_2_18_1","volume-title":"Efficient Secure Two-Party Protocols - Techniques and Constructions","author":"Hazay Carmit","unstructured":"Carmit Hazay and Yehuda Lindell . 2010. Efficient Secure Two-Party Protocols - Techniques and Constructions . Springer . Carmit Hazay and Yehuda Lindell. 2010. Efficient Secure Two-Party Protocols - Techniques and Constructions .Springer."},{"key":"e_1_3_2_2_19_1","volume-title":"Quid-Pro-Quo-tocols: Strengthening Semi-honest Protocols with Dual Execution. In IEEE Symposium on Security and Privacy, SP","author":"Huang Yan","year":"2012","unstructured":"Yan Huang , Jonathan Katz , and David Evans . 2012 . Quid-Pro-Quo-tocols: Strengthening Semi-honest Protocols with Dual Execution. In IEEE Symposium on Security and Privacy, SP 2012. 272--284. Yan Huang, Jonathan Katz, and David Evans. 2012. Quid-Pro-Quo-tocols: Strengthening Semi-honest Protocols with Dual Execution. In IEEE Symposium on Security and Privacy, SP 2012. 272--284."},{"key":"e_1_3_2_2_20_1","doi-asserted-by":"crossref","unstructured":"Yan Huang Jonathan Katz and David Evans. 2013. Efficient Secure Two-Party Computation Using Symmetric Cut-and-Choose. In CRYPTO. 18--35.  Yan Huang Jonathan Katz and David Evans. 2013. Efficient Secure Two-Party Computation Using Symmetric Cut-and-Choose. In CRYPTO. 18--35.","DOI":"10.1007\/978-3-642-40084-1_2"},{"key":"e_1_3_2_2_21_1","doi-asserted-by":"crossref","unstructured":"Yuval Ishai Joe Kilian Kobbi Nissim and Erez Petrank. 2003. Extending Oblivious Transfers Efficiently. In CRYPTO. 145--161.  Yuval Ishai Joe Kilian Kobbi Nissim and Erez Petrank. 2003. Extending Oblivious Transfers Efficiently. In CRYPTO. 145--161.","DOI":"10.1007\/978-3-540-45146-4_9"},{"key":"e_1_3_2_2_22_1","doi-asserted-by":"crossref","unstructured":"Yuval Ishai Eyal Kushilevitz Xin Li Rafail Ostrovsky Manoj Prabhakaran Amit Sahai and David Zuckerman. 2013. Robust Pseudorandom Generators. In ICALP. 576--588.  Yuval Ishai Eyal Kushilevitz Xin Li Rafail Ostrovsky Manoj Prabhakaran Amit Sahai and David Zuckerman. 2013. Robust Pseudorandom Generators. In ICALP. 576--588.","DOI":"10.1007\/978-3-642-39206-1_49"},{"key":"e_1_3_2_2_23_1","doi-asserted-by":"crossref","unstructured":"Yuval Ishai Eyal Kushilevitz Rafail Ostrovsky Manoj Prabhakaran and Amit Sahai. 2011. Efficient Non-interactive Secure Computation. In EUROCRYPT. 406--425.  Yuval Ishai Eyal Kushilevitz Rafail Ostrovsky Manoj Prabhakaran and Amit Sahai. 2011. Efficient Non-interactive Secure Computation. In EUROCRYPT. 406--425.","DOI":"10.1007\/978-3-642-20465-4_23"},{"key":"e_1_3_2_2_24_1","doi-asserted-by":"crossref","unstructured":"Yuval Ishai Eyal Kushilevitz Rafail Ostrovsky and Amit Sahai. 2007. Zero-knowledge from secure multiparty computation. In STOC. 21--30.  Yuval Ishai Eyal Kushilevitz Rafail Ostrovsky and Amit Sahai. 2007. Zero-knowledge from secure multiparty computation. In STOC. 21--30.","DOI":"10.1145\/1250790.1250794"},{"key":"e_1_3_2_2_25_1","doi-asserted-by":"crossref","unstructured":"Stanislaw Jarecki and Vitaly Shmatikov. 2007. Efficient Two-Party Secure Computation on Committed Inputs. In EUROCRYPT. 97--114.  Stanislaw Jarecki and Vitaly Shmatikov. 2007. Efficient Two-Party Secure Computation on Committed Inputs. In EUROCRYPT. 97--114.","DOI":"10.1007\/978-3-540-72540-4_6"},{"key":"e_1_3_2_2_26_1","doi-asserted-by":"crossref","unstructured":"Jonathan Katz Samuel Ranellucci Mike Rosulek and Xiao Wang. 2018. Optimizing Authenticated Garbling for Faster Secure Two-Party Computation. In CRYPTO. 365--391.  Jonathan Katz Samuel Ranellucci Mike Rosulek and Xiao Wang. 2018. Optimizing Authenticated Garbling for Faster Secure Two-Party Computation. In CRYPTO. 365--391.","DOI":"10.1007\/978-3-319-96878-0_13"},{"key":"e_1_3_2_2_27_1","doi-asserted-by":"crossref","unstructured":"Marcel Keller Emmanuela Orsini and Peter Scholl. 2015. Actively Secure OT Extension with Optimal Overhead. In CRYPTO. 724--741.  Marcel Keller Emmanuela Orsini and Peter Scholl. 2015. Actively Secure OT Extension with Optimal Overhead. In CRYPTO. 724--741.","DOI":"10.1007\/978-3-662-47989-6_35"},{"key":"e_1_3_2_2_28_1","doi-asserted-by":"crossref","unstructured":"Joe Kilian. 1988. Founding Cryptography on Oblivious Transfer. In STOC. 20--31.  Joe Kilian. 1988. Founding Cryptography on Oblivious Transfer. In STOC. 20--31.","DOI":"10.1145\/62212.62215"},{"key":"e_1_3_2_2_29_1","doi-asserted-by":"crossref","unstructured":"Vladimir Kolesnikov and Thomas Schneider. 2008. Improved Garbled Circuit: Free XOR Gates and Applications. In ICALP. 486--498.  Vladimir Kolesnikov and Thomas Schneider. 2008. Improved Garbled Circuit: Free XOR Gates and Applications. In ICALP. 486--498.","DOI":"10.1007\/978-3-540-70583-3_40"},{"key":"e_1_3_2_2_30_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00145-015-9198-0"},{"key":"e_1_3_2_2_31_1","doi-asserted-by":"crossref","unstructured":"Yehuda Lindell and Benny Pinkas. 2007. An Efficient Protocol for Secure Two-Party Computation in the Presence of Malicious Adversaries. In EUROCRYPT. 52--78.  Yehuda Lindell and Benny Pinkas. 2007. An Efficient Protocol for Secure Two-Party Computation in the Presence of Malicious Adversaries. In EUROCRYPT. 52--78.","DOI":"10.1007\/978-3-540-72540-4_4"},{"key":"e_1_3_2_2_32_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00145-008-9036-8"},{"key":"e_1_3_2_2_33_1","volume-title":"Franklin","author":"Mohassel Payman","year":"2006","unstructured":"Payman Mohassel and Matthew K . Franklin . 2006 . Efficiency Tradeoffs for Malicious Two-Party Computation. In PKC. 458--473. Payman Mohassel and Matthew K. Franklin. 2006. Efficiency Tradeoffs for Malicious Two-Party Computation. In PKC. 458--473."},{"key":"e_1_3_2_2_34_1","volume-title":"EUROCRYPT (Lecture Notes in Computer Science), Jean-S\u00e9 bastien Coron and Jesper Buus Nielsen (Eds.)","author":"Mohassel Payman","unstructured":"Payman Mohassel and Mike Rosulek . 2017. Non-interactive Secure 2PC in the Offline\/Online and Batch Settings . In EUROCRYPT (Lecture Notes in Computer Science), Jean-S\u00e9 bastien Coron and Jesper Buus Nielsen (Eds.) , Vol. 10212 . 425--455. Payman Mohassel and Mike Rosulek. 2017. Non-interactive Secure 2PC in the Offline\/Online and Batch Settings. In EUROCRYPT (Lecture Notes in Computer Science), Jean-S\u00e9 bastien Coron and Jesper Buus Nielsen (Eds.), Vol. 10212. 425--455."},{"key":"e_1_3_2_2_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. In CRYPTO. 681--700. Jesper Buus Nielsen, Peter Sebastian Nordholt, Claudio Orlandi, and Sai Sheshank Burra. 2012. A New Approach to Practical Active-Secure Two-Party Computation. In CRYPTO. 681--700."},{"key":"e_1_3_2_2_36_1","doi-asserted-by":"crossref","unstructured":"Jesper Buus Nielsen and Claudio Orlandi. 2016. Cross and Clean: Amortized Garbled Circuits with Constant Overhead. In TCC. 582--603.  Jesper Buus Nielsen and Claudio Orlandi. 2016. Cross and Clean: Amortized Garbled Circuits with Constant Overhead. In TCC. 582--603.","DOI":"10.1007\/978-3-662-53641-4_22"},{"key":"e_1_3_2_2_37_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 NDSS .  Jesper Buus 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_38_1","doi-asserted-by":"crossref","unstructured":"Chris Peikert Vinod Vaikuntanathan and Brent Waters. 2008. A Framework for Efficient and Composable Oblivious Transfer. In CRYPTO. 554--571.  Chris Peikert Vinod Vaikuntanathan and Brent Waters. 2008. A Framework for Efficient and Composable Oblivious Transfer. In CRYPTO. 554--571.","DOI":"10.1007\/978-3-540-85174-5_31"},{"key":"e_1_3_2_2_39_1","doi-asserted-by":"crossref","unstructured":"Abhi Shelat and Chih-Hao Shen. 2013. Fast two-party secure computation with minimal assumptions. In CCS. 523--534.  Abhi Shelat and Chih-Hao Shen. 2013. Fast two-party secure computation with minimal assumptions. In CCS. 523--534.","DOI":"10.1145\/2508859.2516698"},{"key":"e_1_3_2_2_40_1","doi-asserted-by":"crossref","unstructured":"Paul Valiant. 2008. Incrementally Verifiable Computation or Proofs of Knowledge Imply Time\/Space Efficiency. In TCC. 1--18.  Paul Valiant. 2008. Incrementally Verifiable Computation or Proofs of Knowledge Imply Time\/Space Efficiency. In TCC. 1--18.","DOI":"10.1007\/978-3-540-78524-8_1"},{"key":"e_1_3_2_2_41_1","doi-asserted-by":"crossref","unstructured":"Xiao Wang Alex J. Malozemoff and Jonathan Katz. 2017a. Faster Secure Two-Party Computation in the Single-Execution Setting. In EUROCRYPT. 399--424.  Xiao Wang Alex J. Malozemoff and Jonathan Katz. 2017a. Faster Secure Two-Party Computation in the Single-Execution Setting. In EUROCRYPT. 399--424.","DOI":"10.1007\/978-3-319-56617-7_14"},{"key":"e_1_3_2_2_42_1","doi-asserted-by":"crossref","unstructured":"Xiao Wang Samuel Ranellucci and Jonathan Katz. 2017b. Authenticated Garbling and Efficient Maliciously Secure Multi-Party Computation. In CCS. 21--37.  Xiao Wang Samuel Ranellucci and Jonathan Katz. 2017b. Authenticated Garbling and Efficient Maliciously Secure Multi-Party Computation. In CCS. 21--37.","DOI":"10.1145\/3133956.3134053"},{"key":"e_1_3_2_2_43_1","volume-title":"Libra: Succinct Zero-Knowledge Proofs with Optimal Prover Computation. In CRYPTO. 733--764.","author":"Xie Tiancheng","year":"2019","unstructured":"Tiancheng Xie , Jiaheng Zhang , Yupeng Zhang , Charalampos Papamanthou , and Dawn Song . 2019 . Libra: Succinct Zero-Knowledge Proofs with Optimal Prover Computation. In CRYPTO. 733--764. Tiancheng Xie, Jiaheng Zhang, Yupeng Zhang, Charalampos Papamanthou, and Dawn Song. 2019. Libra: Succinct Zero-Knowledge Proofs with Optimal Prover Computation. In CRYPTO. 733--764."},{"key":"e_1_3_2_2_44_1","first-page":"1104","article-title":"More Efficient MPC from Improved Triple Generation andAuthenticated Garbling","volume":"2019","author":"Yang Kang","year":"2019","unstructured":"Kang Yang , Xiao Wang , and Jiang Zhang . 2019 . More Efficient MPC from Improved Triple Generation andAuthenticated Garbling . IACR Cryptology ePrint Archive , Vol. 2019 (2019), 1104 . Kang Yang, Xiao Wang, and Jiang Zhang. 2019. More Efficient MPC from Improved Triple Generation andAuthenticated Garbling. IACR Cryptology ePrint Archive, Vol. 2019 (2019), 1104.","journal-title":"IACR Cryptology ePrint Archive"},{"key":"e_1_3_2_2_45_1","unstructured":"Andrew Chi-Chih Yao. 1986. How to Generate and Exchange Secrets (Extended Abstract). In FOCS. 162--167.  Andrew Chi-Chih Yao. 1986. How to Generate and Exchange Secrets (Extended Abstract). In FOCS. 162--167."},{"key":"e_1_3_2_2_46_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. In EUROCRYPT. 220--250.  Samee Zahur Mike Rosulek and David Evans. 2015. Two Halves Make a Whole - Reducing Data Transfer in Garbled Circuits Using Half Gates. In EUROCRYPT. 220--250.","DOI":"10.1007\/978-3-662-46803-6_8"}],"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.3423366","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3372297.3423366","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T18:02:20Z","timestamp":1750183340000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3372297.3423366"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,10,30]]},"references-count":46,"alternative-id":["10.1145\/3372297.3423366","10.1145\/3372297"],"URL":"https:\/\/doi.org\/10.1145\/3372297.3423366","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"}}]}}