{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,23]],"date-time":"2025-12-23T00:29:53Z","timestamp":1766449793385,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":46,"publisher":"ACM","license":[{"start":{"date-parts":[[2023,7,10]],"date-time":"2023-07-10T00:00:00Z","timestamp":1688947200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100004895","name":"European Social Fund","doi-asserted-by":"publisher","award":["IT Academy"],"award-info":[{"award-number":["IT Academy"]}],"id":[{"id":"10.13039\/501100004895","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Bundesministerium f\u00fcr Bildung und Forschung","award":["16KIS1441"],"award-info":[{"award-number":["16KIS1441"]}]},{"DOI":"10.13039\/501100001665","name":"Agence Nationale de la Recherche","doi-asserted-by":"publisher","award":["ANR-20-CYAL-0006"],"award-info":[{"award-number":["ANR-20-CYAL-0006"]}],"id":[{"id":"10.13039\/501100001665","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2023,7,10]]},"DOI":"10.1145\/3579856.3582809","type":"proceedings-article","created":{"date-parts":[[2023,7,5]],"date-time":"2023-07-05T14:52:13Z","timestamp":1688568733000},"page":"372-386","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":9,"title":["Overdrive LowGear 2.0: Reduced-Bandwidth MPC without Sacrifice"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-1808-6140","authenticated-orcid":false,"given":"Pascal","family":"Reisert","sequence":"first","affiliation":[{"name":"University of Stuttgart, Germany"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8005-8365","authenticated-orcid":false,"given":"Marc","family":"Rivinius","sequence":"additional","affiliation":[{"name":"University of Stuttgart, Germany"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0981-3553","authenticated-orcid":false,"given":"Toomas","family":"Krips","sequence":"additional","affiliation":[{"name":"University of Tartu, Estonia"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9071-9312","authenticated-orcid":false,"given":"Ralf","family":"Kuesters","sequence":"additional","affiliation":[{"name":"University of Stuttgart, Germany"}]}],"member":"320","published-online":{"date-parts":[[2023,7,10]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"Non-Cryptographic Fault-Tolerant Computing in Constant Number of Rounds of Interaction. In PODC","author":"Bar-Ilan Judit","year":"1989","unstructured":"Judit Bar-Ilan and Donald Beaver . 1989 . Non-Cryptographic Fault-Tolerant Computing in Constant Number of Rounds of Interaction. In PODC 1989. ACM, 201\u2013209. Judit Bar-Ilan and Donald Beaver. 1989. Non-Cryptographic Fault-Tolerant Computing in Constant Number of Rounds of Interaction. In PODC 1989. ACM, 201\u2013209."},{"key":"e_1_3_2_1_2_1","volume-title":"Smart","author":"Baum Carsten","year":"2020","unstructured":"Carsten Baum , Daniele Cozzo , and Nigel\u00a0 P. Smart . 2020 . Using TopGear in Overdrive : A More Efficient ZKPoK for SPDZ. In SAC 2019. Springer , 274\u2013302. Carsten Baum, Daniele Cozzo, and Nigel\u00a0P. Smart. 2020. Using TopGear in Overdrive: A More Efficient ZKPoK for SPDZ. In SAC 2019. Springer, 274\u2013302."},{"volume-title":"CRYPTO \u201991","author":"Beaver Donald","key":"e_1_3_2_1_3_1","unstructured":"Donald Beaver . 1992. Efficient Multiparty Protocols Using Circuit Randomization . In CRYPTO \u201991 . Springer , 420\u2013432. Donald Beaver. 1992. Efficient Multiparty Protocols Using Circuit Randomization. In CRYPTO \u201991. Springer, 420\u2013432."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/62212.62213"},{"key":"e_1_3_2_1_5_1","volume-title":"FC","author":"Boura Christina","year":"2018","unstructured":"Christina Boura , Ilaria Chillotti , Nicolas Gama , Dimitar Jetchev , Stanislav Peceny , and Alexander Petric . 2018. High-Precision Privacy-Preserving Real-Valued Function Evaluation . In FC 2018 . Springer , 183\u2013202. Christina Boura, Ilaria Chillotti, Nicolas Gama, Dimitar Jetchev, Stanislav Peceny, and Alexander Petric. 2018. High-Precision Privacy-Preserving Real-Valued Function Evaluation. In FC 2018. Springer, 183\u2013202."},{"key":"e_1_3_2_1_6_1","volume-title":"CRYPTO","author":"Boyle Elette","year":"2019","unstructured":"Elette Boyle , Geoffroy Couteau , Niv Gilboa , Yuval Ishai , Lisa Kohl , and Peter Scholl . 2019. Efficient Pseudorandom Correlation Generators: Silent OT Extension and More . In CRYPTO 2019 . Springer , 489\u2013518. Elette Boyle, Geoffroy Couteau, Niv Gilboa, Yuval Ishai, Lisa Kohl, and Peter Scholl. 2019. Efficient Pseudorandom Correlation Generators: Silent OT Extension and More. In CRYPTO 2019. Springer, 489\u2013518."},{"key":"e_1_3_2_1_7_1","unstructured":"Elette Boyle Geoffroy Couteau Niv Gilboa Yuval Ishai Lisa Kohl and Peter Scholl. 2022. Efficient Pseudorandom Correlation Generators from Ring-LPN. Cryptology ePrint Archive Paper 2022\/1035. https:\/\/eprint.iacr.org\/2022\/1035  Elette Boyle Geoffroy Couteau Niv Gilboa Yuval Ishai Lisa Kohl and Peter Scholl. 2022. Efficient Pseudorandom Correlation Generators from Ring-LPN. Cryptology ePrint Archive Paper 2022\/1035. https:\/\/eprint.iacr.org\/2022\/1035"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-32009-5_50"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/2090236.2090262"},{"key":"e_1_3_2_1_10_1","volume-title":"Universally Composable Security: A New Paradigm for Cryptographic Protocols. In FOCS","author":"Canetti Ran","year":"2001","unstructured":"Ran Canetti . 2001 . Universally Composable Security: A New Paradigm for Cryptographic Protocols. In FOCS 2001. IEEE, 136\u2013145. Ran Canetti. 2001. Universally Composable Security: A New Paradigm for Cryptographic Protocols. In FOCS 2001. IEEE, 136\u2013145."},{"key":"e_1_3_2_1_11_1","volume-title":"ASIACRYPT","author":"Chen Hao","year":"2020","unstructured":"Hao Chen , Miran Kim , Ilya\u00a0 P. Razenshteyn , Dragos Rotaru , Yongsoo Song , and Sameer Wagh . 2020 . Maliciously Secure Matrix Multiplication with Applications to Private Deep Learning . In ASIACRYPT 2020. Springer, 31\u201359. Implementation : https:\/\/github.com\/snwagh\/ponytail-public\/. Hao Chen, Miran Kim, Ilya\u00a0P. Razenshteyn, Dragos Rotaru, Yongsoo Song, and Sameer Wagh. 2020. Maliciously Secure Matrix Multiplication with Applications to Private Deep Learning. In ASIACRYPT 2020. Springer, 31\u201359. Implementation: https:\/\/github.com\/snwagh\/ponytail-public\/."},{"key":"e_1_3_2_1_12_1","volume-title":"Carbyne Stack: Open Source Cloud Native Secure Multiparty Computation.","author":"Contributors Carbyne\u00a0Stack","year":"2021","unstructured":"Carbyne\u00a0Stack Contributors . 2021 . Carbyne Stack: Open Source Cloud Native Secure Multiparty Computation. Available at https:\/\/carbynestack.io\/. Carbyne\u00a0Stack Contributors. 2021. Carbyne Stack: Open Source Cloud Native Secure Multiparty Computation. Available at https:\/\/carbynestack.io\/."},{"key":"e_1_3_2_1_13_1","volume-title":"CRYPTO","author":"Cramer Ronald","year":"2001","unstructured":"Ronald Cramer and Ivan Damg\u00e5rd . 2001 . Secure Distributed Linear Algebra in a Constant Number of Rounds . In CRYPTO 2001. Springer, 119\u2013136. Ronald Cramer and Ivan Damg\u00e5rd. 2001. Secure Distributed Linear Algebra in a Constant Number of Rounds. In CRYPTO 2001. Springer, 119\u2013136."},{"key":"e_1_3_2_1_14_1","volume-title":"CRYPTO","author":"Cramer Ronald","year":"2018","unstructured":"Ronald Cramer , Ivan Damg\u00e5rd , Daniel Escudero , Peter Scholl , and Chaoping Xing . 2018 . SPD : Efficient MPC Mod for Dishonest Majority . In CRYPTO 2018. Springer, 769\u2013798. Ronald Cramer, Ivan Damg\u00e5rd, Daniel Escudero, Peter Scholl, and Chaoping Xing. 2018. SPD : Efficient MPC Mod for Dishonest Majority. In CRYPTO 2018. Springer, 769\u2013798."},{"key":"e_1_3_2_1_15_1","unstructured":"Morten Dahl. 2017. Cryptography and ML. https:\/\/mortendahl.github.io  Morten Dahl. 2017. Cryptography and ML. https:\/\/mortendahl.github.io"},{"key":"e_1_3_2_1_16_1","volume-title":"Secure Evaluation of Quantized Neural Networks. PETS 2020","author":"Dalskov Anders","year":"2020","unstructured":"Anders Dalskov , Daniel Escudero , and Marcel Keller . 2020 . Secure Evaluation of Quantized Neural Networks. PETS 2020 , 4 (2020), 355\u2013375. Anders Dalskov, Daniel Escudero, and Marcel Keller. 2020. Secure Evaluation of Quantized Neural Networks. PETS 2020, 4 (2020), 355\u2013375."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1504\/IJACT.2008.017048"},{"key":"e_1_3_2_1_18_1","volume-title":"Smart","author":"Damg\u00e5rd Ivan","year":"2013","unstructured":"Ivan Damg\u00e5rd , Marcel Keller , Enrique Larraia , Valerio Pastro , Peter Scholl , and Nigel\u00a0 P. Smart . 2013 . Practical Covertly Secure MPC for Dishonest Majority \u2013 Or : Breaking the SPDZ Limits. In ESORICS 2013. Springer , 1\u201318. Ivan Damg\u00e5rd, Marcel Keller, Enrique Larraia, Valerio Pastro, Peter Scholl, and Nigel\u00a0P. Smart. 2013. Practical Covertly Secure MPC for Dishonest Majority \u2013 Or: Breaking the SPDZ Limits. In ESORICS 2013. Springer, 1\u201318."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-32009-5_38"},{"key":"e_1_3_2_1_20_1","volume-title":"SP 2019. 1102\u20131120","author":"Damg\u00e5rd Ivan","year":"2019","unstructured":"Ivan Damg\u00e5rd , Daniel Escudero , Tore Frederiksen , Marcel Keller , Peter Scholl , and Nikolaj Volgushev . 2019 . New Primitives for Actively-Secure MPC over Rings with Applications to Private Machine Learning . In SP 2019. 1102\u20131120 . Ivan Damg\u00e5rd, Daniel Escudero, Tore Frederiksen, Marcel Keller, Peter Scholl, and Nikolaj Volgushev. 2019. New Primitives for Actively-Secure MPC over Rings with Applications to Private Machine Learning. In SP 2019. 1102\u20131120."},{"key":"e_1_3_2_1_21_1","unstructured":"Junfeng Fan and Frederik Vercauteren. 2012. Somewhat Practical Fully Homomorphic Encryption. IACR Cryp. ePrint Arch. (2012) 144. https:\/\/ia.cr\/2012\/144  Junfeng Fan and Frederik Vercauteren. 2012. Somewhat Practical Fully Homomorphic Encryption. IACR Cryp. ePrint Arch. (2012) 144. https:\/\/ia.cr\/2012\/144"},{"key":"e_1_3_2_1_22_1","volume-title":"Smart","author":"Gentry Craig","year":"2012","unstructured":"Craig Gentry , Shai Halevi , and Nigel\u00a0 P. Smart . 2012 . Fully Homomorphic Encryption with Polylog Overhead. In EUROCRYPT 2012. Springer , 465\u2013482. Craig Gentry, Shai Halevi, and Nigel\u00a0P. Smart. 2012. Fully Homomorphic Encryption with Polylog Overhead. In EUROCRYPT 2012. Springer, 465\u2013482."},{"key":"e_1_3_2_1_23_1","volume-title":"Smart","author":"Gentry Craig","year":"2012","unstructured":"Craig Gentry , Shai Halevi , and Nigel\u00a0 P. Smart . 2012 . Homomorphic Evaluation of the AES Circuit. In CRYPTO 2012. Springer , 850\u2013867. Craig Gentry, Shai Halevi, and Nigel\u00a0P. Smart. 2012. Homomorphic Evaluation of the AES Circuit. In CRYPTO 2012. Springer, 850\u2013867."},{"key":"e_1_3_2_1_24_1","volume-title":"STOC","author":"Goldreich Oded","year":"1987","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 1987. ACM, 218\u2013229. 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 1987. ACM, 218\u2013229."},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-44371-2_31"},{"key":"e_1_3_2_1_26_1","volume-title":"Deep Residual Learning for Image Recognition. In CVPR","author":"He Kaiming","year":"2016","unstructured":"Kaiming He , Xiangyu Zhang , Shaoqing Ren , and Jian Sun . 2016 . Deep Residual Learning for Image Recognition. In CVPR 2016. IEEE, 770\u2013778. Kaiming He, Xiangyu Zhang, Shaoqing Ren, and Jian Sun. 2016. Deep Residual Learning for Image Recognition. In CVPR 2016. IEEE, 770\u2013778."},{"key":"e_1_3_2_1_27_1","volume-title":"Cheetah: Lean and Fast Secure Two-Party Deep Neural Network Inference. IACR Cryptol. ePrint Arch.","author":"Huang Zhicong","year":"2022","unstructured":"Zhicong Huang , Wen-jie Lu, Cheng Hong , and Jiansheng Ding . 2022 . Cheetah: Lean and Fast Secure Two-Party Deep Neural Network Inference. IACR Cryptol. ePrint Arch. (2022), 207. https:\/\/eprint.iacr.org\/2022\/207 Zhicong Huang, Wen-jie Lu, Cheng Hong, and Jiansheng Ding. 2022. Cheetah: Lean and Fast Secure Two-Party Deep Neural Network Inference. IACR Cryptol. ePrint Arch. (2022), 207. https:\/\/eprint.iacr.org\/2022\/207"},{"key":"e_1_3_2_1_28_1","volume-title":"CCS","author":"Jiang Xiaoqian","year":"2018","unstructured":"Xiaoqian Jiang , Miran Kim , Kristin\u00a0 E. Lauter , and Yongsoo Song . 2018 . Secure Outsourced Matrix Computation and Application to Neural Networks . In CCS 2018. ACM, 1209\u20131222. Xiaoqian Jiang, Miran Kim, Kristin\u00a0E. Lauter, and Yongsoo Song. 2018. Secure Outsourced Matrix Computation and Application to Neural Networks. In CCS 2018. ACM, 1209\u20131222."},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"crossref","unstructured":"Marcel Keller. 2020. MP-SPDZ: A Versatile Framework for Multi-Party Computation. In CCS \u201920: 2020 ACM Virtual Event. ACM 1575\u20131590.  Marcel Keller. 2020. MP-SPDZ: A Versatile Framework for Multi-Party Computation. In CCS \u201920: 2020 ACM Virtual Event. ACM 1575\u20131590.","DOI":"10.1145\/3372297.3417872"},{"key":"e_1_3_2_1_30_1","volume-title":"MASCOT: Faster Malicious Arithmetic Secure Computation with Oblivious Transfer. In CCS. ACM, 830\u2013842.","author":"Keller Marcel","year":"2016","unstructured":"Marcel Keller , Emmanuela Orsini , and Peter Scholl . 2016 . MASCOT: Faster Malicious Arithmetic Secure Computation with Oblivious Transfer. In CCS. ACM, 830\u2013842. Marcel Keller, Emmanuela Orsini, and Peter Scholl. 2016. MASCOT: Faster Malicious Arithmetic Secure Computation with Oblivious Transfer. In CCS. ACM, 830\u2013842."},{"key":"e_1_3_2_1_31_1","volume-title":"Overdrive: Making SPDZ Great Again. In EUROCRYPT","author":"Keller Marcel","year":"2018","unstructured":"Marcel Keller , Valerio Pastro , and Dragos Rotaru . 2018 . Overdrive: Making SPDZ Great Again. In EUROCRYPT 2018. Springer , 158\u2013189. Marcel Keller, Valerio Pastro, and Dragos Rotaru. 2018. Overdrive: Making SPDZ Great Again. In EUROCRYPT 2018. Springer, 158\u2013189."},{"key":"e_1_3_2_1_32_1","volume-title":"Secure Quantized Training for Deep Learning. In ICML","author":"Keller Marcel","year":"2022","unstructured":"Marcel Keller and Ke Sun . 2022 . Secure Quantized Training for Deep Learning. In ICML 2022. PMLR, 10912\u201310938. Marcel Keller and Ke Sun. 2022. Secure Quantized Training for Deep Learning. In ICML 2022. PMLR, 10912\u201310938."},{"key":"e_1_3_2_1_33_1","unstructured":"Toomas Krips Ralf K\u00fcsters Pascal Reisert Marc Rivinius and Johannes Sch\u00e4ufele. 2022. Overdrive 2.0: Implementation. Available on request.  Toomas Krips Ralf K\u00fcsters Pascal Reisert Marc Rivinius and Johannes Sch\u00e4ufele. 2022. Overdrive 2.0: Implementation. Available on request."},{"volume-title":"Introduction to parallel algorithms and architectures: Arrays, trees, hypercubes","author":"Leighton Thomson","key":"e_1_3_2_1_34_1","unstructured":"F.\u00a0 Thomson Leighton . 1991. Introduction to parallel algorithms and architectures: Arrays, trees, hypercubes . Elsevier . F.\u00a0Thomson Leighton. 1991. Introduction to parallel algorithms and architectures: Arrays, trees, hypercubes. Elsevier."},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-38348-9_3"},{"key":"e_1_3_2_1_36_1","unstructured":"Payman Mohassel and Peter Rindal. 2018. ABY3: A Mixed Protocol Framework for Machine Learning. In CCS \u201918. ACM 35\u201352.  Payman Mohassel and Peter Rindal. 2018. ABY3: A Mixed Protocol Framework for Machine Learning. In CCS \u201918. ACM 35\u201352."},{"key":"e_1_3_2_1_37_1","volume-title":"SecureML: A System for Scalable Privacy-Preserving Machine Learning. In SP","author":"Mohassel Payman","year":"2017","unstructured":"Payman Mohassel and Yupeng Zhang . 2017 . SecureML: A System for Scalable Privacy-Preserving Machine Learning. In SP 2017. IEEE Computer Society, 19\u201338. Payman Mohassel and Yupeng Zhang. 2017. SecureML: A System for Scalable Privacy-Preserving Machine Learning. In SP 2017. IEEE Computer Society, 19\u201338."},{"volume-title":"Arithmetic of Finite Fields","author":"Orsini Emmanuela","key":"e_1_3_2_1_38_1","unstructured":"Emmanuela Orsini . 2021. Efficient , Actively Secure MPC with a Dishonest Majority: A Survey . In Arithmetic of Finite Fields . Springer , 42\u201371. Emmanuela Orsini. 2021. Efficient, Actively Secure MPC with a Dishonest Majority: A Survey. In Arithmetic of Finite Fields. Springer, 42\u201371."},{"key":"e_1_3_2_1_39_1","volume-title":"Smart, and Frederik Vercauteren","author":"Orsini Emmanuela","year":"2020","unstructured":"Emmanuela Orsini , Nigel\u00a0 P. Smart, and Frederik Vercauteren . 2020 . Overdrive2k: Efficient Secure MPC over from Somewhat Homomorphic Encryption. In CT-RSA 2020. Springer , 254\u2013283. Emmanuela Orsini, Nigel\u00a0P. Smart, and Frederik Vercauteren. 2020. Overdrive2k: Efficient Secure MPC over from Somewhat Homomorphic Encryption. In CT-RSA 2020. Springer, 254\u2013283."},{"volume-title":"Zero-Knowledge Protocols and Multiparty Computation. Ph.\u00a0D. Dissertation","author":"Pastro Valerio","key":"e_1_3_2_1_40_1","unstructured":"Valerio Pastro . 2013. Zero-Knowledge Protocols and Multiparty Computation. Ph.\u00a0D. Dissertation . Aarhus University . Advisor(s) Damg\u00e5rd, Ivan. Valerio Pastro. 2013. Zero-Knowledge Protocols and Multiparty Computation. Ph.\u00a0D. Dissertation. Aarhus University. Advisor(s) Damg\u00e5rd, Ivan."},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1145\/3372297.3417274"},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00145-021-09416-w"},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1109\/JSAIT.2021.3053220"},{"key":"e_1_3_2_1_44_1","volume-title":"PETS 2019","author":"Wagh Sameer","year":"2019","unstructured":"Sameer Wagh , Divya Gupta , and Nishanth Chandran . 2019 . SecureNN: 3-Party Secure Computation for Neural Network Training . PETS 2019 , 3 (2019), 26\u201349. Sameer Wagh, Divya Gupta, and Nishanth Chandran. 2019. SecureNN: 3-Party Secure Computation for Neural Network Training. PETS 2019, 3 (2019), 26\u201349."},{"key":"e_1_3_2_1_45_1","volume-title":"Falcon: Honest-Majority Maliciously Secure Framework for Private Deep Learning. PETS 2021","author":"Wagh Sameer","year":"2021","unstructured":"Sameer Wagh , Shruti Tople , Fabrice Benhamouda , Eyal Kushilevitz , Prateek Mittal , and Tal Rabin . 2021 . Falcon: Honest-Majority Maliciously Secure Framework for Private Deep Learning. PETS 2021 , 1 (2021), 188\u2013208. Sameer Wagh, Shruti Tople, Fabrice Benhamouda, Eyal Kushilevitz, Prateek Mittal, and Tal Rabin. 2021. Falcon: Honest-Majority Maliciously Secure Framework for Private Deep Learning. PETS 2021, 1 (2021), 188\u2013208."},{"key":"e_1_3_2_1_46_1","first-page":"724","article-title":"Helen: Maliciously Secure Coopetitive Learning for Linear Models","volume":"2019","author":"Zheng Wenting","year":"2019","unstructured":"Wenting Zheng , Raluca\u00a0 A. Popa , Joseph Gonzalez , and Ion Stoica . 2019 . Helen: Maliciously Secure Coopetitive Learning for Linear Models . SP 2019 , 724 \u2013 738 . Wenting Zheng, Raluca\u00a0A. Popa, Joseph Gonzalez, and Ion Stoica. 2019. Helen: Maliciously Secure Coopetitive Learning for Linear Models. SP 2019, 724\u2013738.","journal-title":"SP"}],"event":{"name":"ASIA CCS '23: ACM ASIA Conference on Computer and Communications Security","sponsor":["SIGSAC ACM Special Interest Group on Security, Audit, and Control"],"location":"Melbourne VIC Australia","acronym":"ASIA CCS '23"},"container-title":["Proceedings of the ACM Asia Conference on Computer and Communications Security"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3579856.3582809","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T17:51:27Z","timestamp":1750182687000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3579856.3582809"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,7,10]]},"references-count":46,"alternative-id":["10.1145\/3579856.3582809","10.1145\/3579856"],"URL":"https:\/\/doi.org\/10.1145\/3579856.3582809","relation":{},"subject":[],"published":{"date-parts":[[2023,7,10]]},"assertion":[{"value":"2023-07-10","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}