{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,2]],"date-time":"2026-07-02T23:45:08Z","timestamp":1783035908815,"version":"3.54.6"},"reference-count":31,"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"}],"funder":[{"name":"National Science Foundation","award":["1952792"],"award-info":[{"award-number":["1952792"]}]},{"name":"National Science Foundation","award":["1952792"],"award-info":[{"award-number":["1952792"]}]},{"DOI":"10.13039\/100000181","name":"Air Force Office of Scientific Research","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100000181","id-type":"DOI","asserted-by":"publisher"}]},{"name":"the Air Force Research Laboratory\/Information Directorate","award":["AFRL-2024-0944"],"award-info":[{"award-number":["AFRL-2024-0944"]}]},{"name":"the Air Force Research Laboratory\/Information Directorate","award":["AFRL-2024-0944"],"award-info":[{"award-number":["AFRL-2024-0944"]}]}],"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-06428-8","type":"journal-article","created":{"date-parts":[[2024,8,26]],"date-time":"2024-08-26T17:02:16Z","timestamp":1724691736000},"page":"26394-26434","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["Secure and efficient general matrix multiplication on cloud using homomorphic encryption"],"prefix":"10.1007","volume":"80","author":[{"given":"Yang","family":"Gao","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Gang","family":"Quan","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Soamar","family":"Homsi","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Wujie","family":"Wen","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Liqiang","family":"Wang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2024,8,26]]},"reference":[{"key":"6428_CR1","doi-asserted-by":"publisher","first-page":"849","DOI":"10.1016\/j.future.2017.09.020","volume":"79","author":"B Varghese","year":"2018","unstructured":"Varghese B, Buyya R (2018) Next generation cloud computing: new trends and research directions. Futur Gener Comput Syst 79:849\u2013861","journal-title":"Futur Gener Comput Syst"},{"key":"6428_CR2","doi-asserted-by":"publisher","first-page":"443","DOI":"10.1016\/j.proeng.2017.01.087","volume":"178","author":"T Vasiljeva","year":"2017","unstructured":"Vasiljeva T, Shaikhulina S, Kreslins K (2017) Cloud computing: business perspectives, benefits and challenges for small and medium enterprises (case of Latvia). Procedia Eng 178:443\u2013451","journal-title":"Procedia Eng"},{"key":"6428_CR3","unstructured":"Scale R (2015) State of the cloud report. Technical report"},{"issue":"3","key":"6428_CR4","doi-asserted-by":"publisher","first-page":"242","DOI":"10.1007\/s12045-014-0030-1","volume":"19","author":"V Rajaraman","year":"2014","unstructured":"Rajaraman V (2014) Cloud computing. Resonance 19(3):242\u2013258","journal-title":"Resonance"},{"issue":"11","key":"6428_CR5","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 Comput 4(11):169\u2013180","journal-title":"Found Secure Comput"},{"key":"6428_CR6","doi-asserted-by":"crossref","unstructured":"Gentry C (2009) Fully homomorphic encryption using ideal lattices. In: Proceedings of the Forty-First Annual ACM Symposium on Theory of Computing, pp 169\u2013178","DOI":"10.1145\/1536414.1536440"},{"issue":"3","key":"6428_CR7","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","journal-title":"ACM Trans Comput Theory (TOCT)"},{"key":"6428_CR8","unstructured":"Ran R, Xu N, Wang W, Gang Q, Yin J, Wen W (2022) Cryptogcn: fast and scalable homomorphically encrypted graph convolutional network inference. Preprint arXiv:2209.11904"},{"issue":"1","key":"6428_CR9","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(1):57\u201381","journal-title":"Des Codes Crypt"},{"key":"6428_CR10","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":"6428_CR11","unstructured":"Fan J, Vercauteren F (2012) Somewhat practical fully homomorphic encryption. Cryptology ePrint Archive"},{"key":"6428_CR12","doi-asserted-by":"crossref","unstructured":"Brakerski Z (2012) Fully homomorphic encryption without modulus switching from classical GapSVP. In: Annual Cryptology Conference. Springer, pp 868\u2013886","DOI":"10.1007\/978-3-642-32009-5_50"},{"key":"6428_CR13","doi-asserted-by":"crossref","unstructured":"Cheon JH, Kim A, Kim M, Song Y (2017) Homomorphic encryption for arithmetic of approximate numbers. In: International Conference on the Theory and Application of Cryptology and Information Security. Springer, pp 409\u2013437","DOI":"10.1007\/978-3-319-70694-8_15"},{"key":"6428_CR14","doi-asserted-by":"publisher","unstructured":"Ames S, Venkitasubramaniam M, Page A, Kocabas O, Soyata T (2020) Secure health monitoring in the cloud using homomorphic encryption: a branching-program formulation, pp 56\u201392. https:\/\/doi.org\/10.4018\/978-1-5225-9863-3.ch004","DOI":"10.4018\/978-1-5225-9863-3.ch004"},{"key":"6428_CR15","doi-asserted-by":"crossref","unstructured":"Nocker M, Drexel D, Rader M, Montuoro A, Sch\u00f6ttle P (2023) He-man\u2013homomorphically encrypted machine learning with ONNX models. Preprint arXiv:2302.08260","DOI":"10.1145\/3589883.3589889"},{"key":"6428_CR16","doi-asserted-by":"crossref","unstructured":"Reagen B, Choi W-S, Ko Y, Lee VT, Lee H-HS, Wei G-Y, Brooks D (2021) Cheetah: optimizing and accelerating homomorphic encryption for private inference. In: IEEE International Symposium on High-Performance Computer Architecture (HPCA). IEEE, pp 26\u201339","DOI":"10.1109\/HPCA51647.2021.00013"},{"key":"6428_CR17","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.parco.2018.10.003","volume":"81","author":"I Masliah","year":"2019","unstructured":"Masliah I, Abdelfattah A, Haidar A, Tomov S, Baboulin M, Falcou J, Dongarra J (2019) Algorithms and optimization techniques for high-performance matrix-matrix multiplications of very small matrices. Parallel Comput 81:1\u201321","journal-title":"Parallel Comput"},{"key":"6428_CR18","doi-asserted-by":"crossref","unstructured":"Nagasaka Y, Matsuoka S, Azad A, Bulu\u00e7 A (2018) High-performance sparse matrix-matrix products on intel KNL and multicore architectures. In: Proceedings of the 47th International Conference on Parallel Processing Companion, pp 1\u201310","DOI":"10.1145\/3229710.3229720"},{"key":"6428_CR19","doi-asserted-by":"crossref","unstructured":"Jiang P, Hong C, Agrawal G (2020) A novel data transformation and execution strategy for accelerating sparse matrix multiplication on GPUs. In: Proceedings of the 25th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, pp 376\u2013388","DOI":"10.1145\/3332466.3374546"},{"key":"6428_CR20","doi-asserted-by":"crossref","unstructured":"Liu W, Vinter B (2014) An efficient GPU general sparse matrix-matrix multiplication for irregular data. In: IEEE 28th International Parallel and Distributed Processing Symposium. IEEE, pp 370\u2013381","DOI":"10.1109\/IPDPS.2014.47"},{"key":"6428_CR21","doi-asserted-by":"publisher","unstructured":"Valero-Lara P, Mart\u00ednez-P\u00e9rez I, Mateo S, Sirvent R, Beltran V, Martorell X, Labarta J (2018) Variable batched DGEMM. In: 2018 26th Euromicro International Conference on Parallel, Distributed and Network-Based Processing (PDP), pp 363\u2013367. https:\/\/doi.org\/10.1109\/PDP2018.2018.00065","DOI":"10.1109\/PDP2018.2018.00065"},{"key":"6428_CR22","doi-asserted-by":"crossref","unstructured":"Zhang Z, Wang H, Han S, Dally WJ (2020) SpArch: efficient architecture for sparse matrix multiplication. In: 2020 IEEE International Symposium on High Performance Computer Architecture (HPCA). IEEE, pp 261\u2013274","DOI":"10.1109\/HPCA47549.2020.00030"},{"key":"6428_CR23","doi-asserted-by":"crossref","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","DOI":"10.14722\/ndss.2017.23119"},{"key":"6428_CR24","doi-asserted-by":"crossref","unstructured":"Halevi S, Shoup V (2014) Algorithms in HElib. In: Annual Cryptology Conference. Springer, pp 554\u2013571","DOI":"10.1007\/978-3-662-44371-2_31"},{"issue":"1","key":"6428_CR25","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1515\/tmmp-2016-0031","volume":"67","author":"DH Duong","year":"2017","unstructured":"Duong DH, Mishra PK, Yasuda M (2017) 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"},{"key":"6428_CR26","doi-asserted-by":"crossref","unstructured":"Mishra PK, Duong DH, Yasuda M (2017) Enhancement for secure multiple matrix multiplications over ring-LWE homomorphic encryption. In: Information Security Practice and Experience: 13th International Conference, ISPEC 2017, Melbourne, Proceedings 13. Springer, pp 320\u2013330","DOI":"10.1007\/978-3-319-72359-4_18"},{"key":"6428_CR27","doi-asserted-by":"crossref","unstructured":"Jiang X, Kim M, Lauter K, Song Y (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"},{"issue":"1","key":"6428_CR28","doi-asserted-by":"publisher","first-page":"551","DOI":"10.1109\/TDSC.2021.3139318","volume":"20","author":"Z Huang","year":"2023","unstructured":"Huang Z, Hong C, Weng C, Lu W-J, Qu H (2023) More efficient secure matrix multiplication for unbalanced recommender systems. IEEE Trans Dependable Secure Comput 20(1):551\u2013562. https:\/\/doi.org\/10.1109\/TDSC.2021.3139318","journal-title":"IEEE Trans Dependable Secure Comput"},{"key":"6428_CR29","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":"6428_CR30","doi-asserted-by":"crossref","unstructured":"Huang H, Zong H (2022) Secure matrix multiplication based on fully homomorphic encryption. J Supercomput 1\u201322","DOI":"10.1007\/s11227-022-04850-4"},{"key":"6428_CR31","doi-asserted-by":"crossref","unstructured":"Lyubashevsky V, Peikert C, Regev O (2010) On ideal lattices and learning with errors over rings. In: 29th International Conference on the Theory and Applications of Cryptographic Techniques. Springer, pp 1\u201323","DOI":"10.1007\/978-3-642-13190-5_1"}],"container-title":["The Journal of Supercomputing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-024-06428-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11227-024-06428-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-024-06428-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,9,19]],"date-time":"2024-09-19T20:44:18Z","timestamp":1726778658000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11227-024-06428-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,8,26]]},"references-count":31,"journal-issue":{"issue":"18","published-print":{"date-parts":[[2024,12]]}},"alternative-id":["6428"],"URL":"https:\/\/doi.org\/10.1007\/s11227-024-06428-8","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":"2 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":"No, I declare that the authors have no conflict of interest as defined by Springer, or other interests that might be perceived to influence the results and\/or discussion reported in this paper.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"It is not applicable. This study did not involve human participants, personal data, or any procedures requiring ethical approval.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethical statements"}}]}}