{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,17]],"date-time":"2026-06-17T11:57:20Z","timestamp":1781697440228,"version":"3.54.5"},"reference-count":31,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"funder":[{"DOI":"10.13039\/501100008871","name":"Yunnan Provincial Science and Technology Department","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100008871","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Neurocomputing"],"published-print":{"date-parts":[[2026,8]]},"DOI":"10.1016\/j.neucom.2026.133799","type":"journal-article","created":{"date-parts":[[2026,4,30]],"date-time":"2026-04-30T15:31:49Z","timestamp":1777563109000},"page":"133799","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["Efficient rotation-friendly framework for arbitrary-dimension homomorphic matrix multiplication in neural network"],"prefix":"10.1016","volume":"689","author":[{"ORCID":"https:\/\/orcid.org\/0009-0004-3142-6247","authenticated-orcid":false,"given":"Chenglong","family":"Li","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Zixiang","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Meiyi","family":"Guo","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5646-618X","authenticated-orcid":false,"given":"Yunting","family":"Tao","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1369-6855","authenticated-orcid":false,"given":"Fanyu","family":"Kong","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2296-8410","authenticated-orcid":false,"given":"Fengyu","family":"Wang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yuliang","family":"Shi","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Xidan","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/j.neucom.2026.133799_bib0005","series-title":"Efficient Bootstrapping for Approximate Homomorphic Encryption with Non-Sparse Keys","first-page":"587","author":"Bossuat","year":"2021"},{"key":"10.1016\/j.neucom.2026.133799_bib0010","doi-asserted-by":"crossref","first-page":"1390","DOI":"10.1109\/TIFS.2024.3490862","article-title":"Homomorphic matrix operations under bicyclic encoding","volume":"20","author":"Chen","year":"2024","journal-title":"IEEE Trans. Inf. Forensics Secur."},{"key":"10.1016\/j.neucom.2026.133799_bib0015","doi-asserted-by":"crossref","first-page":"645","DOI":"10.1109\/TPDS.2025.3534846","article-title":"Fhe4dmm: a low-latency distributed matrix multiplication with fully homomorphic encryption","volume":"36","author":"Chen","year":"2025","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"key":"10.1016\/j.neucom.2026.133799_bib0020","series-title":"A Full RNS Variant of Approximate Homomorphic Encryption","first-page":"347","author":"Cheon","year":"2019"},{"key":"10.1016\/j.neucom.2026.133799_bib0025","series-title":"Homomorphic Encryption for Arithmetic of Approximate Numbers","first-page":"409","author":"Cheon","year":"2017"},{"key":"10.1016\/j.neucom.2026.133799_bib0030","first-page":"69","article-title":"Efficient secure matrix multiplication over lwe-based homomorphic encryption","volume":"67","author":"Duong","year":"2016","journal-title":"Tatra Mt. Math. Publ."},{"key":"10.1016\/j.neucom.2026.133799_bib0040","doi-asserted-by":"crossref","first-page":"26394","DOI":"10.1007\/s11227-024-06428-8","article-title":"Secure and efficient general matrix multiplication on cloud using homomorphic encryption","volume":"80","author":"Gao","year":"2024","journal-title":"The Journal of Supercomputing"},{"key":"10.1016\/j.neucom.2026.133799_bib0045","series-title":"Fully homomorphic encryption for matrix arithmetic","author":"Gentry","year":"2025"},{"key":"10.1016\/j.neucom.2026.133799_bib0050","series-title":"Algorithms in HElib","first-page":"554","author":"Halevi","year":"2014"},{"key":"10.1016\/j.neucom.2026.133799_bib0055","series-title":"Faster Homomorphic Linear Transformations in HElib","first-page":"93","author":"Halevi","year":"2018"},{"key":"10.1016\/j.neucom.2026.133799_bib0060","series-title":"Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition","first-page":"770","article-title":"Deep residual learning for image recognition","author":"He","year":"2016"},{"key":"10.1016\/j.neucom.2026.133799_bib0065","doi-asserted-by":"crossref","first-page":"5064","DOI":"10.1007\/s11227-022-04850-4","article-title":"Secure matrix multiplication based on fully homomorphic encryption","volume":"79","author":"Huang","year":"2022","journal-title":"The Journal of Supercomputing"},{"key":"10.1016\/j.neucom.2026.133799_bib0070","doi-asserted-by":"crossref","first-page":"551","DOI":"10.1109\/TDSC.2021.3139318","article-title":"More efficient secure matrix multiplication for unbalanced recommender systems","volume":"20","author":"Huang","year":"2021","journal-title":"IEEE Trans. Dependable Secure Comput."},{"key":"10.1016\/j.neucom.2026.133799_bib0075","series-title":"Proceedings of the 2022 ACM on Asia Conference on Computer and Communications Security","first-page":"377","article-title":"Privacy-preserving deep sequential model with matrix homomorphic encryption","author":"Jang","year":"2022"},{"key":"10.1016\/j.neucom.2026.133799_bib0080","series-title":"Proceedings of the 2018 ACM SIGSAC Conference on Computer and Communications Security","first-page":"1209","article-title":"Secure outsourced matrix computation and application to neural networks","author":"Jiang","year":"2018"},{"key":"10.1016\/j.neucom.2026.133799_bib0085","doi-asserted-by":"crossref","DOI":"10.1016\/j.cose.2023.103658","article-title":"Improved privacy-preserving PCA using optimized homomorphic matrix multiplication","volume":"138","author":"Ma","year":"2024","journal-title":"Comput. Secur."},{"key":"10.1016\/j.neucom.2026.133799_bib0090","series-title":"Enhancement for Secure Multiple Matrix Multiplications over Ring-LWE Homomorphic Encryption","first-page":"320","author":"Mishra","year":"2017"},{"key":"10.1016\/j.neucom.2026.133799_bib0095","series-title":"2024 IEEE Symposium on Security and Privacy (SP)","first-page":"4753","article-title":"Bolt: privacy-preserving, accurate and efficient inference for transformers","author":"Pang","year":"2024"},{"key":"10.1016\/j.neucom.2026.133799_bib0100","series-title":"Annual International Conference on the Theory and Applications of Cryptographic Techniques","first-page":"153","article-title":"Ciphertext-ciphertext matrix multiplication: fast for large matrices","author":"Park","year":"2025"},{"key":"10.1016\/j.neucom.2026.133799_bib0105","series-title":"Proceedings of the 2018 Workshop on Privacy in the Electronic Society","first-page":"42","article-title":"Faster PCA and linear regression through hypercubes in helib","author":"Rathee","year":"2018"},{"key":"10.1016\/j.neucom.2026.133799_bib0110","series-title":"Proceedings of the 2022 on Cloud Computing Security Workshop","first-page":"53","article-title":"On matrix multiplication with homomorphic encryption","author":"Rizomiliotis","year":"2022"},{"key":"10.1016\/j.neucom.2026.133799_bib0115","doi-asserted-by":"crossref","first-page":"2729","DOI":"10.1109\/COMST.2024.3377531","article-title":"Empowering cloud computing with network acceleration: a survey","volume":"26","author":"Rosa","year":"2024","journal-title":"IEEE Commun. Surv. Tutor."},{"key":"10.1016\/j.neucom.2026.133799_bib0120","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/3712016","article-title":"Artificial intelligence as a service (aiaas) for cloud, fog and the edge: state-of-the-art practices","volume":"57","author":"Syed","year":"2025","journal-title":"ACM Comput. Surv."},{"key":"10.1016\/j.neucom.2026.133799_bib0125","article-title":"Attention is all you need","volume":"30","author":"Vaswani","year":"2017","journal-title":"Adv. Neural Inf. Process. Syst."},{"key":"10.1016\/j.neucom.2026.133799_bib0130","series-title":"2025 IEEE 24th International Conference on Trust, Security and Privacy in Computing and Communications (TrustCom)","first-page":"1586","article-title":"An efficient fhe-based ciphertext matrix multiplication algorithm","author":"Wang","year":"2025"},{"key":"10.1016\/j.neucom.2026.133799_bib0135","article-title":"Using homomorphic encryption for large scale statistical analysis","volume":"vol. 3","author":"Wu","year":"2012"},{"key":"10.1016\/j.neucom.2026.133799_bib0140","series-title":"2025 IEEE 24th International Conference on Trust, Security and Privacy in Computing and Communications (TrustCom)","first-page":"1742","article-title":"Optimizing fhe-based secure matrix computation for untrusted cloud environments","author":"Xie","year":"2025"},{"key":"10.1016\/j.neucom.2026.133799_bib0145","first-page":"111802","article-title":"Privcirnet: efficient private inference via block circulant transformation","volume":"37","author":"Xu","year":"2024","journal-title":"Adv. Neural Inf. Process. Syst."},{"key":"10.1016\/j.neucom.2026.133799_bib0150","doi-asserted-by":"crossref","DOI":"10.1016\/j.neucom.2025.130862","article-title":"Homomorphic activation and argmax via bootstrapping and applications in privacy-preserving neural networks","volume":"651","author":"Zhang","year":"2025","journal-title":"Neurocomputing"},{"key":"10.1016\/j.neucom.2026.133799_bib0155","doi-asserted-by":"crossref","first-page":"2671","DOI":"10.1007\/s10623-025-01614-y","article-title":"A new framework for fast homomorphic matrix multiplication: x. Zheng ET al","volume":"93","author":"Zheng","year":"2025","journal-title":"Des. Codes Cryptogr."},{"key":"10.1016\/j.neucom.2026.133799_bib0160","series-title":"European Symposium on Research in Computer Security","first-page":"249","article-title":"Secure outsourced matrix multiplication with fully homomorphic encryption","author":"Zhu","year":"2023"}],"container-title":["Neurocomputing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0925231226011963?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0925231226011963?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,6,17]],"date-time":"2026-06-17T11:32:45Z","timestamp":1781695965000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0925231226011963"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,8]]},"references-count":31,"alternative-id":["S0925231226011963"],"URL":"https:\/\/doi.org\/10.1016\/j.neucom.2026.133799","relation":{},"ISSN":["0925-2312"],"issn-type":[{"value":"0925-2312","type":"print"}],"subject":[],"published":{"date-parts":[[2026,8]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Efficient rotation-friendly framework for arbitrary-dimension homomorphic matrix multiplication in neural network","name":"articletitle","label":"Article Title"},{"value":"Neurocomputing","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.neucom.2026.133799","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 Elsevier B.V. All rights are reserved, including those for text and data mining, AI training, and similar technologies.","name":"copyright","label":"Copyright"}],"article-number":"133799"}}