{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,25]],"date-time":"2026-02-25T17:08:47Z","timestamp":1772039327827,"version":"3.50.1"},"reference-count":26,"publisher":"Springer Science and Business Media LLC","issue":"12","license":[{"start":{"date-parts":[[2023,11,28]],"date-time":"2023-11-28T00:00:00Z","timestamp":1701129600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,11,28]],"date-time":"2023-11-28T00:00:00Z","timestamp":1701129600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"name":"Universities Innovation Foundation of China-Beichuang Teaching Assistant Project","award":["2021BCA0200"],"award-info":[{"award-number":["2021BCA0200"]}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61971021"],"award-info":[{"award-number":["61971021"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Key Research and Development Project of Hebei Province","award":["22340701D"],"award-info":[{"award-number":["22340701D"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Quantum Inf Process"],"DOI":"10.1007\/s11128-023-04173-0","type":"journal-article","created":{"date-parts":[[2023,11,28]],"date-time":"2023-11-28T08:02:18Z","timestamp":1701158538000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["Two-round quantum homomorphic encryption scheme based on matrix decomposition"],"prefix":"10.1007","volume":"22","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-2369-1521","authenticated-orcid":false,"given":"Tao","family":"Shang","sequence":"first","affiliation":[]},{"given":"Shuolin","family":"Wang","sequence":"additional","affiliation":[]},{"given":"Yazhuo","family":"Jiang","sequence":"additional","affiliation":[]},{"given":"Jianwei","family":"Liu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,11,28]]},"reference":[{"key":"4173_CR1","doi-asserted-by":"crossref","unstructured":"Gentry, C.: A fully homomorphic encryption scheme. PhD thesis, Stanford University (2009)","DOI":"10.1145\/1536414.1536440"},{"key":"4173_CR2","doi-asserted-by":"crossref","unstructured":"Gentry, C.: Fully homomorphic encryption using ideal lattices. In: ACM, pp. 169\u2013178 (2009)","DOI":"10.1145\/1536414.1536440"},{"key":"4173_CR3","doi-asserted-by":"crossref","unstructured":"Brakerski, Z., Vaikuntanathan, V.: Efficient fully homomorphic encryption from (standard) lwe. In: IEEE Symposium on Foundations of Computer Science (2011)","DOI":"10.1109\/FOCS.2011.12"},{"key":"4173_CR4","unstructured":"Peter, W.S.: Algorithms for quantum computation: Discrete log and factoring. In: Proceedings of Annual Symposium on the Foundations of Computer Science IEEE Computer Society Press Los Alamitos Ca, pp. 124\u2013134 (1994)"},{"issue":"12","key":"4173_CR5","doi-asserted-by":"publisher","first-page":"3675","DOI":"10.1007\/s11128-013-0626-5","volume":"12","author":"M Liang","year":"1999","unstructured":"Liang, M.: Symmetric quantum fully homomorphic encryption with perfect security. Quantum Inf. Process. 12(12), 3675\u20133687 (1999)","journal-title":"Quantum Inf. Process."},{"issue":"7","key":"4173_CR6","doi-asserted-by":"publisher","first-page":"1650076","DOI":"10.1142\/S0217984916500767","volume":"30","author":"Y Wang","year":"2016","unstructured":"Wang, Y., She, K., Luo, Q., et al.: Symmetric weak ternary quantum homomorphic encryption schemes. Mod. Phys. Lett. B 30(7), 1650076 (2016)","journal-title":"Mod. Phys. Lett. B"},{"issue":"5","key":"4173_CR7","first-page":"8","volume":"48","author":"LX Song","year":"2020","unstructured":"Song, L.X., Zhou, D.Y., Wen, A.J.: Design and simulation of d dimensional (t, n) threshold quantum homomorphic encryption algorithm. Acta Electron. Sin. 48(5), 8 (2020)","journal-title":"Acta Electron. Sin."},{"issue":"6","key":"4173_CR8","first-page":"456","volume":"5","author":"AM Childs","year":"2005","unstructured":"Childs, A.M.: Secure assisted quantum computation. Quantum Inf. Comput. 5(6), 456\u2013466 (2005)","journal-title":"Quantum Inf. Comput."},{"issue":"9","key":"4173_CR9","doi-asserted-by":"publisher","first-page":"410","DOI":"10.1139\/cjp-2015-0030","volume":"93","author":"A Broadbent","year":"2015","unstructured":"Broadbent, A.: Delegating private quantum computations. Can J. Phys. 93(9), 410\u2013413 (2015)","journal-title":"Can J. Phys."},{"issue":"5","key":"4173_CR10","doi-asserted-by":"publisher","first-page":"050303","DOI":"10.1103\/PhysRevA.90.050303","volume":"90","author":"L Yu","year":"2014","unstructured":"Yu, L., Ca, P.D., Fitzsimons, J.F.: Limitations on information-theoretically-secure quantum homomorphic encryption. Phys. Rev. A 90(5), 050303 (2014)","journal-title":"Phys. Rev. A"},{"issue":"11","key":"4173_CR11","first-page":"927","volume":"18","author":"M Newman","year":"2017","unstructured":"Newman, M., Shi, Y.: Limitations on transversal computation through quantum homomorphic encryption. Quantum Inf. Comput. 18(11), 927\u2013948 (2017)","journal-title":"Quantum Inf. Comput."},{"issue":"9","key":"4173_CR12","first-page":"0785","volume":"18","author":"CY Lai","year":"2018","unstructured":"Lai, C.Y., Chung, K.M.: On statistically-secure quantum homomorphic encryption. Quantum Inf. Comput. 18(9), 0785\u20130794 (2018)","journal-title":"Quantum Inf. Comput."},{"issue":"9216","key":"4173_CR13","first-page":"609","volume":"2015","author":"A Broadbent","year":"2014","unstructured":"Broadbent, A., Jeffery, S.: Quantum homomorphic encryption for circuits of low t-gate complexity. Crypto 2015(9216), 609\u2013629 (2014)","journal-title":"Crypto"},{"issue":"1","key":"4173_CR14","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1007\/s11128-019-2529-6","volume":"19","author":"M Liang","year":"2019","unstructured":"Liang, M.: Teleportation-based quantum homomorphic encryption scheme with quasi-compactness and perfect security. Quantum Inf. Process. 19(1), 28 (2019)","journal-title":"Quantum Inf. Process."},{"issue":"4","key":"4173_CR15","doi-asserted-by":"publisher","first-page":"240311","DOI":"10.1360\/SSPMA-2022-0381","volume":"53","author":"SL Wang","year":"2023","unstructured":"Wang, S.L., Shang, T., Liu, J.W.: Non-interactive quantum homomorphic encryption scheme based on the rotation operator. Sci. China-Phys. Mech. Astron. 53(4), 240311 (2023)","journal-title":"Sci. China-Phys. Mech. Astron."},{"issue":"1","key":"4173_CR16","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1007\/s11128-022-03779-0","volume":"22","author":"C Wang","year":"2022","unstructured":"Wang, C., Zhou, R.G.: Secure multi-party convex hull protocol based on quantum homomorphic encryption. Quantum Inf. Process. 22(1), 24\u201332 (2022)","journal-title":"Quantum Inf. Process."},{"issue":"1","key":"4173_CR17","doi-asserted-by":"publisher","first-page":"531","DOI":"10.32604\/iasc.2022.028264","volume":"34","author":"G Xu","year":"2022","unstructured":"Xu, G., Yun, F., Chen, X.B., et al.: Secure multi-party quantum summation based on quantum homomorphic encryption. Intelligent Autom. Soft Comput. 34(1), 531\u2013541 (2022)","journal-title":"Intelligent Autom. Soft Comput."},{"issue":"6","key":"4173_CR18","doi-asserted-by":"publisher","first-page":"064402","DOI":"10.1063\/5.0135896","volume":"133","author":"G Chen","year":"2023","unstructured":"Chen, G., Wang, Y., Jian, L., et al.: Quantum identity authentication protocol based on flexible quantum homomorphic encryption with qubit rotation. J. Appl. Phys. 133(6), 064402 (2023)","journal-title":"J. Appl. Phys."},{"issue":"4","key":"4173_CR19","doi-asserted-by":"publisher","first-page":"1335","DOI":"10.1007\/s10773-017-3275-0","volume":"56","author":"XQ Sun","year":"2017","unstructured":"Sun, X.Q., Wang, T., Sun, Z.W., et al.: An efficient quantum somewhat homomorphic symmetric searchable encryption. Int. J. Theor. Phys. 56(4), 1335\u20131345 (2017)","journal-title":"Int. J. Theor. Phys."},{"issue":"1","key":"4173_CR20","doi-asserted-by":"publisher","first-page":"5135","DOI":"10.1038\/s41598-020-61791-9","volume":"10","author":"Q Zhou","year":"2017","unstructured":"Zhou, Q., Lu, S.: Quantum search on encrypted data based on quantum homomorphic encryption. Sci. Rep. 10(1), 5135 (2017)","journal-title":"Sci. Rep."},{"issue":"3","key":"4173_CR21","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1007\/s11128-020-2603-0","volume":"19","author":"CQ Gong","year":"2020","unstructured":"Gong, C.Q., Du, J., Dong, Z.Y., et al.: Grover algorithm-based quantum homomorphic encryption ciphertext retrieval scheme in quantum cloud computing. Quantum Inf. Process. 19(3), 105 (2020)","journal-title":"Quantum Inf. Process."},{"key":"4173_CR22","doi-asserted-by":"crossref","unstructured":"Grover, L.K.: A fast quantum mechanical algorithm for database search. In: The 28th Annual ACM Symposium on the Theory of Computing, pp. 212\u2013219 (1996)","DOI":"10.1145\/237814.237866"},{"key":"4173_CR23","doi-asserted-by":"crossref","unstructured":"Niemann, P., Wille, R., Drechsler, R.: Efficient synthesis of quantum circuits implementing clifford group operations. In: Design Automation Conference, pp. 483\u2013488 (2014)","DOI":"10.1109\/ASPDAC.2014.6742938"},{"issue":"4","key":"4173_CR24","doi-asserted-by":"publisher","first-page":"645","DOI":"10.1103\/PhysRevA.67.042317","volume":"67","author":"PO Boykin","year":"2003","unstructured":"Boykin, P.O., Roychowdhury, V.: Optimal encryption of quantum bits. Phys. Rev. A 67(4), 645\u2013648 (2003)","journal-title":"Phys. Rev. A"},{"key":"4173_CR25","unstructured":"Gottesman, D.: The heisenberg representation of quantum computers. In: Proceedings of the XXII International Colloquium on Group Theoretical Methods in Physics, pp. 32\u201343 (1998)"},{"key":"4173_CR26","doi-asserted-by":"crossref","unstructured":"Broadbent, A., Kazmi, R.A.: Constructions for quantum indistinguishability obfuscation. In: LATINCRYPT 2021, pp. 24\u201343 (2021)","DOI":"10.1007\/978-3-030-88238-9_2"}],"container-title":["Quantum Information Processing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11128-023-04173-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11128-023-04173-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11128-023-04173-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,12,26]],"date-time":"2023-12-26T18:07:27Z","timestamp":1703614047000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11128-023-04173-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,11,28]]},"references-count":26,"journal-issue":{"issue":"12","published-online":{"date-parts":[[2023,12]]}},"alternative-id":["4173"],"URL":"https:\/\/doi.org\/10.1007\/s11128-023-04173-0","relation":{},"ISSN":["1573-1332"],"issn-type":[{"value":"1573-1332","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,11,28]]},"assertion":[{"value":"27 July 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 November 2023","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 November 2023","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 conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"422"}}