{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,3]],"date-time":"2026-10-03T18:48:30Z","timestamp":1791053310842,"version":"4.1.0"},"publisher-location":"New York, NY, USA","reference-count":58,"publisher":"ACM","license":[{"start":{"date-parts":[[2024,12,2]],"date-time":"2024-12-02T00:00:00Z","timestamp":1733097600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100006374","name":"National Key Research and Development Program of China","doi-asserted-by":"publisher","award":["Grant No. 2022YFB2702000"],"award-info":[{"award-number":["Grant No. 2022YFB2702000"]}],"id":[{"id":"10.13039\/501100006374","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100006374","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["Grant Nos. 62102037, 61932019"],"award-info":[{"award-number":["Grant Nos. 62102037, 61932019"]}],"id":[{"id":"10.13039\/501100006374","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2024,12,2]]},"DOI":"10.1145\/3658644.3690281","type":"proceedings-article","created":{"date-parts":[[2024,12,9]],"date-time":"2024-12-09T12:19:20Z","timestamp":1733746760000},"page":"2490-2504","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":15,"title":["Rhombus: Fast Homomorphic Matrix-Vector Multiplication for Secure Two-Party Inference"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-8334-6810","authenticated-orcid":false,"given":"Jiaxing","family":"He","sequence":"first","affiliation":[{"name":"Digital Technologies, Ant Group, Beijing, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7453-4043","authenticated-orcid":false,"given":"Kang","family":"Yang","sequence":"additional","affiliation":[{"name":"State Key Laboratory of Cryptology, Beijing, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0121-5471","authenticated-orcid":false,"given":"Guofeng","family":"Tang","sequence":"additional","affiliation":[{"name":"Digital Technologies, Ant Group, Beijing, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0008-0095-314X","authenticated-orcid":false,"given":"Zhangjie","family":"Huang","sequence":"additional","affiliation":[{"name":"Digital Technologies, Ant Group, Hangzhou, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5307-2353","authenticated-orcid":false,"given":"Li","family":"Lin","sequence":"additional","affiliation":[{"name":"Digital Technologies, Ant Group, Beijing, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0000-4635-8946","authenticated-orcid":false,"given":"Changzheng","family":"Wei","sequence":"additional","affiliation":[{"name":"Digital Technologies, Ant Group, Shanghai, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0003-3890-6238","authenticated-orcid":false,"given":"Ying","family":"Yan","sequence":"additional","affiliation":[{"name":"Digital Technologies, Ant Group, Beijing, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0004-9567-4901","authenticated-orcid":false,"given":"Wei","family":"Wang","sequence":"additional","affiliation":[{"name":"Digital Technologies, Ant Group, Hangzhou, China"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2024,12,9]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/3319535.3339819"},{"key":"e_1_3_2_1_2_1","volume-title":"Communication-Computation Trade-offs in PIR, Michael Bailey and Rachel brownstadt (Eds.)","author":"Ali Asra","unstructured":"Asra Ali, Tancr\u00e8de Lepoint, Sarvar Patel, Mariana Raykova, Phillipp Schoppmann, Karn Seth, and Kevin Yeo. 2021. Communication-Computation Trade-offs in PIR, Michael Bailey and Rachel brownstadt (Eds.). USENIX Association."},{"key":"e_1_3_2_1_3_1","volume-title":"Setty","author":"Angel Sebastian","year":"2018","unstructured":"Sebastian Angel, Hao Chen, Kim Laine, and Srinath T. V. Setty. 2018. PIR with Compressed Queries and Amortized Query Processing. IEEE Computer Society."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-29011-4_29"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/3576915.3623136"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-32009-5_50"},{"key":"e_1_3_2_1_7_1","volume-title":"Theory","author":"Brakerski Zvika","year":"2014","unstructured":"Zvika Brakerski, Craig Gentry, and Vinod Vaikuntanathan. 2014. (Leveled) Fully Homomorphic Encryption without Bootstrapping. ACM Trans. Comput. Theory (2014)."},{"key":"e_1_3_2_1_8_1","unstructured":"Tom B. Brown Benjamin Mann Nick Ryder Melanie Subbiah Jared Kaplan Prafulla Dhariwal Arvind Neelakantan Pranav Shyam Girish Sastry Amanda Askell Sandhini Agarwal Ariel Herbert-Voss Gretchen Krueger Tom Henighan Rewon Child Aditya Ramesh Daniel M. Ziegler Jeffrey Wu Clemens Winter Christopher Hesse Mark Chen Eric Sigler Mateusz Litwin Scott Gray Benjamin Chess Jack Clark Christopher Berner Sam McCandlish Alec Radford Ilya Sutskever and Dario Amodei. 2020. Language Models are Few-Shot Learners."},{"key":"e_1_3_2_1_9_1","volume-title":"EzPC: Programmable and Efficient Secure Two-Party Computation for Machine Learning. In 2019 IEEE European Symposium on Security and Privacy (EuroS&P). 496--511","author":"Chandran Nishanth","year":"2019","unstructured":"Nishanth Chandran, Divya Gupta, Aseem Rastogi, Rahul Sharma, and Shardul Tripathi. 2019. EzPC: Programmable and Efficient Secure Two-Party Computation for Machine Learning. In 2019 IEEE European Symposium on Security and Privacy (EuroS&P). 496--511."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"crossref","unstructured":"Chaochao Chen Jun Zhou Li Wang Xibin Wu Wenjing Fang Jin Tan Lei Wang Alex X. Liu Hao Wang and Cheng Hong. 2021. When Homomorphic Encryption Marries Secret Sharing: Secure Large-Scale Sparse Logistic Regression and Applications in Risk Control Feida Zhu Beng Chin Ooi and Chunyan Miao (Eds.). ACM.","DOI":"10.1145\/3447548.3467210"},{"key":"e_1_3_2_1_11_1","volume-title":"Efficient Homomorphic Conversion Between (Ring) LWE Ciphertexts","author":"Chen Hao","unstructured":"Hao Chen, Wei Dai, Miran Kim, and Yongsoo Song. 2021. Efficient Homomorphic Conversion Between (Ring) LWE Ciphertexts, Kazue Sako and Nils Ole Tippenhauer (Eds.). Springer."},{"key":"e_1_3_2_1_12_1","volume-title":"Homomorphic encryption for arithmetic of approximate numbers","author":"Cheon Jung Hee","unstructured":"Jung Hee Cheon, Andrey Kim, Miran Kim, and Yongsoo Song. 2017. Homomorphic encryption for arithmetic of approximate numbers. Springer."},{"key":"e_1_3_2_1_13_1","volume-title":"Non-interactive Secure Computation of Inner-Product from LPN and LWE","author":"Couteau Geoffroy","unstructured":"Geoffroy Couteau and Maryam Zarezadeh. 2022. Non-interactive Secure Computation of Inner-Product from LPN and LWE, Shweta Agrawal and Dongdai Lin (Eds.). Springer."},{"key":"e_1_3_2_1_14_1","unstructured":"Anders Dalskov Daniel Escudero and Marcel Keller. 2019. Secure Evaluation of Quantized Neural Networks. Cryptology ePrint Archive Report 2019\/131. https:\/\/eprint.iacr.org\/2019\/131."},{"key":"e_1_3_2_1_15_1","volume-title":"Proceedings of the 2019 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies, NAACL-HLT 2019","volume":"1","author":"Devlin Jacob","year":"2019","unstructured":"Jacob Devlin, Ming-Wei Chang, Kenton Lee, and Kristina Toutanova. 2019. BERT: Pre-training of Deep Bidirectional Transformers for Language Understanding. In Proceedings of the 2019 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies, NAACL-HLT 2019, Minneapolis, MN, USA, June 2--7, 2019, Volume 1 (Long and Short Papers). 4171--4186."},{"key":"e_1_3_2_1_16_1","unstructured":"Junfeng Fan and Frederik Vercauteren. 2012. Somewhat Practical Fully Homomorphic Encryption. IACR Cryptol. ePrint Arch. (2012) 144."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/1536414.1536440"},{"key":"e_1_3_2_1_18_1","volume-title":"SIGMA: Secure GPT Inference with Function Secret Sharing. IACR Cryptol. ePrint Arch.","author":"Gupta Kanav","year":"2023","unstructured":"Kanav Gupta, Neha Jawalkar, Ananta Mukherjee, Nishanth Chandran, Divya Gupta, Ashish Panwar, and Rahul Sharma. 2023. SIGMA: Secure GPT Inference with Function Secret Sharing. IACR Cryptol. ePrint Arch. (2023), 1269."},{"key":"e_1_3_2_1_19_1","volume-title":"Juan A. Garay and Rosario Gennaro (Eds.)","author":"Halevi Shai","unstructured":"Shai Halevi and Victor Shoup. 2014. Algorithms in HElib, Juan A. Garay and Rosario Gennaro (Eds.). Springer."},{"key":"e_1_3_2_1_20_1","unstructured":"Shai Halevi and Victor Shoup. 2020. Design and implementation of HElib: a homomorphic encryption library. IACR Cryptol. ePrint Arch. (2020) 1481."},{"key":"e_1_3_2_1_21_1","volume-title":"Iron: Private Inference on Transformers. In Advances in Neural Information Processing Systems, Alice H. Oh, Alekh Agarwal, Danielle Belgrave, and Kyunghyun Cho (Eds.).","author":"Hao Meng","year":"2022","unstructured":"Meng Hao, Hongwei Li, Hanxiao Chen, Pengzhi Xing, Guowen Xu, and Tianwei Zhang. 2022. Iron: Private Inference on Transformers. In Advances in Neural Information Processing Systems, Alice H. Oh, Alekh Agarwal, Danielle Belgrave, and Kyunghyun Cho (Eds.)."},{"key":"e_1_3_2_1_22_1","unstructured":"Kaiming He Xiangyu Zhang Shaoqing Ren and Jian Sun. 2015. Deep Residual Learning for Image Recognition. arXiv:1512.03385 [cs.CV]"},{"key":"e_1_3_2_1_23_1","volume-title":"Cheng Hong, and Kui Ren.","author":"Hou Xiaoyang","year":"2023","unstructured":"Xiaoyang Hou, Jian Liu, Jingyu Li, Yuhan Li, Wen jie Lu, Cheng Hong, and Kui Ren. 2023. CipherGPT: Secure Two-Party GPT Inference. Cryptology ePrint Archive, Paper 2023\/1147. https:\/\/eprint.iacr.org\/2023\/1147."},{"key":"e_1_3_2_1_24_1","volume-title":"Weinberger","author":"Huang Gao","year":"2018","unstructured":"Gao Huang, Zhuang Liu, Laurens van der Maaten, and Kilian Q. Weinberger. 2018. Densely Connected Convolutional Networks. arXiv:1608.06993 [cs.CV]"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11227-022-04850-4"},{"key":"e_1_3_2_1_26_1","volume-title":"Cheng Hong, and Jiansheng Ding.","author":"Huang Zhicong","year":"2022","unstructured":"Zhicong Huang, Wen jie Lu, Cheng Hong, and Jiansheng Ding. 2022. OpenCheetah: Lean and Fast Secure Two-Party Deep Neural Network Inference. Open-sourced libary is available at https:\/\/github.com\/Alibaba-Gemini-Lab\/ OpenCheetah."},{"key":"e_1_3_2_1_27_1","volume-title":"Cheetah: Lean and Fast Secure Two-Party Deep Neural Network Inference, Kevin R","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, Kevin R. B. Butler and Kurt Thomas (Eds.). USENIX Association."},{"key":"e_1_3_2_1_28_1","volume-title":"COINN: Crypto\/ML Codesign for Oblivious Inference via Neural Networks. In ACM CCS","author":"Hussain Siam Umar","year":"2021","unstructured":"Siam Umar Hussain, Mojan Javaheripi, Mohammad Samragh, and Farinaz Koushanfar. 2021. COINN: Crypto\/ML Codesign for Oblivious Inference via Neural Networks. In ACM CCS 2021, Giovanni Vigna and Elaine Shi (Eds.). ACM Press, Virtual Event, Republic of Korea, 3266--3281. https:\/\/doi.org\/10.1145\/ 3460120.3484797"},{"key":"e_1_3_2_1_29_1","unstructured":"Forrest N. Iandola Song Han Matthew W. Moskewicz Khalid Ashraf William J. Dally and Kurt Keutzer. 2016. SqueezeNet: AlexNet-level accuracy with 50x fewer parameters and 0.5MB model size. arXiv:1602.07360 [cs.CV]"},{"key":"e_1_3_2_1_30_1","volume-title":"23rd Annual International Cryptology Conference, Santa Barbara, California, USA, August 17--21, 2003, Proceedings (Lecture Notes in Computer Science","volume":"161","author":"Ishai Yuval","year":"2003","unstructured":"Yuval Ishai, Joe Kilian, Kobbi Nissim, and Erez Petrank. 2003. Extending Oblivious Transfers Efficiently. In Advances in Cryptology - CRYPTO 2003, 23rd Annual International Cryptology Conference, Santa Barbara, California, USA, August 17--21, 2003, Proceedings (Lecture Notes in Computer Science, Vol. 2729), Dan Boneh (Ed.). Springer, 145--161."},{"key":"e_1_3_2_1_31_1","volume-title":"Proceedings of the 2018 ACM SIGSAC Conference on Computer and Communications Security, CCS 2018.","author":"Jiang Xiaoqian","unstructured":"Xiaoqian Jiang, Miran Kim, Kristin E. Lauter, and Yongsoo Song. [n. d.]. Secure Outsourced Matrix Computation and Application to Neural Networks. In Proceedings of the 2018 ACM SIGSAC Conference on Computer and Communications Security, CCS 2018."},{"key":"e_1_3_2_1_32_1","volume-title":"Chandrakasan","author":"Juvekar Chiraag","year":"2018","unstructured":"Chiraag Juvekar, Vinod Vaikuntanathan, and Anantha P. Chandrakasan. 2018. GAZELLE: A Low Latency Framework for Secure Neural Network Inference, William Enck and Adrienne Porter Felt (Eds.). USENIX Association."},{"key":"e_1_3_2_1_33_1","volume-title":"Revisiting Homomorphic Encryption Schemes for Finite Fields","author":"Kim Andrey","unstructured":"Andrey Kim, Yuriy Polyakov, and Vincent Zucca. 2021. Revisiting Homomorphic Encryption Schemes for Finite Fields, Mehdi Tibouchi and HuaxiongWang (Eds.). Springer."},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/3470496.3527415"},{"key":"e_1_3_2_1_35_1","volume-title":"CrypTFlow: Secure TensorFlow Inference. In 2020 IEEE Symposium on Security and Privacy, SP","author":"Kumar Nishant","year":"2020","unstructured":"Nishant Kumar, Mayank Rathee, Nishanth Chandran, Divya Gupta, Aseem Rastogi, and Rahul Sharma. [n. d.]. CrypTFlow: Secure TensorFlow Inference. In 2020 IEEE Symposium on Security and Privacy, SP 2020."},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2022.3159694"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"crossref","unstructured":"Jian Liu Mika Juuti Yao Lu and N. Asokan. 2017. Oblivious Neural Network Predictions via MiniONN Transformations Bhavani Thuraisingham David Evans Tal Malkin and Dongyan Xu (Eds.). ACM.","DOI":"10.1145\/3133956.3134056"},{"key":"e_1_3_2_1_38_1","unstructured":"Wen-jie Lu Zhicong Huang Zhen Gu Jingyu Li Jian Liu Kui Ren Cheng Hong Tao Wei and Wenguang Chen. 2023. BumbleBee: Secure Two-party Inference Framework for Large Transformers. IACR Cryptol. ePrint Arch. (2023) 1678. https:\/\/eprint.iacr.org\/2023\/1678"},{"key":"e_1_3_2_1_39_1","volume-title":"Henri Gilbert (Ed.)","author":"Lyubashevsky Vadim","unstructured":"Vadim Lyubashevsky, Chris Peikert, and Oded Regev. 2010. On Ideal Lattices and Learning with Errors over Rings, Henri Gilbert (Ed.). Springer."},{"key":"e_1_3_2_1_40_1","volume-title":"Delphi: A Cryptographic Inference Service for Neural Networks","author":"Mishra Pratyush","year":"2020","unstructured":"Pratyush Mishra, Ryan Lehmkuhl, Akshayaram Srinivasan, Wenting Zheng, and Raluca Ada Popa. 2020. Delphi: A Cryptographic Inference Service for Neural Networks, Srdjan Capkun and Franziska Roesner (Eds.). USENIX Association."},{"key":"e_1_3_2_1_41_1","volume-title":"SecureML: A System for Scalable Privacy-Preserving Machine Learning. In 2017 IEEE Symposium on Security and Privacy, SP 2017","author":"Mohassel Payman","year":"2017","unstructured":"Payman Mohassel and Yupeng Zhang. 2017. SecureML: A System for Scalable Privacy-Preserving Machine Learning. In 2017 IEEE Symposium on Security and Privacy, SP 2017, San Jose, CA, USA, May 22--26, 2017. IEEE Computer Society, 19--38."},{"key":"e_1_3_2_1_42_1","volume-title":"Chow","author":"Ng Lucien K. L.","year":"2021","unstructured":"Lucien K. L. Ng and Sherman S. M. Chow. 2021. GForce: GPU-Friendly Oblivious and Rapid Neural Network Inference. In USENIX Security 2021, Michael Bailey and Rachel Greenstadt (Eds.). USENIX Association, 2147--2164."},{"key":"e_1_3_2_1_43_1","volume-title":"BOLT: Privacy-Preserving, Accurate and Efficient Inference for Transformers. IACR Cryptol. ePrint Arch.","author":"Pang Qi","year":"2023","unstructured":"Qi Pang, Jinhao Zhu, Helen M\u00f6llering, Wenting Zheng, and Thomas Schneider. 2023. BOLT: Privacy-Preserving, Accurate and Efficient Inference for Transformers. IACR Cryptol. ePrint Arch. (2023), 1893. https:\/\/eprint.iacr.org\/2023\/1893"},{"key":"e_1_3_2_1_44_1","volume-title":"30th USENIX Security Symposium, USENIX Security 2021","author":"Patra Arpita","year":"2021","unstructured":"Arpita Patra, Thomas Schneider, Ajith Suresh, and Hossein Yalame. 2021. ABY2.0: Improved Mixed-Protocol Secure Two-Party Computation. In 30th USENIX Security Symposium, USENIX Security 2021, August 11--13, 2021, Michael D. Bailey and Rachel Greenstadt (Eds.). USENIX Association, 2165--2182."},{"key":"e_1_3_2_1_45_1","volume-title":"Secure Floating-Point Training. In 32nd USENIX Security Symposium (USENIX Security","author":"Rathee Deevashwer","year":"2023","unstructured":"Deevashwer Rathee, Anwesh Bhattacharya, Divya Gupta, Rahul Sharma, and Dawn Song. 2023. Secure Floating-Point Training. In 32nd USENIX Security Symposium (USENIX Security 2023). USENIX Association, 6329--6346."},{"key":"e_1_3_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP46214.2022.9833697"},{"key":"e_1_3_2_1_47_1","volume-title":"Divya Gupta, Rahul Sharma, Nishanth Chandran, and Aseem Rastogi.","author":"Rathee Deevashwer","year":"2021","unstructured":"Deevashwer Rathee, Mayank Rathee, Rahul Kranti Kiran Goli, Divya Gupta, Rahul Sharma, Nishanth Chandran, and Aseem Rastogi. 2021. SiRnn: A Math Library for Secure RNN Inference. IEEE."},{"key":"e_1_3_2_1_48_1","doi-asserted-by":"crossref","unstructured":"Deevashwer Rathee Mayank Rathee Nishant Kumar Nishanth Chandran Divya Gupta Aseem Rastogi and Rahul Sharma. 2020. CrypTFlow2: Practical 2-Party Secure Inference Jay Ligatti Xinming Ou Jonathan Katz and Giovanni Vigna (Eds.). ACM.","DOI":"10.1145\/3372297.3417274"},{"key":"e_1_3_2_1_49_1","volume-title":"CHAM: A Customized Homomorphic Encryption Accelerator for Fast Matrix-Vector Product. In 60th ACM\/IEEE Design Automation Conference, DAC","author":"Ren Xuanle","year":"2023","unstructured":"Xuanle Ren, Zhaohui Chen, Zhen Gu, Yanheng Lu, Ruiguang Zhong, Wen-Jie Lu, Jiansong Zhang, Yichi Zhang, HanghangWu, Xiaofu Zheng, Heng Liu, Tingqiang Chu, Cheng Hong, Changzheng Wei, Dimin Niu, and Yuan Xie. [n. d.]. CHAM: A Customized Homomorphic Encryption Accelerator for Fast Matrix-Vector Product. In 60th ACM\/IEEE Design Automation Conference, DAC 2023."},{"key":"e_1_3_2_1_50_1","volume-title":"XONN: XNOR-based Oblivious Deep Neural Network Inference. In USENIX Security","author":"Riazi M. Sadegh","year":"2019","unstructured":"M. Sadegh Riazi, Mohammad Samragh, Hao Chen, Kim Laine, Kristin E. Lauter, and Farinaz Koushanfar. 2019. XONN: XNOR-based Oblivious Deep Neural Network Inference. In USENIX Security 2019, Nadia Heninger and Patrick Traynor (Eds.). USENIX Association, Santa Clara, CA, USA, 1501--1518."},{"key":"e_1_3_2_1_51_1","doi-asserted-by":"publisher","DOI":"10.1145\/3470496.3527393"},{"key":"e_1_3_2_1_52_1","doi-asserted-by":"publisher","DOI":"10.1145\/3319535.3339816"},{"key":"e_1_3_2_1_53_1","volume-title":"https:\/\/github.com\/Microsoft\/SEAL. Microsoft Research","author":"SEAL","unstructured":"SEAL 2021. Microsoft SEAL (release 3.7). https:\/\/github.com\/Microsoft\/SEAL. Microsoft Research, Redmond, WA.."},{"key":"e_1_3_2_1_54_1","volume-title":"ABNN2: Secure Two-Party Arbitrary-Bitwidth Quantized Neural Network Predictions","author":"Shen Liyan","unstructured":"Liyan Shen, Ye Dong, Binxing Fang, Jinqiao Shi, Xuebin Wang, Shengli Pan, and Ruisheng Shi. 2022. ABNN2: Secure Two-Party Arbitrary-Bitwidth Quantized Neural Network Predictions. Association for Computing Machinery."},{"key":"e_1_3_2_1_55_1","unstructured":"Xiao Wang Alex J. Malozemoff and Jonathan Katz. 2016. EMP-toolkit: Efficient MultiParty computation toolkit. https:\/\/github.com\/emp-toolkit."},{"key":"e_1_3_2_1_56_1","volume-title":"Ferret: Fast Extension for Correlated OT with Small Communication. In CCS '20: 2020 ACM SIGSAC Conference on Computer and Communications Security","author":"Yang Kang","year":"2020","unstructured":"Kang Yang, Chenkai Weng, Xiao Lan, Jiang Zhang, and Xiao Wang. 2020. Ferret: Fast Extension for Correlated OT with Small Communication. In CCS '20: 2020 ACM SIGSAC Conference on Computer and Communications Security, Virtual Event, USA, November 9--13, 2020, Jay Ligatti, Xinming Ou, Jonathan Katz, and Giovanni Vigna (Eds.). ACM, 1607--1626."},{"key":"e_1_3_2_1_57_1","unstructured":"Jiawen Zhang Jian Liu Xinpeng Yang Yinghao Wang Kejia Chen Xiaoyang Hou Kui Ren and Xiaohu Yang. 2024. Secure Transformer Inference Made Noninteractive. IACR Cryptol. ePrint Arch. (2024) 136. https:\/\/eprint.iacr.org\/2024\/136"},{"key":"e_1_3_2_1_58_1","volume-title":"GALA: Greedy ComputAtion for Linear Algebra in Privacy-Preserved Neural Networks. In 28th Annual Network and Distributed System Security Symposium, NDSS 2021","author":"Zhang Qiao","year":"2021","unstructured":"Qiao Zhang, Chunsheng Xin, and HongyiWu. 2021. GALA: Greedy ComputAtion for Linear Algebra in Privacy-Preserved Neural Networks. In 28th Annual Network and Distributed System Security Symposium, NDSS 2021, virtually, February 21--25, 2021. The Internet Society."}],"event":{"name":"CCS '24: ACM SIGSAC Conference on Computer and Communications Security","location":"Salt Lake City UT USA","acronym":"CCS '24","sponsor":["SIGSAC ACM Special Interest Group on Security, Audit, and Control"]},"container-title":["Proceedings of the 2024 on ACM SIGSAC Conference on Computer and Communications Security"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3658644.3690281","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3658644.3690281","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,22]],"date-time":"2025-08-22T06:16:58Z","timestamp":1755843418000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3658644.3690281"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,12,2]]},"references-count":58,"alternative-id":["10.1145\/3658644.3690281","10.1145\/3658644"],"URL":"https:\/\/doi.org\/10.1145\/3658644.3690281","relation":{},"subject":[],"published":{"date-parts":[[2024,12,2]]},"assertion":[{"value":"2024-12-09","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}