{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,27]],"date-time":"2026-03-27T22:36:37Z","timestamp":1774650997106,"version":"3.50.1"},"reference-count":52,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2025,4,23]],"date-time":"2025-04-23T00:00:00Z","timestamp":1745366400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0"},{"start":{"date-parts":[[2025,4,23]],"date-time":"2025-04-23T00:00:00Z","timestamp":1745366400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Complex Intell. Syst."],"published-print":{"date-parts":[[2025,6]]},"DOI":"10.1007\/s40747-025-01851-7","type":"journal-article","created":{"date-parts":[[2025,4,23]],"date-time":"2025-04-23T10:14:22Z","timestamp":1745403262000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["Analysis of quantum fully homomorphic encryption schemes (QFHE) and hierarchial memory management for QFHE"],"prefix":"10.1007","volume":"11","author":[{"given":"Shreya","family":"Savadatti","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8455-9108","authenticated-orcid":false,"given":"Aswani Kumar","family":"Cherukuri","sequence":"additional","affiliation":[]},{"given":"Annapurna","family":"Jonnalagadda","sequence":"additional","affiliation":[]},{"given":"Athanasios V.","family":"Vasilakos","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,4,23]]},"reference":[{"key":"1851_CR1","volume-title":"Fundamentals of abstract algebra","author":"DS Malik","year":"1997","unstructured":"Malik DS, Mordeson JN, Sen M (1997) Fundamentals of abstract algebra. McGraw-Hill, New York"},{"issue":"4","key":"1851_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3214303","volume":"51","author":"A Acar","year":"2018","unstructured":"Acar A, Aksu H, Uluagac AS, Conti M (2018) A survey on homomorphic encryption schemes: theory and implementation. ACM Comput Surveys (Csur) 51(4):1\u201335","journal-title":"ACM Comput Surveys (Csur)"},{"key":"1851_CR3","unstructured":"The Merriam-Webster\u2019s Dictionary Website. http:\/\/www.merriam-webster.com"},{"key":"1851_CR4","volume-title":"An intermediate Greek-English Lexicon: founded upon the seventh edition of Liddell and Scott\u2019s Greek-English Lexicon","author":"HG Liddell","year":"1896","unstructured":"Liddell HG, Scott R (1896) An intermediate Greek-English Lexicon: founded upon the seventh edition of Liddell and Scott\u2019s Greek-English Lexicon. Harper & Brothers, New York"},{"key":"1851_CR5","volume-title":"A fully homomorphic encryption scheme","author":"C Gentry","year":"2009","unstructured":"Gentry C (2009) A fully homomorphic encryption scheme. Stanford University, California"},{"issue":"3","key":"1851_CR6","first-page":"1","volume":"17","author":"S Naseem","year":"2017","unstructured":"Naseem S, Ahmed K (2017) Information protection in cognitive science. Int J Comput Sci Netw Secur (IJCSNS) 17(3):1","journal-title":"Int J Comput Sci Netw Secur (IJCSNS)"},{"key":"1851_CR7","doi-asserted-by":"publisher","DOI":"10.1016\/j.physa.2022.128397","volume":"610","author":"J-W Zhang","year":"2023","unstructured":"Zhang J-W, Xu G, Chen X-B, Chang Y, Dong Z-C (2023) Improved multiparty quantum private comparison based on quantum homomorphic encryption. Physica A 610:128397","journal-title":"Physica A"},{"issue":"12","key":"1851_CR8","doi-asserted-by":"publisher","first-page":"3675","DOI":"10.1007\/s11128-013-0626-5","volume":"12","author":"M Liang","year":"2013","unstructured":"Liang M (2013) Symmetric quantum fully homomorphic encryption with perfect security. Quantum Inf Process 12(12):3675\u20133687","journal-title":"Quantum Inf Process"},{"key":"1851_CR9","doi-asserted-by":"crossref","unstructured":"Alagic G, Dulek Y, Schaffner C, Speelman F (2017) Quantum fully homomorphic encryption with verification. In: Advances in Cryptology\u2013ASIACRYPT 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, pp. 438\u2013467. Springer","DOI":"10.1007\/978-3-319-70694-8_16"},{"issue":"3","key":"1851_CR10","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":"1851_CR11","doi-asserted-by":"crossref","unstructured":"Sahai A, Waters B (2014) How to use indistinguishability obfuscation: deniable encryption, and more. In: Proceedings of the Forty-sixth Annual ACM Symposium on Theory of Computing, pp. 475\u2013484","DOI":"10.1145\/2591796.2591825"},{"issue":"1","key":"1851_CR12","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1080\/13600834.2019.1573501","volume":"28","author":"CJ Hoofnagle","year":"2019","unstructured":"Hoofnagle CJ, Van Der Sloot B, Borgesius FZ (2019) The European union general data protection regulation: what it is and what it means. Inf Commun Technol Law 28(1):65\u201398","journal-title":"Inf Commun Technol Law"},{"issue":"6","key":"1851_CR13","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 56(6):1\u201340","journal-title":"J ACM"},{"key":"1851_CR14","doi-asserted-by":"publisher","first-page":"43","DOI":"10.70470\/SHIFRA\/2023\/006","volume":"2023","author":"SN Tambe-Jagtap","year":"2023","unstructured":"Tambe-Jagtap SN (2023) A survey of cryptographic algorithms in cybersecurity: from classical methods to quantum-resistant solutions. SHIFRA 2023:43\u201352","journal-title":"SHIFRA"},{"key":"1851_CR15","doi-asserted-by":"crossref","unstructured":"Shor PW (1994) Algorithms for quantum computation: discrete logarithms and factoring. In: Proceedings 35th Annual Symposium on Foundations of Computer Science, pp. 124\u2013134. IEEE","DOI":"10.1109\/SFCS.1994.365700"},{"issue":"7671","key":"1851_CR16","doi-asserted-by":"publisher","first-page":"188","DOI":"10.1038\/nature23461","volume":"549","author":"DJ Bernstein","year":"2017","unstructured":"Bernstein DJ, Lange T (2017) Post-quantum cryptography. Nature 549(7671):188\u2013194","journal-title":"Nature"},{"key":"1851_CR17","unstructured":"Childs AM (2001) Secure assisted quantum computation. arXiv preprint arXiv: quant-ph\/0111046"},{"issue":"5","key":"1851_CR18","doi-asserted-by":"publisher","first-page":"38","DOI":"10.1109\/MSP.2018.3761723","volume":"16","author":"M Mosca","year":"2018","unstructured":"Mosca M (2018) Cybersecurity in an era with quantum computers: will we be ready? IEEE Secur Privacy 16(5):38\u201341","journal-title":"IEEE Secur Privacy"},{"key":"1851_CR19","doi-asserted-by":"crossref","unstructured":"Cheon JH, Kim A, Kim M, Song Y (2017) Homomorphic encryption for arithmetic of approximate numbers. In: Advances in Cryptology\u2013ASIACRYPT 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, pp. 409\u2013437. Springer","DOI":"10.1007\/978-3-319-70694-8_15"},{"key":"1851_CR20","doi-asserted-by":"crossref","unstructured":"Halevi S, Shoup V (2014) Algorithms in Helib. In: Advances in Cryptology\u2013CRYPTO 2014: 34th Annual Cryptology Conference, Santa Barbara, CA, USA, August 17\u201321, 2014, Proceedings, Part I 34, pp. 554\u2013571. Springer","DOI":"10.1007\/978-3-662-44371-2_31"},{"key":"1851_CR21","unstructured":"Microsoft SEAL (release 4.1) (2023). https:\/\/github.com\/Microsoft\/SEAL. Microsoft Research, Redmond, WA"},{"key":"1851_CR22","doi-asserted-by":"publisher","first-page":"276","DOI":"10.4018\/979-8-3693-2081-5.ch012","volume-title":"Emerging technologies and security in cloud computing","author":"N Jain","year":"2024","unstructured":"Jain N, Cherukuri AKA, Kamalov F (2024) Revisiting fully homomorphic encryption schemes for privacy-preserving computing. Emerging technologies and security in cloud computing. IGI Global, New York, pp 276\u2013294"},{"key":"1851_CR23","unstructured":"PALISADE Development Team (2021) PALISADE Lattice Cryptography Library. Retrieved from https:\/\/palisade-crypto.org\/"},{"key":"1851_CR24","unstructured":"Chillotti I, Gama N, Georgieva M, Izabach\u00e8ne M (August 2016) TFHE: Fast Fully Homomorphic Encryption Library. https:\/\/tfhe.github.io\/tfhe\/"},{"key":"1851_CR25","unstructured":"Lattigo v5 (2023) Online: https:\/\/github.com\/tuneinsight\/lattigo. EPFL-LDS, Tune Insight SA"},{"issue":"13","key":"1851_CR26","doi-asserted-by":"publisher","first-page":"15098","DOI":"10.1007\/s11227-023-05233-z","volume":"79","author":"TVT Doan","year":"2023","unstructured":"Doan TVT, Messai M-L, Gavin G, Darmont J (2023) A survey on implementations of homomorphic encryption schemes. J Supercomput 79(13):15098\u201315139","journal-title":"J Supercomput"},{"key":"1851_CR27","doi-asserted-by":"crossref","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, pp. 75\u201392. Springer","DOI":"10.1007\/978-3-642-40041-4_5"},{"key":"1851_CR28","volume-title":"Quantum computation and quantum information","author":"MA Nielsen","year":"2010","unstructured":"Nielsen MA, Chuang IL (2010) Quantum computation and quantum information. Cambridge University Press, Cambridge"},{"key":"1851_CR29","doi-asserted-by":"publisher","first-page":"79","DOI":"10.22331\/q-2018-08-06-79","volume":"2","author":"J Preskill","year":"2018","unstructured":"Preskill J (2018) Quantum computing in the NISQ era and beyond. Quantum 2:79","journal-title":"Quantum"},{"issue":"2","key":"1851_CR30","doi-asserted-by":"publisher","first-page":"865","DOI":"10.1103\/RevModPhys.81.865","volume":"81","author":"R Horodecki","year":"2009","unstructured":"Horodecki R, Horodecki P, Horodecki M, Horodecki K (2009) Quantum entanglement. Rev Mod Phys 81(2):865","journal-title":"Rev Mod Phys"},{"issue":"5","key":"1851_CR31","doi-asserted-by":"publisher","first-page":"3457","DOI":"10.1103\/PhysRevA.52.3457","volume":"52","author":"A Barenco","year":"1995","unstructured":"Barenco A, Bennett CH, Cleve R, DiVincenzo DP, Margolus N, Shor P, Sleator T, Smolin JA, Weinfurter H (1995) Elementary gates for quantum computation. Phys Rev A 52(5):3457","journal-title":"Phys Rev A"},{"issue":"2","key":"1851_CR32","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1137\/S0036144598347011","volume":"41","author":"PW Shor","year":"1999","unstructured":"Shor PW (1999) Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer. SIAM Rev 41(2):303\u2013332","journal-title":"SIAM Rev"},{"key":"1851_CR33","doi-asserted-by":"crossref","unstructured":"Grover LK (1996) A fast quantum mechanical algorithm for database search. In: Proceedings of the Twenty-eighth Annual ACM Symposium on Theory of Computing, pp. 212\u2013219","DOI":"10.1145\/237814.237866"},{"issue":"4","key":"1851_CR34","doi-asserted-by":"publisher","first-page":"2493","DOI":"10.1103\/PhysRevA.52.R2493","volume":"52","author":"PW Shor","year":"1995","unstructured":"Shor PW (1995) Scheme for reducing decoherence in quantum computer memory. Phys Rev A 52(4):2493","journal-title":"Phys Rev A"},{"key":"1851_CR35","doi-asserted-by":"crossref","unstructured":"Broadbent A, Jeffery S (2015) Quantum homomorphic encryption for circuits of low t-gate complexity. In: Annual Cryptology Conference, pp. 609\u2013629. Springer","DOI":"10.1007\/978-3-662-48000-7_30"},{"key":"1851_CR36","doi-asserted-by":"crossref","unstructured":"Liang M, Yang L (2015) Quantum fully homomorphic encryption scheme based on quantum fault-tolerant construction. arXiv preprint arXiv:1503.04061","DOI":"10.1007\/s11128-015-1034-9"},{"key":"1851_CR37","doi-asserted-by":"crossref","unstructured":"Brakerski Z (2018) Quantum FHE (almost) as secure as classical. In: Annual International Cryptology Conference, pp. 67\u201395. Springer","DOI":"10.1007\/978-3-319-96878-0_3"},{"key":"1851_CR38","doi-asserted-by":"crossref","unstructured":"Mahadev U (2020) Classical homomorphic encryption for quantum circuits. SIAM J Comput 52(6):18\u2013189","DOI":"10.1137\/18M1231055"},{"key":"1851_CR39","doi-asserted-by":"crossref","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, pp. 75\u201392. Springer","DOI":"10.1007\/978-3-642-40041-4_5"},{"key":"1851_CR40","doi-asserted-by":"crossref","unstructured":"Brakerski Z, Vaikuntanathan V (2014) Lattice-based FHE as secure as PKE. In: Proceedings of the 5th Conference on Innovations in Theoretical Computer Science, pp. 1\u201312","DOI":"10.1145\/2554797.2554799"},{"key":"1851_CR41","doi-asserted-by":"crossref","unstructured":"Alperin-Sheriff J, Peikert C (2014) Faster bootstrapping with polynomial error. In: Advances in Cryptology\u2013CRYPTO 2014: 34th Annual Cryptology Conference, Santa Barbara, CA, USA, August 17\u201321, 2014, Proceedings, Part I 34, pp. 297\u2013314. Springer","DOI":"10.1007\/978-3-662-44371-2_17"},{"issue":"2","key":"1851_CR42","doi-asserted-by":"publisher","first-page":"831","DOI":"10.1137\/120868669","volume":"43","author":"Z Brakerski","year":"2014","unstructured":"Brakerski Z, Vaikuntanathan V (2014) Efficient fully homomorphic encryption from (standard) LWE. SIAM J Comput 43(2):831\u2013871","journal-title":"SIAM J Comput"},{"key":"1851_CR43","doi-asserted-by":"crossref","unstructured":"Aaronson S, Christiano P (2012) Quantum money from hidden subspaces. In: Proceedings of the Forty-fourth Annual ACM Symposium on Theory of Computing, pp. 41\u201360","DOI":"10.1145\/2213977.2213983"},{"issue":"1","key":"1851_CR44","first-page":"33467","volume":"6","author":"S-H Tan","year":"2016","unstructured":"Tan S-H, Kettlewell JA, Ouyang Y, Chen L, Fitzsimons JF (2016) A quantum approach to homomorphic encryption. Sci Reports 6(1):33467","journal-title":"Sci Reports"},{"issue":"1","key":"1851_CR45","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1038\/s41534-020-00340-8","volume":"7","author":"J Zeuner","year":"2021","unstructured":"Zeuner J, Pitsios I, Tan S-H, Sharma AN, Fitzsimons JF, Osellame R, Walther P (2021) Experimental quantum homomorphic encryption. NPJ Quantum Inf 7(1):25","journal-title":"NPJ Quantum Inf"},{"issue":"3","key":"1851_CR46","doi-asserted-by":"publisher","first-page":"577","DOI":"10.1007\/s10623-021-00993-2","volume":"90","author":"J Liu","year":"2022","unstructured":"Liu J, Li Q, Quan J, Wang C, Shi J, Situ H (2022) Efficient quantum homomorphic encryption scheme with flexible evaluators and its simulation. Designs Codes Cryptogr 90(3):577\u2013591","journal-title":"Designs Codes Cryptogr"},{"key":"1851_CR47","doi-asserted-by":"publisher","unstructured":"Burhanuddin M (2023) Assessing the vulnerability of quantum cryptography systems to emerging cyber threats. SHIFRA 2023, 26\u201333. https:\/\/doi.org\/10.70470\/SHIFRA\/2023\/004","DOI":"10.70470\/SHIFRA\/2023\/004"},{"issue":"8","key":"1851_CR48","doi-asserted-by":"publisher","first-page":"2749","DOI":"10.1007\/s11128-015-1034-9","volume":"14","author":"M Liang","year":"2015","unstructured":"Liang M (2015) Quantum fully homomorphic encryption scheme based on universal quantum circuit. Quantum Inf Process 14(8):2749\u20132759","journal-title":"Quantum Inf Process"},{"key":"1851_CR49","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s11128-021-03051-x","volume":"20","author":"Y Zhang","year":"2021","unstructured":"Zhang Y, Shang T, Liu J (2021) A multi-valued quantum fully homomorphic encryption scheme. Quantum Inf Process 20:1\u201325","journal-title":"Quantum Inf Process"},{"issue":"1","key":"1851_CR50","first-page":"1","volume":"10","author":"WK Tham","year":"2020","unstructured":"Tham WK, Ferretti H, Bonsma-Fisher K, Brodutch A, Sanders BC, Steinberg AM, Jeffery S (2020) Experimental demonstration of quantum fully homomorphic encryption with application in a two-party secure protocol. Phys Rev X 10(1):1\u201325","journal-title":"Phys Rev X"},{"key":"1851_CR51","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1613\/jair.301","volume":"4","author":"LP Kaelbling","year":"1996","unstructured":"Kaelbling LP, Littman ML, Moore AW (1996) Reinforcement learning: a survey. J Artif Intell Res 4:237\u2013285","journal-title":"J Artif Intell Res"},{"issue":"1","key":"1851_CR52","doi-asserted-by":"crossref","first-page":"126","DOI":"10.1162\/089892999563184","volume":"11","author":"RS Sutton","year":"1999","unstructured":"Sutton RS, Barto AG et al (1999) Reinforcement learning. J Cognit Neurosci 11(1):126\u2013134","journal-title":"J Cognit Neurosci"}],"container-title":["Complex & Intelligent Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s40747-025-01851-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s40747-025-01851-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s40747-025-01851-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,17]],"date-time":"2025-05-17T11:22:57Z","timestamp":1747480977000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s40747-025-01851-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,4,23]]},"references-count":52,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2025,6]]}},"alternative-id":["1851"],"URL":"https:\/\/doi.org\/10.1007\/s40747-025-01851-7","relation":{},"ISSN":["2199-4536","2198-6053"],"issn-type":[{"value":"2199-4536","type":"print"},{"value":"2198-6053","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,4,23]]},"assertion":[{"value":"4 October 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 March 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 April 2025","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"264"}}