{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,10]],"date-time":"2026-05-10T05:46:04Z","timestamp":1778391964655,"version":"3.51.4"},"reference-count":29,"publisher":"Springer Science and Business Media LLC","issue":"18","license":[{"start":{"date-parts":[[2024,8,26]],"date-time":"2024-08-26T00:00:00Z","timestamp":1724630400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,8,26]],"date-time":"2024-08-26T00:00:00Z","timestamp":1724630400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Supercomput"],"published-print":{"date-parts":[[2024,12]]},"DOI":"10.1007\/s11227-024-06449-3","type":"journal-article","created":{"date-parts":[[2024,8,26]],"date-time":"2024-08-26T19:02:12Z","timestamp":1724698932000},"page":"26435-26461","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["GMS: an efficient fully homomorphic encryption scheme for secure outsourced matrix multiplication"],"prefix":"10.1007","volume":"80","author":[{"given":"Jianxin","family":"Gao","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ying","family":"Gao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,8,26]]},"reference":[{"issue":"3","key":"6449_CR1","doi-asserted-by":"publisher","first-page":"2348","DOI":"10.1109\/tdsc.2022.3181667","volume":"20","author":"P Zhang","year":"2023","unstructured":"Zhang P, Huang T, Sun X et al (2023) Privacy-preserving and outsourced multi-party k-means clustering based on multi-key fully homomorphic encryption. IEEE Trans Dependable Secure Comput 20(3):2348\u20132359. https:\/\/doi.org\/10.1109\/tdsc.2022.3181667","journal-title":"IEEE Trans Dependable Secure Comput"},{"issue":"6","key":"6449_CR2","doi-asserted-by":"publisher","first-page":"1188","DOI":"10.1109\/tdsc.2018.2861699","volume":"17","author":"L Zhao","year":"2018","unstructured":"Zhao L, Chen L (2018) Sparse matrix masking-based non-interactive verifiable (outsourced) computation, revisited. IEEE Trans Dependable Secure Comput 17(6):1188\u20131206. https:\/\/doi.org\/10.1109\/tdsc.2018.2861699","journal-title":"IEEE Trans Dependable Secure Comput"},{"issue":"1","key":"6449_CR3","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1515\/tmmp-2016-0031","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 Mt Math Publ 67(1):69\u201383. https:\/\/doi.org\/10.1515\/tmmp-2016-0031","journal-title":"Tatra Mt Math Publ"},{"issue":"5","key":"6449_CR4","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. https:\/\/doi.org\/10.1007\/s11227-022-04850-4","journal-title":"J Supercomput"},{"key":"6449_CR5","doi-asserted-by":"publisher","unstructured":"Zhu L, Hua Q, Chen Y, et\u00a0al (2023) Secure outsourced matrix multiplication with fully homomorphic encryption. In: European Symposium on Research in Computer Security, Springer, pp 249\u2013269, https:\/\/doi.org\/10.1007\/978-3-031-50594-2_13","DOI":"10.1007\/978-3-031-50594-2_13"},{"issue":"1","key":"6449_CR6","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. https:\/\/doi.org\/10.1587\/transfun.e99.a.73","journal-title":"IEICE Trans Fundam Electron Commun Comput Sci"},{"key":"6449_CR7","doi-asserted-by":"crossref","unstructured":"Van DM, Gentry C, Halevi S, et\u00a0al (2010) Fully homomorphic encryption over the integers. In: Advances in Cryptology\u2014EUROCRYPT 2010: 29th Annual International Conference on the Theory and Applications of Cryptographic Techniques, French Riviera, May 30\u2013June 3, 2010. Proceedings 29, Springer, pp 24\u201343","DOI":"10.1007\/978-3-642-13190-5_2"},{"issue":"6","key":"6449_CR8","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1568318.1568324","volume":"56","author":"O Regev","year":"2009","unstructured":"Regev O (2009) On lattices, learning with errors, random linear codes, and cryptography. J ACM (JACM) 56(6):1\u201340. https:\/\/doi.org\/10.1145\/1568318.1568324","journal-title":"J ACM (JACM)"},{"key":"6449_CR9","doi-asserted-by":"publisher","unstructured":"L$$\\acute{o}$$pez-Alt A, Tromer E, Vaikuntanathan V, (2012) On-the-fly multiparty computation on the cloud via multikey fully homomorphic encryption. IACR Cryptol ePrint Arch 2013:94. https:\/\/doi.org\/10.1145\/2213977.2214086","DOI":"10.1145\/2213977.2214086"},{"issue":"30","key":"6449_CR10","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1109\/ccc.2010.26","volume":"7","author":"O Regev","year":"2010","unstructured":"Regev O (2010) The learning with errors problem. Invit Surv CCC 7(30):11. https:\/\/doi.org\/10.1109\/ccc.2010.26","journal-title":"Invit Surv CCC"},{"issue":"3","key":"6449_CR11","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2633600","volume":"6","author":"Z Brakerski","year":"2014","unstructured":"Brakerski Z, Gentry C, Vaikuntanathan V (2014) (leveled) fully homomorphic encryption without bootstrapping. ACM Trans Comput Theory (TOCT) 6(3):1\u201336. https:\/\/doi.org\/10.1145\/2633600","journal-title":"ACM Trans Comput Theory (TOCT)"},{"key":"6449_CR12","doi-asserted-by":"publisher","unstructured":"Gentry C, Sahai A, Waters B (2013) Homomorphic encryption from learning with errors: Conceptually-simpler, asymptotically-faster, attribute-based. In: Advances in Cryptology\u2013CRYPTO 2013: 33rd Annual Cryptology Conference, Santa Barbara, CA, USA, August 18\u201322, 2013. Proceedings, Part I, Springer, pp 75\u201392, https:\/\/doi.org\/10.1007\/978-3-642-40041-4_5","DOI":"10.1007\/978-3-642-40041-4_5"},{"key":"6449_CR13","doi-asserted-by":"publisher","unstructured":"Cheon JH, Kim A, Kim M, et\u00a0al (2017) Homomorphic encryption for arithmetic of approximate numbers. In: Advances in Cryptology\u2014ASIACRYPT 2017: 23rd International Conference on the Theory and Applications of Cryptology and Information Security, Hong Kong, China, December 3\u20137, 2017, Proceedings, Part I 23, Springer, pp 409\u2013437, https:\/\/doi.org\/10.1007\/978-3-319-70694-8_15","DOI":"10.1007\/978-3-319-70694-8_15"},{"issue":"1","key":"6449_CR14","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1007\/s00145-019-09319-x","volume":"33","author":"I Chillotti","year":"2020","unstructured":"Chillotti I, Gama N, Georgieva M et al (2020) Tfhe: fast fully homomorphic encryption over the torus. J Cryptol 33(1):34\u201391. https:\/\/doi.org\/10.1007\/s00145-019-09319-x","journal-title":"J Cryptol"},{"key":"6449_CR15","doi-asserted-by":"publisher","unstructured":"Benarroch D, Brakerski Z, Lepoint T (2017) Fhe over the integers: decomposed and batched in the post-quantum regime. In: IACR International Workshop on Public Key Cryptography, Springer, pp 271\u2013301, https:\/\/doi.org\/10.1007\/978-3-662-54388-7_10","DOI":"10.1007\/978-3-662-54388-7_10"},{"issue":"3","key":"6449_CR16","doi-asserted-by":"publisher","first-page":"885","DOI":"10.1007\/s00145-017-9273-9","volume":"31","author":"A Canteaut","year":"2018","unstructured":"Canteaut A, Carpov S, Fontaine C et al (2018) Stream ciphers: a practical solution for efficient homomorphic-ciphertext compression. J Cryptol 31(3):885\u2013916. https:\/\/doi.org\/10.1007\/s00145-017-9273-9","journal-title":"J Cryptol"},{"key":"6449_CR17","doi-asserted-by":"crossref","unstructured":"Genise N, Gentry C, Halevi S, et\u00a0al (2019) Homomorphic encryption for finite automata. In: Advances in Cryptology\u2014ASIACRYPT 2019: 25th International Conference on the Theory and Application of Cryptology and Information Security, Kobe, Japan, December 8\u201312, 2019, Proceedings, Part II 25, Springer, pp 473\u2013502","DOI":"10.1007\/978-3-030-34621-8_17"},{"key":"6449_CR18","doi-asserted-by":"publisher","unstructured":"Pereira HVL (2020) Efficient agcd-based homomorphic encryption for matrix and vector arithmetic. In: International Conference on Applied Cryptography and Network Security, Springer, pp 110\u2013129, https:\/\/doi.org\/10.1007\/978-3-030-57808-4_6","DOI":"10.1007\/978-3-030-57808-4_6"},{"key":"6449_CR19","doi-asserted-by":"crossref","unstructured":"Atallah MJ, Pantazopoulos KN, Rice JR, et\u00a0al (2002) Secure outsourcing of scientific computations. In: Advances in Computers, vol\u00a054. Elsevier, pp 215\u2013272","DOI":"10.1016\/S0065-2458(01)80019-X"},{"key":"6449_CR20","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1016\/j.ins.2014.05.014","volume":"280","author":"X Lei","year":"2014","unstructured":"Lei X, Liao X, Huang T et al (2014) Achieving security, robust cheating resistance, and high-efficiency for outsourcing large matrix multiplication computation to a malicious cloud. Inf Sci 280:205\u2013217. https:\/\/doi.org\/10.1016\/j.ins.2014.05.014","journal-title":"Inf Sci"},{"key":"6449_CR21","doi-asserted-by":"publisher","unstructured":"Fu S, Yu Y, Xu M (2017) A secure algorithm for outsourcing matrix multiplication computation in the cloud. In: Proceedings of the Fifth ACM international workshop on security in cloud computing, pp 27\u201333, https:\/\/doi.org\/10.1145\/3055259.3055263","DOI":"10.1145\/3055259.3055263"},{"key":"6449_CR22","doi-asserted-by":"publisher","unstructured":"Halevi S, Shoup V (2014) Algorithms in helib. In: Advances in Cryptology\u2014CRYPTO 2014: 34th Annual Cryptology Conference, Santa Barbara, CA, USA, August 17\u201321, 2014, Proceedings, Part I 34, Springer, pp 554\u2013571, https:\/\/doi.org\/10.1007\/978-3-662-44371-2_31","DOI":"10.1007\/978-3-662-44371-2_31"},{"key":"6449_CR23","doi-asserted-by":"publisher","unstructured":"Lu W, Kawasaki S, Sakuma J (2017) Using fully homomorphic encryption for statistical analysis of categorical, ordinal and numerical data. In: Proceedings 2017 Network and Distributed System Security Symposium, Internet Society, https:\/\/doi.org\/10.14722\/ndss.2017.23119","DOI":"10.14722\/ndss.2017.23119"},{"issue":"11","key":"6449_CR24","doi-asserted-by":"publisher","first-page":"5616","DOI":"10.3837\/tiis.2019.11.019","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 (TIIS) 13(11):5616\u20135630. https:\/\/doi.org\/10.3837\/tiis.2019.11.019","journal-title":"KSII Trans Internet Inf Syst (TIIS)"},{"key":"6449_CR25","doi-asserted-by":"publisher","unstructured":"Lu W, Sakuma J (2018) More practical privacy-preserving machine learning as a service via efficient secure matrix multiplication. In: Proceedings of the 6th Workshop on Encrypted Computing and Applied Homomorphic Cryptography, pp 25\u201336, https:\/\/doi.org\/10.1145\/3267973.3267976","DOI":"10.1145\/3267973.3267976"},{"key":"6449_CR26","doi-asserted-by":"publisher","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, https:\/\/doi.org\/10.1145\/3243734.3243837","DOI":"10.1145\/3243734.3243837"},{"key":"6449_CR27","doi-asserted-by":"publisher","unstructured":"Micciancio D, Walter M (2017) Gaussian sampling over the integers: Efficient, generic, constant-time. In: Advances in Cryptology\u2014CRYPTO 2017: 37th Annual International Cryptology Conference, Santa Barbara, CA, USA, August 20\u201324, 2017, Proceedings, Part II 37, Springer, pp 455\u2013485, https:\/\/doi.org\/10.1007\/978-3-319-63715-0_16","DOI":"10.1007\/978-3-319-63715-0_16"},{"key":"6449_CR28","doi-asserted-by":"publisher","unstructured":"Genise N, Micciancio D, Polyakov Y (2019) Building an efficient lattice gadget toolkit: Subgaussian sampling and more. In: Advances in Cryptology\u2014EUROCRYPT 2019: 38th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Darmstadt, Germany, May 19\u201323, 2019, Proceedings, Part II 38, Springer, pp 655\u2013684, https:\/\/doi.org\/10.1007\/978-3-030-17656-3_23","DOI":"10.1007\/978-3-030-17656-3_23"},{"key":"6449_CR29","doi-asserted-by":"publisher","DOI":"10.1201\/9781351133036","volume-title":"Introduction to modern cryptography","author":"J Katz","year":"2020","unstructured":"Katz J, Lindell Y (2020) Introduction to modern cryptography, 3rd edn. Chapman and Hall CRC, London. https:\/\/doi.org\/10.1201\/9781351133036","edition":"3"}],"container-title":["The Journal of Supercomputing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-024-06449-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11227-024-06449-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-024-06449-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,9,19]],"date-time":"2024-09-19T20:44:23Z","timestamp":1726778663000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11227-024-06449-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,8,26]]},"references-count":29,"journal-issue":{"issue":"18","published-print":{"date-parts":[[2024,12]]}},"alternative-id":["6449"],"URL":"https:\/\/doi.org\/10.1007\/s11227-024-06449-3","relation":{},"ISSN":["0920-8542","1573-0484"],"issn-type":[{"value":"0920-8542","type":"print"},{"value":"1573-0484","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,8,26]]},"assertion":[{"value":"11 August 2024","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 August 2024","order":2,"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 competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}