{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,2]],"date-time":"2025-08-02T16:50:11Z","timestamp":1754153411525,"version":"3.41.2"},"reference-count":31,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2025,7,23]],"date-time":"2025-07-23T00:00:00Z","timestamp":1753228800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2025,7,23]],"date-time":"2025-07-23T00:00:00Z","timestamp":1753228800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"name":"the Beijing Natural Science Foundation","award":["4232034"],"award-info":[{"award-number":["4232034"]}]},{"DOI":"10.13039\/501100012226","name":"Fundamental Research Funds for the Central Universities","doi-asserted-by":"publisher","award":["328202225"],"award-info":[{"award-number":["328202225"]}],"id":[{"id":"10.13039\/501100012226","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Cybersecurity"],"abstract":"<jats:title>Abstract<\/jats:title>\n          <jats:p>Matrix operation is one of the most basic and practical operations in statistical analysis and machine learning. The secure matrix operation over homomorphic encryption technology can protect the confidentiality of input data. However, it has not come up with an optimal solution for modern machine learning frameworks, partially due to a lack of efficient matrix computation mechanisms. In this paper, a universal secure matrix multiplication scheme MAT-FHE for any dimension matrix over fully homomorphic encryption technology is designed to realize non-square matrix multiplication, such as <jats:inline-formula>\n              <jats:alternatives>\n                <jats:tex-math>$$A_{m\\times l}\\times B_{l\\times n}$$<\/jats:tex-math>\n                <mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                  <mml:mrow>\n                    <mml:msub>\n                      <mml:mi>A<\/mml:mi>\n                      <mml:mrow>\n                        <mml:mi>m<\/mml:mi>\n                        <mml:mo>\u00d7<\/mml:mo>\n                        <mml:mi>l<\/mml:mi>\n                      <\/mml:mrow>\n                    <\/mml:msub>\n                    <mml:mo>\u00d7<\/mml:mo>\n                    <mml:msub>\n                      <mml:mi>B<\/mml:mi>\n                      <mml:mrow>\n                        <mml:mi>l<\/mml:mi>\n                        <mml:mo>\u00d7<\/mml:mo>\n                        <mml:mi>n<\/mml:mi>\n                      <\/mml:mrow>\n                    <\/mml:msub>\n                  <\/mml:mrow>\n                <\/mml:math>\n              <\/jats:alternatives>\n            <\/jats:inline-formula>. The matrix is filled into a hypercube structure and encrypted into a single ciphertext. The number of ciphertext multiplications with the highest computational overhead is reduced through operations such as rotating by rows and columns, ciphertext addition, and multiplication of ciphertext and plaintext. After analysis, it is secure under the CPA model, composable, and supports floating matrix continuous multiplication. The CKKS algorithm of the Microsoft SEAL library is used to implement the matrix multiplication of floating point numbers in any dimension. Shared the computing overhead with SIMD technology and improved the implementation speed. In this paper, the operation time of 16-dimensional matrix multiplication is 4.2253s, which is about 1.5 times faster than the existing best square matrix multiplication scheme. The experimental results show that this method is superior to the existing secure matrix multiplication scheme and can be applied to various secure computing outsourcing and machine learning scenarios.<\/jats:p>","DOI":"10.1186\/s42400-024-00303-y","type":"journal-article","created":{"date-parts":[[2025,7,23]],"date-time":"2025-07-23T01:02:58Z","timestamp":1753232578000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["MAT-FHE: arbitrary dimension matrix multiplication scheme for floating point over fully homomorphic encryption"],"prefix":"10.1186","volume":"8","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-0174-0997","authenticated-orcid":false,"given":"Yatao","family":"Yang","sequence":"first","affiliation":[]},{"given":"Zhaofu","family":"Li","sequence":"additional","affiliation":[]},{"given":"Yucheng","family":"Ding","sequence":"additional","affiliation":[]},{"given":"Man","family":"Hu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,7,23]]},"reference":[{"issue":"4","key":"303_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3214303","volume":"51","author":"A Acar","year":"2018","unstructured":"Acar A, Aksu H, Uluagac AS et al (2018) A survey on homomorphic encryption schemes: theory and implementation. ACM Comput Surv (Csur) 51(4):1\u201335","journal-title":"ACM Comput Surv (Csur)"},{"key":"303_CR2","doi-asserted-by":"publisher","first-page":"240","DOI":"10.1109\/PST.2008.12","volume-title":"2008 sixth annual conference on privacy","author":"D Benjamin","year":"2008","unstructured":"Benjamin D, Atallah MJ (2008) Private and cheating-free outsourcing of algebraic computations. 2008 sixth annual conference on privacy. Security and Trust, IEEE, pp 240\u2013245"},{"key":"303_CR3","doi-asserted-by":"crossref","unstructured":"Boemer F, Cammarota R, Demmler D, et\u00a0al (2020) Mp2ml: A mixed-protocol machine learning framework for private inference. In: Proceedings of the 15th international conference on availability, reliability and security, pp 1\u201310","DOI":"10.1145\/3407023.3407045"},{"key":"303_CR4","doi-asserted-by":"crossref","unstructured":"Brakerski Z, Vaikuntanathan V (2011) Fully homomorphic encryption from ring-lwe and security for key dependent messages. In: Annual cryptology conference, Springer, pp 505\u2013524","DOI":"10.1007\/978-3-642-22792-9_29"},{"issue":"2","key":"303_CR5","doi-asserted-by":"publisher","first-page":"831","DOI":"10.1137\/120868669","volume":"43","author":"Z Brakerski","year":"2014","unstructured":"Brakerski Z, Vaikuntanathan V (2014) Efficient fully homomorphic encryption from (standard) lwe. SIAM J Comput 43(2):831\u2013871","journal-title":"SIAM J Comput"},{"key":"303_CR6","first-page":"58","volume-title":"2019 international conference on computing","author":"P Chaudhary","year":"2019","unstructured":"Chaudhary P, Gupta R, Singh A et al (2019) Analysis and comparison of various fully homomorphic encryption techniques. 2019 international conference on computing. Power and Communication Technologies (GUCON), IEEE, pp 58\u201362"},{"key":"303_CR7","doi-asserted-by":"crossref","unstructured":"Cheon JH, Kim A, Kim M, et\u00a0al (2017) Homomorphic encryption for arithmetic of approximate numbers. In: Advances in Cryptology\u2013ASIACRYPT 2017: 23rd international conference on the theory and applications of cryptology and information security, Hong Kong, China, December 3-7, 2017, Proceedings, Part I 23, Springer, pp 409\u2013437","DOI":"10.1007\/978-3-319-70694-8_15"},{"key":"303_CR8","doi-asserted-by":"crossref","unstructured":"Cheon JH, Han K, Kim A, et\u00a0al (2018a) Bootstrapping for approximate homomorphic encryption. In: Advances in Cryptology\u2013EUROCRYPT 2018: 37th annual international conference on the theory and applications of cryptographic techniques, Tel Aviv, Israel, April 29-May 3, 2018 Proceedings, Part I 37, Springer, pp 360\u2013384","DOI":"10.1007\/978-3-319-78381-9_14"},{"key":"303_CR9","unstructured":"Cheon JH, Kim A, Yhee D (2018b) Multi-dimensional packing for heaan for approximate matrix arithmetics. Cryptology ePrint Archive"},{"issue":"1","key":"303_CR10","first-page":"69","volume":"67","author":"DH Duong","year":"2016","unstructured":"Duong DH, Mishra PK, Yasuda M (2016) Efficient secure matrix multiplication over lwe-based homomorphic encryption. Tatra Mount Math Publ 67(1):69\u201383","journal-title":"Tatra Mount Math Publ"},{"issue":"7930","key":"303_CR11","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1038\/s41586-022-05172-4","volume":"610","author":"A Fawzi","year":"2022","unstructured":"Fawzi A, Balog M, Huang A et al (2022) Discovering faster matrix multiplication algorithms with reinforcement learning. Nature 610(7930):47\u201353","journal-title":"Nature"},{"key":"303_CR12","unstructured":"Gentry C (2009) A fully homomorphic encryption scheme. Stanford university"},{"issue":"1","key":"303_CR13","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1587\/transfun.E99.A.73","volume":"99","author":"R Hiromasa","year":"2016","unstructured":"Hiromasa R, Abe M, Okamoto T (2016) Packing messages and optimizing bootstrapping in gsw-fhe. IEICE Trans Fundam Electron Commun Comput Sci 99(1):73\u201382","journal-title":"IEICE Trans Fundam Electron Commun Comput Sci"},{"issue":"5","key":"303_CR14","doi-asserted-by":"publisher","first-page":"5064","DOI":"10.1007\/s11227-022-04850-4","volume":"79","author":"H Huang","year":"2023","unstructured":"Huang H, Zong H (2023) Secure matrix multiplication based on fully homomorphic encryption. J Supercomput 79(5):5064\u20135085","journal-title":"J Supercomput"},{"key":"303_CR15","doi-asserted-by":"crossref","unstructured":"Jiang X, Kim M, Lauter K, et\u00a0al (2018) Secure outsourced matrix computation and application to neural networks. In: proceedings of the 2018 ACM SIGSAC conference on computer and communications security, pp 1209\u20131222","DOI":"10.1145\/3243734.3243837"},{"key":"303_CR16","doi-asserted-by":"crossref","unstructured":"Kitagawa F, Matsuda T, Tanaka K (2019) Simple and efficient kdm-cca secure public key encryption. In: Advances in Cryptology\u2013ASIACRYPT 2019: 25th international conference on the theory and application of cryptology and information security, Kobe, Japan, December 8\u201312, 2019, Proceedings, Part III 25, Springer, pp 97\u2013127","DOI":"10.1007\/978-3-030-34618-8_4"},{"key":"303_CR17","doi-asserted-by":"crossref","unstructured":"Li B, Micciancio D (2021) On the security of homomorphic encryption on approximate numbers. In: Advances in Cryptology\u2013EUROCRYPT 2021: 40th annual international conference on the theory and applications of cryptographic techniques, Zagreb, Croatia, October 17\u201321, 2021, Proceedings, Part I 40, Springer, pp 648\u2013677","DOI":"10.1007\/978-3-030-77870-5_23"},{"key":"303_CR18","doi-asserted-by":"crossref","unstructured":"Li B, Micciancio D, Schultz M, et\u00a0al (2022) Securing approximate homomorphic encryption using differential privacy. In: annual international cryptology conference, Springer, pp 560\u2013589","DOI":"10.1007\/978-3-031-15802-5_20"},{"issue":"6","key":"303_CR19","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2535925","volume":"60","author":"V Lyubashevsky","year":"2013","unstructured":"Lyubashevsky V, Peikert C, Regev O (2013) On ideal lattices and learning with errors over rings. Journal of the ACM (JACM) 60(6):1\u201335","journal-title":"Journal of the ACM (JACM)"},{"issue":"4","key":"303_CR20","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1080\/19393555.2020.1836288","volume":"30","author":"PK Mishra","year":"2021","unstructured":"Mishra PK, Rathee D, Duong DH et al (2021) Fast secure matrix multiplications over ring-based homomorphic encryption. Inform Sec J A Global Perspect 30(4):219\u2013234","journal-title":"Inform Sec J A Global Perspect"},{"key":"303_CR21","doi-asserted-by":"crossref","unstructured":"Rathee D, Mishra PK, Yasuda M (2018) Faster pca and linear regression through hypercubes in helib. In: proceedings of the 2018 workshop on privacy in the electronic society, pp 42\u201353","DOI":"10.1145\/3267323.3268952"},{"issue":"11","key":"303_CR22","first-page":"169","volume":"4","author":"RL Rivest","year":"1978","unstructured":"Rivest RL, Adleman L, Dertouzos ML et al (1978) On data banks and privacy homomorphisms. Found Secure Computat 4(11):169\u2013180","journal-title":"Found Secure Computat"},{"key":"303_CR23","doi-asserted-by":"crossref","unstructured":"Rizomiliotis P, Triakosia A (2022) On matrix multiplication with homomorphic encryption. In: proceedings of the 2022 on cloud computing security workshop, pp 53\u201361","DOI":"10.1145\/3560810.3564267"},{"key":"303_CR24","doi-asserted-by":"publisher","first-page":"1407","DOI":"10.1109\/TIFS.2023.3238544","volume":"18","author":"T Schneider","year":"2023","unstructured":"Schneider T, Suresh A, Yalame H (2023) Comments on \u201cprivacy-enhanced federated learning against poisoning adversaries.\u201d IEEE Trans Inform Forens Sec 18:1407\u20131409","journal-title":"IEEE Trans Inform Forens Sec"},{"key":"303_CR25","unstructured":"SEAL (2023) Microsoft SEAL (release 4.1). https:\/\/github.com\/Microsoft\/SEAL, microsoft Research, Redmond, WA"},{"key":"303_CR26","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1007\/s10623-012-9720-4","volume":"71","author":"NP Smart","year":"2014","unstructured":"Smart NP, Vercauteren F (2014) Fully homomorphic simd operations. Des Codes Cryptogr 71:57\u201381","journal-title":"Des Codes Cryptogr"},{"issue":"11","key":"303_CR27","first-page":"5616","volume":"13","author":"S Wang","year":"2019","unstructured":"Wang S, Huang H (2019) Secure outsourced computation of multiple matrix multiplication based on fully homomorphic encryption. KSII Trans Int Inform Syst (TIIS) 13(11):5616\u20135630","journal-title":"KSII Trans Int Inform Syst (TIIS)"},{"key":"303_CR28","doi-asserted-by":"publisher","first-page":"1348","DOI":"10.1007\/s12083-021-01110-9","volume":"14","author":"K Xue","year":"2021","unstructured":"Xue K, Liu Z, Zhu H et al (2021) Advances in privacy-preserving computing. Peer-to-Peer Netw Appl 14:1348\u20131352","journal-title":"Peer-to-Peer Netw Appl"},{"issue":"4","key":"303_CR29","first-page":"711","volume":"43","author":"Y Yang","year":"2020","unstructured":"Yang Y, Zhao Y, Zhang Q et al (2020) Weighted electronic voting system with homomorphic encryption based on seal. Chinese J Comput 43(4):711\u2013723","journal-title":"Chinese J Comput"},{"issue":"2","key":"303_CR30","first-page":"475","volume":"43","author":"Y Yang","year":"2021","unstructured":"Yang Y, Zhao Y, Zhang J et al (2021) Recent development of theory and application on homomorphic encryption. J Elect Inform Technol 43(2):475\u2013487","journal-title":"J Elect Inform Technol"},{"issue":"4","key":"303_CR31","doi-asserted-by":"publisher","first-page":"3737","DOI":"10.1007\/s11277-021-09311-4","volume":"123","author":"Y Yang","year":"2022","unstructured":"Yang Y, Zhang Q, Gao W et al (2022) Design on face recognition system with privacy preservation based on homomorphic encryption. Wirel Pers Commun 123(4):3737\u20133754","journal-title":"Wirel Pers Commun"}],"container-title":["Cybersecurity"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1186\/s42400-024-00303-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1186\/s42400-024-00303-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1186\/s42400-024-00303-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,23]],"date-time":"2025-07-23T01:03:09Z","timestamp":1753232589000},"score":1,"resource":{"primary":{"URL":"https:\/\/cybersecurity.springeropen.com\/articles\/10.1186\/s42400-024-00303-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,7,23]]},"references-count":31,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2025,12]]}},"alternative-id":["303"],"URL":"https:\/\/doi.org\/10.1186\/s42400-024-00303-y","relation":{},"ISSN":["2523-3246"],"issn-type":[{"type":"electronic","value":"2523-3246"}],"subject":[],"published":{"date-parts":[[2025,7,23]]},"assertion":[{"value":"1 March 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"25 June 2024","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 July 2025","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that they have no competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interest"}}],"article-number":"48"}}