{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,2]],"date-time":"2026-07-02T13:43:47Z","timestamp":1782999827299,"version":"3.54.5"},"publisher-location":"New York, NY, USA","reference-count":43,"publisher":"ACM","license":[{"start":{"date-parts":[[2026,7,5]],"date-time":"2026-07-05T00:00:00Z","timestamp":1783209600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2026,7,6]]},"DOI":"10.1145\/3797905.3807876","type":"proceedings-article","created":{"date-parts":[[2026,7,2]],"date-time":"2026-07-02T11:50:37Z","timestamp":1782993037000},"page":"1220-1231","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["CipherSkip: Efficient Sparse Matrix Multiplication with FHE"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0009-0004-4853-3268","authenticated-orcid":false,"given":"Wujie","family":"Xiong","sequence":"first","affiliation":[{"name":"Kent State University, Kent, Ohio, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0001-1048-5502","authenticated-orcid":false,"given":"Hao","family":"Zhou","sequence":"additional","affiliation":[{"name":"Kent State Univeristy, Kent, Ohio, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6874-5741","authenticated-orcid":false,"given":"Yutong","family":"Ye","sequence":"additional","affiliation":[{"name":"Beihang University, Beijing, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1895-4243","authenticated-orcid":false,"given":"Ruoming","family":"Jin","sequence":"additional","affiliation":[{"name":"Kent State University, Kent, Ohio, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7662-2119","authenticated-orcid":false,"given":"Lei","family":"Xu","sequence":"additional","affiliation":[{"name":"Kent State University, Kent, Ohio, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2026,7,5]]},"reference":[{"key":"e_1_3_3_2_2_2","doi-asserted-by":"crossref","unstructured":"Abbas Acar Hidayet Aksu A\u00a0Selcuk Uluagac and Mauro Conti. 2018. A survey on homomorphic encryption schemes: Theory and implementation. ACM Computing Surveys (Csur) 51 4 (2018) 1\u201335.","DOI":"10.1145\/3214303"},{"key":"e_1_3_3_2_3_2","first-page":"51","volume-title":"International Conference on Cryptology in India","author":"Aikata Aikata","year":"2024","unstructured":"Aikata Aikata and Sujoy\u00a0Sinha Roy. 2024. Secure and Efficient Outsourced Matrix Multiplication with Homomorphic Encryption. In International Conference on Cryptology in India. Springer, 51\u201374."},{"key":"e_1_3_3_2_4_2","doi-asserted-by":"crossref","unstructured":"Giedrius Alkauskas. 2009. A curious proof of Fermat\u2019s Little Theorem. The American Mathematical Monthly 116 4 (2009) 362\u2013364.","DOI":"10.1080\/00029890.2009.11920949"},{"key":"e_1_3_3_2_5_2","doi-asserted-by":"crossref","unstructured":"Ariful Azad Ayd\u0131n Bulu\u00e7 and John\u00a0R. Gilbert. 2015. Parallel Triangle Counting and Enumeration Using Matrix Algebra. 2015 IEEE International Parallel and Distributed Processing Symposium Workshop (2015) 804\u2013811. https:\/\/api.semanticscholar.org\/CorpusID:2796736","DOI":"10.1109\/IPDPSW.2015.75"},{"key":"e_1_3_3_2_6_2","doi-asserted-by":"crossref","unstructured":"Ariful Azad Georgios\u00a0A Pavlopoulos Christos\u00a0A Ouzounis Nikos\u00a0C Kyrpides and Aydin Bulu\u00e7. 2018. HipMCL: a high-performance parallel implementation of the Markov clustering algorithm for large-scale networks. Nucleic acids research 46 6 (2018) e33\u2013e33.","DOI":"10.1093\/nar\/gkx1313"},{"key":"e_1_3_3_2_7_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-68382-4_12"},{"key":"e_1_3_3_2_8_2","doi-asserted-by":"crossref","unstructured":"Aydin Bulu\u00e7 and John\u00a0R Gilbert. 2012. Parallel sparse matrix-matrix multiplication and indexing: Implementation and experiments. SIAM Journal on Scientific Computing 34 4 (2012) C170\u2013C191.","DOI":"10.1137\/110848244"},{"key":"e_1_3_3_2_9_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-96881-0_12"},{"key":"e_1_3_3_2_10_2","doi-asserted-by":"crossref","unstructured":"Jianhua Gao Weixing Ji Fangli Chang Shiyu Han Bingxin Wei Zeming Liu and Yizhuo Wang. 2023. A systematic survey of general sparse matrix-matrix multiplication. Comput. Surveys 55 12 (2023) 1\u201336.","DOI":"10.1145\/3571157"},{"key":"e_1_3_3_2_11_2","doi-asserted-by":"publisher","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 80 18 (Aug. 2024) 26394\u201326434. 10.1007\/s11227-024-06428-8","DOI":"10.1007\/s11227-024-06428-8"},{"key":"e_1_3_3_2_12_2","doi-asserted-by":"crossref","unstructured":"Robin Geelen and Frederik Vercauteren. 2023. Bootstrapping for BGV and BFV Revisited. Journal of Cryptology 36 2 (2023) 12.","DOI":"10.1007\/s00145-023-09454-6"},{"key":"e_1_3_3_2_13_2","doi-asserted-by":"crossref","unstructured":"John\u00a0R Gilbert Cleve Moler and Robert Schreiber. 1992. Sparse matrices in MATLAB: Design and implementation. SIAM journal on matrix analysis and applications 13 1 (1992) 333\u2013356.","DOI":"10.1137\/0613024"},{"key":"e_1_3_3_2_14_2","doi-asserted-by":"publisher","DOI":"10.1109\/HPEC43674.2020.9286191"},{"key":"e_1_3_3_2_15_2","doi-asserted-by":"crossref","unstructured":"Sigal Gottlieb Jae-Hun Jung and Saeja Kim. 2011. A review of David Gottlieb\u2019s work on the resolution of the Gibbs phenomenon. Communications in Computational Physics 9 3 (2011) 497\u2013519.","DOI":"10.4208\/cicp.301109.170510s"},{"key":"e_1_3_3_2_16_2","doi-asserted-by":"crossref","unstructured":"Fred\u00a0G Gustavson. 1978. Two fast algorithms for sparse matrices: Multiplication and permuted transposition. ACM Transactions on Mathematical Software (TOMS) 4 3 (1978) 250\u2013269.","DOI":"10.1145\/355791.355796"},{"key":"e_1_3_3_2_17_2","unstructured":"Carmit Hazay and Yehuda Lindell. 2010. A note on the relation between the definitions of security for semi-honest and malicious adversaries. Cryptology ePrint Archive (2010)."},{"key":"e_1_3_3_2_18_2","unstructured":"Torsten Hoefler Dan Alistarh Tal Ben-Nun Nikoli Dryden and Alexandra Peste. 2021. Sparsity in deep learning: Pruning and growth for efficient inference and training in neural networks. Journal of Machine Learning Research 22 241 (2021) 1\u2013124."},{"key":"e_1_3_3_2_19_2","doi-asserted-by":"crossref","unstructured":"Seungwan Hong Seunghong Kim Jiheon Choi Younho Lee and Jung\u00a0Hee Cheon. 2021. Efficient sorting of homomorphic encrypted data with k-way sorting network. IEEE Transactions on Information Forensics and Security 16 (2021) 4389\u20134404.","DOI":"10.1109\/TIFS.2021.3106167"},{"key":"e_1_3_3_2_20_2","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2012.43"},{"key":"e_1_3_3_2_21_2","doi-asserted-by":"publisher","DOI":"10.1145\/3474366.3486923"},{"key":"e_1_3_3_2_22_2","doi-asserted-by":"crossref","unstructured":"Nouhaila Idrissi and Ahmed Zellou. 2020. A systematic literature review of sparsity issues in recommender systems. Social Network Analysis and Mining 10 1 (2020) 15.","DOI":"10.1007\/s13278-020-0626-2"},{"key":"e_1_3_3_2_23_2","doi-asserted-by":"crossref","unstructured":"Ilia Iliashenko and Vincent Zucca. 2021. Faster homomorphic comparison operations for BGV and BFV. Proceedings on Privacy Enhancing Technologies 2021 3 (2021) 246\u2013264.","DOI":"10.2478\/popets-2021-0046"},{"key":"e_1_3_3_2_24_2","doi-asserted-by":"publisher","DOI":"10.1109\/MCHPC49590.2019.00012"},{"key":"e_1_3_3_2_25_2","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2014.47"},{"key":"e_1_3_3_2_26_2","doi-asserted-by":"publisher","DOI":"10.1145\/2464996.2465013"},{"key":"e_1_3_3_2_27_2","doi-asserted-by":"crossref","unstructured":"Yajing Liu Ruiqi Chen Shuyang Li Jing Yang Shun Li and Bruno da Silva. 2024. FPGA-based sparse matrix multiplication accelerators: From state-of-the-art to future opportunities. ACM Transactions on Reconfigurable Technology and Systems 17 4 (2024) 1\u201337.","DOI":"10.1145\/3687480"},{"key":"e_1_3_3_2_28_2","doi-asserted-by":"publisher","DOI":"10.1109\/SP40001.2021.00043"},{"key":"e_1_3_3_2_29_2","doi-asserted-by":"crossref","unstructured":"Xin Luo Mengchu Zhou Shuai Li Yunni Xia Zhuhong You Qingsheng Zhu and Hareton Leung. 2015. An efficient second-order approach to factorize sparse matrices in recommender systems. IEEE transactions on industrial informatics 11 4 (2015) 946\u2013956.","DOI":"10.1109\/TII.2015.2443723"},{"key":"e_1_3_3_2_30_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-13190-5_1"},{"key":"e_1_3_3_2_31_2","doi-asserted-by":"publisher","DOI":"10.1109\/HiPC.2012.6507483"},{"key":"e_1_3_3_2_32_2","first-page":"8541","volume-title":"34th USENIX Security Symposium (USENIX Security 25)","author":"Mazzone Federico","year":"2025","unstructured":"Federico Mazzone, Maarten Everts, Florian Hahn, and Andreas Peter. 2025. Efficient Ranking, Order Statistics, and Sorting under { CKKS}. In 34th USENIX Security Symposium (USENIX Security 25). 8541\u20138558."},{"key":"e_1_3_3_2_33_2","doi-asserted-by":"publisher","DOI":"10.1109\/HPCA.2018.00067"},{"key":"e_1_3_3_2_34_2","doi-asserted-by":"crossref","unstructured":"Michael\u00a0S Paterson and Larry\u00a0J Stockmeyer. 1973. On the number of nonscalar multiplications necessary to evaluate polynomials. SIAM J. Comput. 2 1 (1973) 60\u201366.","DOI":"10.1137\/0202007"},{"key":"e_1_3_3_2_35_2","doi-asserted-by":"publisher","DOI":"10.1109\/HPCA47549.2020.00015"},{"key":"e_1_3_3_2_36_2","unstructured":"Lorenzo Rovida Alberto Leporati and Simone Basile. 2025. Lightweight Sorting in Approximate Homomorphic Encryption. Cryptology ePrint Archive Paper 2025\/1150. https:\/\/eprint.iacr.org\/2025\/1150"},{"key":"e_1_3_3_2_37_2","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611975949"},{"key":"e_1_3_3_2_38_2","first-page":"5152","volume-title":"International Conference on Machine Learning","author":"Wang Sinong","year":"2018","unstructured":"Sinong Wang, Jiashang Liu, and Ness Shroff. 2018. Coded sparse matrix multiplication. In International Conference on Machine Learning. PMLR, 5152\u20135160."},{"key":"e_1_3_3_2_39_2","doi-asserted-by":"publisher","DOI":"10.1145\/3721145.3725773"},{"key":"e_1_3_3_2_40_2","doi-asserted-by":"crossref","unstructured":"Di Wu Xin Luo Mingsheng Shang Yi He Guoyin Wang and MengChu Zhou. 2019. A deep latent factor model for high-dimensional and sparse matrices in recommender systems. IEEE Transactions on Systems Man and Cybernetics: Systems 51 7 (2019) 4285\u20134296.","DOI":"10.1109\/TSMC.2019.2931393"},{"key":"e_1_3_3_2_41_2","doi-asserted-by":"crossref","unstructured":"Lingling Wu Xu\u00a0An Wang Jiasen Liu Yunxuan Su Zheng Tu Wenhao Liu Haibo Lei Dianhua Tang Yunfei Cao and Jianping Zhang. 2025. Homomorphic Encryption for Machine Learning Applications with CKKS Algorithms: A Survey of Developments and Applications. Computers Materials & Continua 85 1 (2025) 89.","DOI":"10.32604\/cmc.2025.064346"},{"key":"e_1_3_3_2_42_2","doi-asserted-by":"crossref","unstructured":"Yatao Yang Zhaofu Li Yucheng Ding and Man Hu. 2025. MAT-FHE: arbitrary dimension matrix multiplication scheme for floating point over fully homomorphic encryption. Cybersecurity 8 1 (2025) 48.","DOI":"10.1186\/s42400-024-00303-y"},{"key":"e_1_3_3_2_43_2","doi-asserted-by":"publisher","DOI":"10.1145\/3719027.3765025"},{"key":"e_1_3_3_2_44_2","doi-asserted-by":"crossref","unstructured":"Raphael Yuster and Uri Zwick. 2005. Fast sparse matrix multiplication. ACM Transactions On Algorithms (TALG) 1 1 (2005) 2\u201313.","DOI":"10.1145\/1077464.1077466"}],"event":{"name":"ICS '26: 2026 International Conference on Supercomputing","location":"Belfast United Kingdom","acronym":"ICS '26","sponsor":["SIGHPC ACM Special Interest Group on High Performance Computing, Special Interest Group on High Performance Computing","SIGARCH ACM Special Interest Group on Computer Architecture"]},"container-title":["Proceedings of the 40th ACM International Conference on Supercomputing"],"original-title":[],"deposited":{"date-parts":[[2026,7,2]],"date-time":"2026-07-02T12:51:06Z","timestamp":1782996666000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3797905.3807876"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,7,5]]},"references-count":43,"alternative-id":["10.1145\/3797905.3807876","10.1145\/3797905"],"URL":"https:\/\/doi.org\/10.1145\/3797905.3807876","relation":{},"subject":[],"published":{"date-parts":[[2026,7,5]]},"assertion":[{"value":"2026-07-05","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}