{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,7]],"date-time":"2025-11-07T17:48:12Z","timestamp":1762537692043,"version":"build-2065373602"},"reference-count":30,"publisher":"Springer Science and Business Media LLC","issue":"16","license":[{"start":{"date-parts":[[2025,11,7]],"date-time":"2025-11-07T00:00:00Z","timestamp":1762473600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,11,7]],"date-time":"2025-11-07T00:00:00Z","timestamp":1762473600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"name":"Jiangsu Province 100 Foreign Experts Introduction Plan","award":["BX2022012"],"award-info":[{"award-number":["BX2022012"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Supercomput"],"DOI":"10.1007\/s11227-025-08032-w","type":"journal-article","created":{"date-parts":[[2025,11,7]],"date-time":"2025-11-07T17:43:13Z","timestamp":1762537393000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["New algorithms for fully homomorphic matrix addition and multiplication"],"prefix":"10.1007","volume":"81","author":[{"given":"Shang","family":"Ci","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yihan","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sen","family":"Hu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Donghai","family":"Guan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"\u00c7etin Kaya","family":"Ko\u00e7","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,11,7]]},"reference":[{"key":"8032_CR1","unstructured":"Atallah MJ, Pantazopoulos KN, Rice JR, Spafford EH (1999) Secure outsourcing of scientific computations. Preprint"},{"key":"8032_CR2","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1016\/S0065-2458(01)80019-X","volume":"54","author":"MJ Atallah","year":"2002","unstructured":"Atallah MJ, Pantazopoulos KN, Rice JR, Spafford EH (2002) Secure outsourcing of scientific computations. Adv Comput 54:215\u2013272","journal-title":"Adv Comput"},{"key":"8032_CR3","doi-asserted-by":"publisher","first-page":"469","DOI":"10.1007\/s11227-012-0809-3","volume":"65","author":"YN Seitkulov","year":"2013","unstructured":"Seitkulov YN (2013) New methods of secure outsourcing of scientific computations. J Supercomput 65:469\u2013482","journal-title":"J Supercomput"},{"key":"8032_CR4","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-87629-6","volume-title":"Partially homomorphic encryption","author":"\u00c7K Ko\u00e7","year":"2021","unstructured":"Ko\u00e7 \u00c7K, \u00d6zdemir F, \u00d6zger Z\u00d6 (2021) Partially homomorphic encryption. Springer, Switzerland"},{"key":"8032_CR5","doi-asserted-by":"crossref","unstructured":"Gentry C (2009) A fully homomorphic encryption scheme. PhD thesis, Stanford University","DOI":"10.1145\/1536414.1536440"},{"key":"8032_CR6","doi-asserted-by":"publisher","DOI":"10.1016\/J.COSE.2024.104272","volume":"150","author":"Y Baseri","year":"2025","unstructured":"Baseri Y, Chouhan V, Ghorbani AA, Chow A (2025) Evaluation framework for quantum security risk assessment: a comprehensive strategy for quantum-safe transition. Comput Secur 150:104272. https:\/\/doi.org\/10.1016\/J.COSE.2024.104272","journal-title":"Comput Secur"},{"key":"8032_CR7","doi-asserted-by":"crossref","unstructured":"Smart NP, Vercauteren F (2010) Fully homomorphic encryption with relatively small key and ciphertext sizes. In: Public-Key Cryptography\u2014PKC 2010, pp 420\u2013443","DOI":"10.1007\/978-3-642-13013-7_25"},{"key":"8032_CR8","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 Crypt 71:57\u201381","journal-title":"Des Codes Crypt"},{"key":"8032_CR9","doi-asserted-by":"crossref","unstructured":"Halevi S, Shoup V (2014) Algorithms in HElib. In: Garay JA, Gennaro R (eds) Advances in Cryptology\u2014CRYPTO 2014, pp 554\u2013571. Springer, LNCS Nr. 8616","DOI":"10.1007\/978-3-662-44371-2_31"},{"key":"8032_CR10","doi-asserted-by":"crossref","unstructured":"Gentry C, Halevi S (2011) Implementing Gentry\u2019s fully-homomorphic encryption scheme. In: Advances in Cryptology, Eurocrypt, pp 129\u2013148. Springer, LNCS Nr. 6632","DOI":"10.1007\/978-3-642-20465-4_9"},{"key":"8032_CR11","unstructured":"Halevi S, Shoup V (2013) Homomorphic Encryption library (HElib). https:\/\/en.wikipedia.org\/wiki\/HElib"},{"key":"8032_CR12","unstructured":"Sathya SS, Vepakomma P, Raskar R, Ramachandra R, Bhattacharya S (2018) A Review of Homomorphic Encryption Libraries for Secure Computation. arXiv:1812.02428"},{"key":"8032_CR13","unstructured":"Brakerski Z, Gentry C, Vaikuntanathan V (2011) Fully homomorphic encryption without bootstrapping. Cryptology ePrint Archive, Paper 2011\/277. https:\/\/eprint.iacr.org\/2011\/277"},{"key":"8032_CR14","doi-asserted-by":"crossref","unstructured":"Brakerski Z, Gentry C, Vaikuntanathan V (2012) (Leveled) fully homomorphic encryption without bootstrapping. In: Proceedings of the 3rd Innovations in Theoretical Computer Science Conference, pp 309\u2013325","DOI":"10.1145\/2090236.2090262"},{"key":"8032_CR15","doi-asserted-by":"crossref","unstructured":"Brakerski Z, Gentry C, Halevi S (2013) Packed ciphertexts in LWE-based homomorphic encryption. In: Public-Key Cryptography\u2014PKC 2013, pp 1\u201313","DOI":"10.1007\/978-3-642-36362-7_1"},{"key":"8032_CR16","doi-asserted-by":"crossref","unstructured":"Yasuda M, Shimoyama T, Kogure J, Yokoyama K, Koshiba T (2015) Secure statistical analysis using RLWE-based homomorphic encryption. In: ACISP 2015, pp 471\u2013487. Springer, LNCS Nr. 9144","DOI":"10.1007\/978-3-319-19962-7_27"},{"key":"8032_CR17","unstructured":"Lu W-J, Kawasaki S, Sakuma J (2016) Using fully homomorphic encryption for statistical analysis of categorical, ordinal and numerical data. Cryptology ePrint Archive, Paper 2016\/1163. https:\/\/eprint.iacr.org\/2016\/1163"},{"key":"8032_CR18","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"},{"key":"8032_CR19","doi-asserted-by":"crossref","unstructured":"Jiang X, Kim M, Lauter K, Song Y (2018) Secure outsourced matrix computation and application to neural networks. In: ACM SIGSAC Conference on Computer and Communications Security, pp 1209\u20131222","DOI":"10.1145\/3243734.3243837"},{"key":"8032_CR20","doi-asserted-by":"crossref","unstructured":"Mishra PK, Duong DH, Yasuda M (2017) Enhancement for secure multiple matrix multiplications over Ring-LWE homomorphic encryption. In: Liu JK, Samarati P (eds) Information Security Practice and Experience. Springer, pp 320\u2013330, LNCS Nr. 8616","DOI":"10.1007\/978-3-319-72359-4_18"},{"issue":"1","key":"8032_CR21","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 Internet Inf Syst 13(1):5616\u20135630","journal-title":"KSII Trans Internet Inf Syst"},{"key":"8032_CR22","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"},{"issue":"5","key":"8032_CR23","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":"8032_CR24","doi-asserted-by":"crossref","unstructured":"Gao Y, Quan G, Homsi S, Wen W, Wang L (2024) Secure and efficient general matrix multiplication on cloud using homomorphic encryption. arXiv:2405.02238","DOI":"10.21203\/rs.3.rs-4473301\/v1"},{"key":"8032_CR25","unstructured":"Aikata A, Roy SS (2024) Secure and efficient outsourced matrix multiplication with homomorphic encryption. Cryptology ePrint Archive, Paper 2024\/1730. https:\/\/eprint.iacr.org\/2024\/1730"},{"issue":"7","key":"8032_CR26","doi-asserted-by":"publisher","first-page":"2671","DOI":"10.1007\/S10623-025-01614-Y","volume":"93","author":"X Zheng","year":"2025","unstructured":"Zheng X, Li H, Wang D (2025) A new framework for fast homomorphic matrix multiplication. Des Codes Cryptogr 93(7):2671\u20132693. https:\/\/doi.org\/10.1007\/S10623-025-01614-Y","journal-title":"Des Codes Cryptogr"},{"key":"8032_CR27","unstructured":"Fan J, Vercauteren F (2012) Somewhat practical fully homomorphic encryption. Cryptology ePrint Archive, Paper 2012\/144. https:\/\/eprint.iacr.org\/2012\/144"},{"key":"8032_CR28","doi-asserted-by":"crossref","unstructured":"Ibarrondo A, Viand A (2021) Pyfhel: Python for homomorphic encryption libraries. In: Proceedings of the 9th on Workshop on Encrypted Computing & Applied Homomorphic Cryptography, pp 11\u201316","DOI":"10.1145\/3474366.3486923"},{"key":"8032_CR29","unstructured":"Albrecht M, Chase M, Chen H, Ding J, Goldwasser S, Gorbunov S, Halevi S, Hoffstein J, Laine K, Lauter K, Lokam S, Micciancio D, Moody D, Morrison T, Sahai A, Vaikuntanathan V (2018) Homomorphic encryption security standard. HomomorphicEncryption.org, Toronto, Canada, Technical report"},{"key":"8032_CR30","unstructured":"Corporation I (2021) Intel to Collaborate with Microsoft on DARPA Program. https:\/\/www.intc.com\/news-events\/press-releases\/detail\/1445\/intel-to-collaborate-with-microsoft-on-darpa-program"}],"container-title":["The Journal of Supercomputing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-025-08032-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11227-025-08032-w\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-025-08032-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,11,7]],"date-time":"2025-11-07T17:43:17Z","timestamp":1762537397000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11227-025-08032-w"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,11,7]]},"references-count":30,"journal-issue":{"issue":"16","published-online":{"date-parts":[[2025,11]]}},"alternative-id":["8032"],"URL":"https:\/\/doi.org\/10.1007\/s11227-025-08032-w","relation":{},"ISSN":["1573-0484"],"issn-type":[{"value":"1573-0484","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,11,7]]},"assertion":[{"value":"3 April 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"1 November 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 November 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 no Conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"1534"}}