{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,22]],"date-time":"2025-12-22T22:22:09Z","timestamp":1766442129059,"version":"3.48.0"},"publisher-location":"New York, NY, USA","reference-count":47,"publisher":"ACM","content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2025,11,19]]},"DOI":"10.1145\/3719027.3765025","type":"proceedings-article","created":{"date-parts":[[2025,11,22]],"date-time":"2025-11-22T23:33:16Z","timestamp":1763854396000},"page":"3649-3663","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Lodia: Towards Optimal Sparse Matrix-Vector Multiplication for Batched Fully Homomorphic Encryption"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6643-4405","authenticated-orcid":false,"given":"Jiping","family":"Yu","sequence":"first","affiliation":[{"name":"Tsinghua University, Beijing, China and Ant Group, Beijing, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2370-5372","authenticated-orcid":false,"given":"Kun","family":"Chen","sequence":"additional","affiliation":[{"name":"Ant Group, Beijing, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6962-643X","authenticated-orcid":false,"given":"Xiaoyu","family":"Fan","sequence":"additional","affiliation":[{"name":"Tsinghua University, Beijing, China and Ant Group, Beijing, China"}]},{"ORCID":"https:\/\/orcid.org\/0009-0002-0279-0539","authenticated-orcid":false,"given":"Yunyi","family":"Chen","sequence":"additional","affiliation":[{"name":"Tsinghua University, Beijing, China and Ant Group, Beijing, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3880-308X","authenticated-orcid":false,"given":"Xiaowei","family":"Zhu","sequence":"additional","affiliation":[{"name":"Ant Group, Beijing, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4281-1018","authenticated-orcid":false,"given":"Wenguang","family":"Chen","sequence":"additional","affiliation":[{"name":"Department of Computer Science and SIGS, Tsinghua University, Beijing, China and Ant Group, Beijing, China"}]}],"member":"320","published-online":{"date-parts":[[2025,11,22]]},"reference":[{"volume-title":"Proceedings of the 13th international conference on World Wide Web. 595\u2013602","key":"e_1_3_2_2_1_1","unstructured":"2004. The webgraph framework I: compression techniques. In Proceedings of the 13th international conference on World Wide Web. 595\u2013602."},{"key":"e_1_3_2_2_2_1","volume-title":"Plaintext-Ciphertext Matrix Multiplication and FHE Bootstrapping: Fast and Fused. In Annual International Cryptology Conference. Springer, 387-421","author":"Bae Youngjin","year":"2024","unstructured":"Youngjin Bae, Jung Hee Cheon, Guillaume Hanrot, Jai Hyun Park, and Damien Stehl\u00e9. 2024. Plaintext-Ciphertext Matrix Multiplication and FHE Bootstrapping: Fast and Fused. In Annual International Cryptology Conference. Springer, 387-421."},{"key":"e_1_3_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/3576915.3623136"},{"key":"e_1_3_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/1654059.1654078"},{"volume-title":"Mathematical theory of connecting networks and telephone traffic","author":"Bene\u0161 V\u00e1clav E","key":"e_1_3_2_2_5_1","unstructured":"V\u00e1clav E Bene\u0161. 1965. Mathematical theory of connecting networks and telephone traffic. Academic press."},{"key":"e_1_3_2_2_6_1","volume-title":"Neural networks and their applications. Review of scientific instruments","author":"Bishop Chris M","year":"1994","unstructured":"Chris M Bishop. 1994. Neural networks and their applications. Review of scientific instruments, Vol. 65, 6 (1994), 1803-1832."},{"key":"e_1_3_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-32009-5_50"},{"key":"e_1_3_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/2633600"},{"key":"e_1_3_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/1583991.1584053"},{"key":"e_1_3_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-64840-4_2"},{"key":"e_1_3_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-70694-8_15"},{"key":"e_1_3_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00145-019-09319-x"},{"key":"e_1_3_2_2_13_1","volume-title":"CKKS","author":"Clet Pierre-Emmanuel","year":"2021","unstructured":"Pierre-Emmanuel Clet, Oana Stan, and Martin Zuber. 2021. BFV, CKKS, TFHE: Which one is the best for a secure neural network evaluation in the cloud?. In Applied Cryptography and Network Security Workshops: ACNS 2021 Satellite Workshops, AIBlock, AIHWS, AIoTS, CIMSS, Cloud S&P, SCI, SecMT, and SiMLA, Kamakura, Japan, June 21-24, 2021, Proceedings. Springer, 279-300."},{"key":"e_1_3_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/2049662.2049663"},{"key":"e_1_3_2_2_15_1","volume-title":"Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms. SIAM, 1060-1079","author":"Sa Christopher De","year":"2018","unstructured":"Christopher De Sa, Albert Cu, Rohan Puttagunta, Christopher R\u00e9, and Atri Rudra. 2018. A two-pronged progress in structured dense matrix vector multiplication. In Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms. SIAM, 1060-1079."},{"key":"e_1_3_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-46800-5_24"},{"key":"e_1_3_2_2_17_1","doi-asserted-by":"publisher","DOI":"10.1002\/9781118267028"},{"key":"e_1_3_2_2_18_1","volume-title":"Somewhat practical fully homomorphic encryption. Cryptology ePrint Archive","author":"Fan Junfeng","year":"2012","unstructured":"Junfeng Fan and Frederik Vercauteren. 2012. Somewhat practical fully homomorphic encryption. Cryptology ePrint Archive (2012)."},{"key":"e_1_3_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/3721146.3721948"},{"key":"e_1_3_2_2_20_1","volume-title":"GMS: an efficient fully homomorphic encryption scheme for secure outsourced matrix multiplication. The Journal of Supercomputing","author":"Gao Jianxin","year":"2024","unstructured":"Jianxin Gao and Ying Gao. 2024. GMS: an efficient fully homomorphic encryption scheme for secure outsourced matrix multiplication. The Journal of Supercomputing (2024), 1-27."},{"key":"e_1_3_2_2_21_1","volume-title":"Secure and efficient general matrix multiplication on cloud using homomorphic encryption. The Journal of Supercomputing","author":"Gao Yang","year":"2024","unstructured":"Yang Gao, Gang Quan, Soamar Homsi, Wujie Wen, and Liqiang Wang. 2024. Secure and efficient general matrix multiplication on cloud using homomorphic encryption. The Journal of Supercomputing (2024), 1-41."},{"volume-title":"An introduction to neural networks","author":"Gurney Kevin","key":"e_1_3_2_2_22_1","unstructured":"Kevin Gurney. 2018. An introduction to neural networks. CRC press."},{"key":"e_1_3_2_2_23_1","first-page":"554","volume-title":"USA","author":"Halevi Shai","year":"2014","unstructured":"Shai Halevi and Victor Shoup. 2014. Algorithms in helib. In Advances in Cryptology-CRYPTO 2014: 34th Annual Cryptology Conference, Santa Barbara, CA, USA, August 17-21, 2014, Proceedings, Part I 34. Springer, 554-571."},{"key":"e_1_3_2_2_24_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-96884-1_4"},{"key":"e_1_3_2_2_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/3658644.3690281"},{"key":"e_1_3_2_2_26_1","doi-asserted-by":"publisher","DOI":"10.1109\/TDSC.2021.3139318"},{"key":"e_1_3_2_2_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/3243734.3243837"},{"key":"e_1_3_2_2_28_1","volume-title":"GAZELLE: A low latency framework for secure neural network inference. In 27th USENIX security symposium (USENIX security 18). 1651-1669.","author":"Juvekar Chiraag","year":"2018","unstructured":"Chiraag Juvekar, Vinod Vaikuntanathan, and Anantha Chandrakasan. 2018. GAZELLE: A low latency framework for secure neural network inference. In 27th USENIX security symposium (USENIX security 18). 1651-1669."},{"key":"e_1_3_2_2_29_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611974782.142"},{"key":"e_1_3_2_2_30_1","doi-asserted-by":"crossref","unstructured":"W Leontief. 1986. Input-Output Economics.","DOI":"10.1057\/978-1-349-95121-5_1072-1"},{"key":"e_1_3_2_2_31_1","unstructured":"Jure Leskovec and Andrej Krevl. 2014. SNAP Datasets: Stanford Large Network Dataset Collection. http:\/\/snap.stanford.edu\/data."},{"key":"e_1_3_2_2_32_1","doi-asserted-by":"publisher","DOI":"10.1142\/S0217979214502087"},{"key":"e_1_3_2_2_33_1","first-page":"6435","volume-title":"Squirrel: A Scalable Secure Two-Party Computation Framework for Training Gradient Boosting Decision Tree. In 32nd USENIX Security Symposium (USENIX Security 23)","author":"Huang Zhicong","year":"2023","unstructured":"Wen-jie Lu, Zhicong Huang, Qizhi Zhang, Yuchen Wang, and Cheng Hong. 2023. Squirrel: A Scalable Secure Two-Party Computation Framework for Training Gradient Boosting Decision Tree. In 32nd USENIX Security Symposium (USENIX Security 23). 6435-6451."},{"key":"e_1_3_2_2_34_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.cose.2023.103658"},{"key":"e_1_3_2_2_35_1","unstructured":"Pradeep Kumar Mishra. 2018. Faster Secure Matrix Computations over Homomorphic Encryption. (2018)."},{"key":"e_1_3_2_2_36_1","doi-asserted-by":"publisher","DOI":"10.1080\/19393555.2020.1836288"},{"key":"e_1_3_2_2_37_1","unstructured":"Lawrence Page Sergey Brin Rajeev Motwani Terry Winograd et al. 1999. The pagerank citation ranking: Bringing order to the web. (1999)."},{"key":"e_1_3_2_2_38_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-91101-9_6"},{"key":"e_1_3_2_2_39_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611976465.31"},{"key":"e_1_3_2_2_40_1","doi-asserted-by":"publisher","DOI":"10.1145\/3560810.3564267"},{"key":"e_1_3_2_2_41_1","doi-asserted-by":"publisher","DOI":"10.1145\/361219.361220"},{"key":"e_1_3_2_2_42_1","doi-asserted-by":"publisher","DOI":"10.1007\/11557654_91"},{"key":"e_1_3_2_2_43_1","doi-asserted-by":"publisher","DOI":"10.1145\/1362622.1362674"},{"key":"e_1_3_2_2_44_1","volume-title":"Privacy preserving vertical federated learning for tree-based models. arXiv preprint arXiv:2008.06170","author":"Wu Yuncheng","year":"2020","unstructured":"Yuncheng Wu, Shaofeng Cai, Xiaokui Xiao, Gang Chen, and Beng Chin Ooi. 2020. Privacy preserving vertical federated learning for tree-based models. arXiv preprint arXiv:2008.06170 (2020)."},{"key":"e_1_3_2_2_45_1","volume-title":"Lodia: Towards Optimal Sparse Matrix-Vector Multiplication for Batched Fully Homomorphic Encryption. Cryptology ePrint Archive, Paper 2025\/1425. https:\/\/eprint.iacr.org\/2025\/1425","author":"Yu Jiping","year":"2025","unstructured":"Jiping Yu, Kun Chen, Xiaoyu Fan, Yunyi Chen, Xiaowei Zhu, and Wenguang Chen. 2025. Lodia: Towards Optimal Sparse Matrix-Vector Multiplication for Batched Fully Homomorphic Encryption. Cryptology ePrint Archive, Paper 2025\/1425. https:\/\/eprint.iacr.org\/2025\/1425"},{"key":"e_1_3_2_2_46_1","volume-title":"GALA: Greedy computation for linear algebra in privacy-preserved neural networks. arXiv preprint arXiv:2105.01827","author":"Zhang Qiao","year":"2021","unstructured":"Qiao Zhang, Chunsheng Xin, and Hongyi Wu. 2021. GALA: Greedy computation for linear algebra in privacy-preserved neural networks. arXiv preprint arXiv:2105.01827 (2021)."},{"key":"e_1_3_2_2_47_1","volume-title":"A New Framework for Fast Homomorphic Matrix Multiplication. Cryptology ePrint Archive","author":"Zheng Xiaopeng","year":"2023","unstructured":"Xiaopeng Zheng, Hongbo Li, and Dingkang Wang. 2023. A New Framework for Fast Homomorphic Matrix Multiplication. Cryptology ePrint Archive (2023)."}],"event":{"name":"CCS '25: ACM SIGSAC Conference on Computer and Communications Security","sponsor":["SIGSAC ACM Special Interest Group on Security, Audit, and Control"],"location":"Taipei Taiwan","acronym":"CCS '25"},"container-title":["Proceedings of the 2025 ACM SIGSAC Conference on Computer and Communications Security"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3719027.3765025","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,12,22]],"date-time":"2025-12-22T22:18:29Z","timestamp":1766441909000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3719027.3765025"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,11,19]]},"references-count":47,"alternative-id":["10.1145\/3719027.3765025","10.1145\/3719027"],"URL":"https:\/\/doi.org\/10.1145\/3719027.3765025","relation":{},"subject":[],"published":{"date-parts":[[2025,11,19]]},"assertion":[{"value":"2025-11-22","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}