{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T03:12:27Z","timestamp":1777605147682,"version":"3.51.4"},"reference-count":33,"publisher":"Springer Science and Business Media LLC","issue":"7","license":[{"start":{"date-parts":[[2025,3,15]],"date-time":"2025-03-15T00:00:00Z","timestamp":1741996800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,3,15]],"date-time":"2025-03-15T00:00:00Z","timestamp":1741996800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"name":"STU Scientific Research Initiation","award":["NTF24023T"],"award-info":[{"award-number":["NTF24023T"]}]},{"DOI":"10.13039\/501100012166","name":"National Key Research and Development Program of China","doi-asserted-by":"publisher","award":["2020YFA0712300"],"award-info":[{"award-number":["2020YFA0712300"]}],"id":[{"id":"10.13039\/501100012166","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100012166","name":"National Key Research and Development Program of China","doi-asserted-by":"publisher","award":["2020YFA0712300"],"award-info":[{"award-number":["2020YFA0712300"]}],"id":[{"id":"10.13039\/501100012166","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["12171469"],"award-info":[{"award-number":["12171469"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Des. Codes Cryptogr."],"published-print":{"date-parts":[[2025,7]]},"DOI":"10.1007\/s10623-025-01614-y","type":"journal-article","created":{"date-parts":[[2025,3,15]],"date-time":"2025-03-15T01:55:01Z","timestamp":1742003701000},"page":"2671-2693","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["A new framework for fast homomorphic matrix multiplication"],"prefix":"10.1007","volume":"93","author":[{"given":"Xiaopeng","family":"Zheng","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hongbo","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dingkang","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,3,15]]},"reference":[{"key":"1614_CR1","doi-asserted-by":"crossref","unstructured":"Alperin-Sheriff J., Peikert C.: Practical bootstrapping in quasilinear time. In: Annual Cryptology Conference. Springer, New York, pp. 1\u201320 (2013).","DOI":"10.1007\/978-3-642-40041-4_1"},{"issue":"3","key":"1614_CR2","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.: (Leveled) fully homomorphic encryption without bootstrapping. ACM Trans. Comput. Theory 6(3), 1\u201336 (2014).","journal-title":"ACM Trans. Comput. Theory"},{"key":"1614_CR3","doi-asserted-by":"crossref","unstructured":"Chen H., Dai W., Kim M., Song Y.: Efficient homomorphic conversion between (ring) LWE ciphertexts. In: International Conference on Applied Cryptography and Network Security, Springer, pp. 460\u2013479 (2021).","DOI":"10.1007\/978-3-030-78372-3_18"},{"key":"1614_CR4","doi-asserted-by":"publisher","first-page":"1390","DOI":"10.1109\/TIFS.2024.3490862","volume":"20","author":"J Chen","year":"2025","unstructured":"Chen J., Yang L., Wu W., Liu Y., Feng Y.: Homomorphic matrix operations under bicyclic encoding. IEEE Trans. Inf. Forensics Secur. 20, 1390\u20131404 (2025). https:\/\/doi.org\/10.1109\/TIFS.2024.3490862.","journal-title":"IEEE Trans. Inf. Forensics Secur."},{"key":"1614_CR5","doi-asserted-by":"crossref","unstructured":"Cheon J.H., Kim A., Kim M., Song Y.: Homomorphic encryption for arithmetic of approximate numbers. In: Advances in Cryptology\u2014ASIACRYPT 2017, Springer, Cham, pp. 409\u2013437 (2017).","DOI":"10.1007\/978-3-319-70694-8_15"},{"key":"1614_CR6","doi-asserted-by":"crossref","unstructured":"Chillotti I., Gama N., Georgieva M., Izabach\u00e8ne M.: Faster fully homomorphic encryption: bootstrapping in less than 0.1 seconds. In: Advances in Cryptology\u2014ASIACRYPT 2016, Springer, Cham, pp. 3\u201333 (2016).","DOI":"10.1007\/978-3-662-53887-6_1"},{"key":"1614_CR7","doi-asserted-by":"crossref","unstructured":"Costache A., Smart N.P.: Which ring based somewhat homomorphic encryption scheme is best? In: Topics in Cryptology-CT-RSA 2016: The Cryptographers\u2019 Track at the RSA Conference 2016, Springer, pp. 325\u2013340 (2016).","DOI":"10.1007\/978-3-319-29485-8_19"},{"key":"1614_CR8","doi-asserted-by":"crossref","unstructured":"Ducas L., Micciancio D.: FHEW: bootstrapping homomorphic encryption in less than a second. In: Advances in Cryptology\u2014EUROCRYPT 2015, Springer, Cham, pp. 617\u2013640 (2015).","DOI":"10.1007\/978-3-662-46800-5_24"},{"issue":"1","key":"1614_CR9","first-page":"69","volume":"67","author":"DH Duong","year":"2016","unstructured":"Duong D.H., Mishra P.K., Yasuda M.: Efficient secure matrix multiplication over lwe-based homomorphic encryption. Tatra Mt. Math. Publ. 67(1), 69\u201383 (2016).","journal-title":"Tatra Mt. Math. Publ."},{"key":"1614_CR10","unstructured":"Fan J., Vercauteren F.: Somewhat Practical Fully Homomorphic Encryption. Cryptology ePrint Archive, Paper 2012\/144 (2012)."},{"issue":"18","key":"1614_CR11","doi-asserted-by":"publisher","first-page":"26435","DOI":"10.1007\/s11227-024-06449-3","volume":"80","author":"J Gao","year":"2024","unstructured":"Gao J., Gao Y.: Gms: an efficient fully homomorphic encryption scheme for secure outsourced matrix multiplication. J. Supercomput. 80(18), 26435\u201326461 (2024).","journal-title":"J. Supercomput."},{"key":"1614_CR12","doi-asserted-by":"crossref","unstructured":"Gentry C., Sahai A., Waters B.: Homomorphic encryption from learning with errors: conceptually-simpler, asymptotically-faster, attribute-based. In: Advances in Cryptology\u2013CRYPTO 2013, Springer, Cham, pp. 75\u201392 (2013).","DOI":"10.1007\/978-3-642-40041-4_5"},{"key":"1614_CR13","doi-asserted-by":"crossref","unstructured":"Gentry C.: Fully homomorphic encryption using ideal lattices. In: STOC\u201909\u2014Proceedings of the 2009 ACM International Symposium on Theory of Computing, pp. 169\u2013178. ACM, New York (2009).","DOI":"10.1145\/1536414.1536440"},{"issue":"12\u201315","key":"1614_CR14","first-page":"8","volume":"6","author":"S Halevi","year":"2013","unstructured":"Halevi S., Shoup V.: Design and implementation of a homomorphic-encryption library. IBM Res. 6(12\u201315), 8\u201336 (2013).","journal-title":"IBM Res."},{"issue":"5","key":"1614_CR15","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.: Secure matrix multiplication based on fully homomorphic encryption. J. Supercomput. 79(5), 5064\u20135085 (2023).","journal-title":"J. Supercomput."},{"issue":"01","key":"1614_CR16","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., Qu H.: More efficient secure matrix multiplication for unbalanced recommender systems. IEEE Trans. Depend. Secure Comput. 20(01), 551\u2013562 (2023).","journal-title":"IEEE Trans. Depend. Secure Comput."},{"key":"1614_CR17","doi-asserted-by":"crossref","unstructured":"Jiang X., Kim M., Lauter K., Song Y.: 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 (2018).","DOI":"10.1145\/3243734.3243837"},{"key":"1614_CR18","unstructured":"Juvekar C., Vaikuntanathan V., Chandrakasan A.: $$\\{$$GAZELLE$$\\}$$: a low latency framework for secure neural network inference. In: 27th USENIX Security Symposium (USENIX Security 18), pp. 1651\u20131669 (2018)."},{"key":"1614_CR19","unstructured":"Lee E., Lee J.-W., Lee J., Kim Y.-S., Kim Y., No J.-S., Choi W.: Low-complexity deep convolutional neural networks on fully homomorphic encryption using multiplexed parallel convolutions. In: International Conference on Machine Learning, PMLR, pp. 12403\u201312422 (2022)."},{"key":"1614_CR20","doi-asserted-by":"crossref","unstructured":"Lee Y., Micciancio D., Kim A., Choi R., Deryabin M., Eom J., Yoo D.: Efficient FHEW bootstrapping with small evaluation keys, and applications to threshold homomorphic encryption. In: Advances in Cryptology\u2014EUROCRYPT 2023, Springer, Cham, pp. 227\u2013256 (2023).","DOI":"10.1007\/978-3-031-30620-4_8"},{"key":"1614_CR21","doi-asserted-by":"crossref","unstructured":"Liu F.-H., Wang H.: Batch bootstrapping I: a new framework for SIMD bootstrapping in polynomial modulus. In: Advances in Cryptology\u2014EUROCRYPT 2023, Springer, Cham, pp. 321\u2013352 (2023).","DOI":"10.1007\/978-3-031-30620-4_11"},{"key":"1614_CR22","doi-asserted-by":"crossref","unstructured":"Lu W.-J., Sakuma J.: More practical privacy-preserving machine learning as a service via efficient secure matrix multiplication. In: Proceedings of the 6th Workshop on Encrypted Computing & Applied Homomorphic Cryptography, pp. 25\u201336 (2018).","DOI":"10.1145\/3267973.3267976"},{"key":"1614_CR23","doi-asserted-by":"crossref","unstructured":"Lyubashevsky V., Peikert C., Regev O.: A toolkit for ring-LWE cryptography. In: Advances in Cryptology\u2013EUROCRYPT 2013, Springer, New York, pp. 35\u201354 (2013).","DOI":"10.1007\/978-3-642-38348-9_3"},{"key":"1614_CR24","doi-asserted-by":"crossref","unstructured":"Lyubashevsky V., Peikert C., Regev O.: On ideal lattices and learning with errors over rings. In: Advances in Cryptology\u2013EUROCRYPT 2010, Springer, Cham, pp. 1\u201323 (2010).","DOI":"10.1007\/978-3-642-13190-5_1"},{"key":"1614_CR25","doi-asserted-by":"crossref","unstructured":"Mishra P.K., Duong D.H., Yasuda M.: Enhancement for secure multiple matrix multiplications over ring-lwe homomorphic encryption. In: Information Security Practice and Experience: 13th International Conference, ISPEC 2017, Melbourne, VIC, Australia, December 13\u201315, 2017, Proceedings 13, Springer, pp. 320\u2013330 (2017).","DOI":"10.1007\/978-3-319-72359-4_18"},{"key":"1614_CR26","doi-asserted-by":"crossref","unstructured":"Pang Q., Zhu J., M\u00f6llering H., Zheng W., Schneider T.: Bolt: Privacy-preserving, accurate and efficient inference for transformers. In: 2024 IEEE Symposium on Security and Privacy (SP), IEEE, pp. 4753\u20134771 (2024).","DOI":"10.1109\/SP54263.2024.00130"},{"issue":"6","key":"1614_CR27","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1568318.1568324","volume":"56","author":"O Regev","year":"2009","unstructured":"Regev O.: On lattices, learning with errors, random linear codes, and cryptography. J. ACM 56(6), 1\u201340 (2009).","journal-title":"J. ACM"},{"key":"1614_CR28","unstructured":"Shai H., Victor S.: Design and implementation of HElib: a homomorphic encryption library. Cryptology ePrint Archive, Paper 2020\/1481 (2020)."},{"key":"1614_CR29","volume-title":"Elements of Number Theory","author":"IM Vinogradov","year":"2003","unstructured":"Vinogradov I.M.: Elements of Number Theory. Courier Dover Publications, New York (2003)."},{"key":"1614_CR30","doi-asserted-by":"crossref","unstructured":"Xia H., Liu F.-H., Wang H.: More efficient functional bootstrapping for general functions in polynomial modulus. In: Theory of Cryptography Conference, Springer, pp. 130\u2013163 (2025).","DOI":"10.1007\/978-3-031-78023-3_5"},{"key":"1614_CR31","unstructured":"Zhang J., Yang X., He L., Chen K., Lu W.-J., Wang Y., Hou X., Liu J., Ren K., Yang X.: Secure Transformer Inference Made Non-interactive. Cryptology ePrint Archive, Paper 2024\/136 (2024). https:\/\/eprint.iacr.org\/2024\/136."},{"key":"1614_CR32","unstructured":"Zheng X., Li H., Wang D.: A New Framework for Fast Homomorphic Matrix Multiplication. Cryptology ePrint Archive, Paper 2023\/1649 (2023). https:\/\/eprint.iacr.org\/2023\/1649."},{"key":"1614_CR33","doi-asserted-by":"crossref","unstructured":"Zhu L., Hua Q., Chen Y., Jin H.: Secure outsourced matrix multiplication with fully homomorphic encryption. In: European Symposium on Research in Computer Security, Springer, Cham, pp. 249\u2013269 (2023).","DOI":"10.1007\/978-3-031-50594-2_13"}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-025-01614-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10623-025-01614-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-025-01614-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,6]],"date-time":"2025-09-06T07:44:37Z","timestamp":1757144677000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10623-025-01614-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,3,15]]},"references-count":33,"journal-issue":{"issue":"7","published-print":{"date-parts":[[2025,7]]}},"alternative-id":["1614"],"URL":"https:\/\/doi.org\/10.1007\/s10623-025-01614-y","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"value":"0925-1022","type":"print"},{"value":"1573-7586","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,3,15]]},"assertion":[{"value":"22 July 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 February 2025","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 March 2025","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 March 2025","order":4,"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":"Competing interests"}}]}}