{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,25]],"date-time":"2025-11-25T02:04:33Z","timestamp":1764036273807,"version":"3.45.0"},"reference-count":145,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2025,11,25]],"date-time":"2025-11-25T00:00:00Z","timestamp":1764028800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2025,11,25]],"date-time":"2025-11-25T00:00:00Z","timestamp":1764028800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100012165","name":"Key Technologies Research and Development Program","doi-asserted-by":"publisher","award":["2023YFB3106501"],"award-info":[{"award-number":["2023YFB3106501"]}],"id":[{"id":"10.13039\/501100012165","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Cybersecurity"],"abstract":"<jats:title>Abstract<\/jats:title>\n                  <jats:p>Fully homomorphic encryption (FHE) has emerged as a prominent area of cryptographic research in recent years, offering the capability to perform computations on ciphertext without compromising data privacy. Among various FHE schemes, the Cheon\u2013Kim\u2013Kim\u2013Song (CKKS) algorithm for approximate homomorphic encryption has gained prominence due to its efficient handling of floating-point operations. Bootstrapping, a critical technique that enables unlimited homomorphic operations by refreshing noisy ciphertexts, represents both the most complex and essential component of practical FHE implementations. This survey provides a comprehensive analysis of bootstrapping techniques in CKKS, examining their evolution from the original proposal to current state-of-the-art methods. Recent literature has witnessed a proliferation of novel bootstrapping schemes for CKKS, these diverse approaches often emphasize different performance aspects, leading to a lack of a unified quantitative framework for comparative analysis. To address this gap, we systematically categorize existing approaches into three main directions: optimization of homomorphic modular reduction, optimization of encoding\/decoding operations, and development of alternative constructions using blind rotation techniques. Through detailed comparative analysis, we identify that current schemes can achieve either high throughput (processing over 1000 ciphertexts per second) or high precision (up to 400 bits), but exhibit limitations in concurrent optimization of both parameters. Furthermore, potential directions for future optimizations are explored and discussed, contributing to the ongoing development of efficient and practical FHE systems.<\/jats:p>","DOI":"10.1186\/s42400-025-00384-3","type":"journal-article","created":{"date-parts":[[2025,11,25]],"date-time":"2025-11-25T02:01:43Z","timestamp":1764036103000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Bootstrapping in approximate fully homomorphic encryption: a research survey"],"prefix":"10.1186","volume":"8","author":[{"given":"Huajie","family":"Shen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Qian","family":"Xu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bo","family":"Yu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yuhan","family":"Yang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2628-8028","authenticated-orcid":false,"given":"Wei","family":"He","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,11,25]]},"reference":[{"issue":"4","key":"384_CR1","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 et al (2018) A survey on homomorphic encryption schemes: theory and implementation. ACM Comput Surv (CSur) 51(4):1\u201335","journal-title":"ACM Comput Surv (CSur)"},{"key":"384_CR2","doi-asserted-by":"publisher","unstructured":"Al\u00a0Badawi A, Bates J, Bergamaschi F, et\u00a0al (2022) Openfhe: open-source fully homomorphic encryption library. In: Proceedings of the 10th workshop on encrypted computing & applied homomorphic cryptography. Association for Computing Machinery, New York, NY, USA, WAHC\u201922, pp 53\u201363. https:\/\/doi.org\/10.1145\/3560827.3563379","DOI":"10.1145\/3560827.3563379"},{"issue":"2","key":"384_CR3","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1109\/MSEC.2018.2888775","volume":"17","author":"M Al-Rubaie","year":"2019","unstructured":"Al-Rubaie M, Chang JM (2019) Privacy-preserving machine learning: threats and solutions. IEEE Secur Privacy 17(2):49\u201358","journal-title":"IEEE Secur Privacy"},{"key":"384_CR4","doi-asserted-by":"publisher","DOI":"10.1016\/j.cosrev.2020.100235","volume":"36","author":"B Alaya","year":"2020","unstructured":"Alaya B, Laouamer L, Msilini N (2020) Homomorphic encryption systems statement: trends and challenges. Comput Sci Rev 36:100235","journal-title":"Comput Sci Rev"},{"key":"384_CR5","unstructured":"Albrecht M, Chase M, Chen H, et\u00a0al (2018) Homomorphic encryption security standard. Tech. rep., HomomorphicEncryption.org, Toronto, Canada"},{"key":"384_CR6","unstructured":"Albrecht MR (2022) Security estimates for lattice problems. https:\/\/github.com\/malb\/lattice-estimator"},{"key":"384_CR7","doi-asserted-by":"crossref","unstructured":"Alexandru A, Kim A, Polyakov Y (2024) General functional bootstrapping using ckks. Cryptology ePrint Archive","DOI":"10.1007\/978-3-032-01881-6_10"},{"key":"384_CR8","doi-asserted-by":"crossref","unstructured":"Alharbi A, Zamzami H, Samkri E (2020) Survey on homomorphic encryption and address of new trend. Int J Adv Comput Sci Appl 11(7)","DOI":"10.14569\/IJACSA.2020.0110774"},{"key":"384_CR9","unstructured":"Alibaba (2024) mpc4j: a java library for secure multi-party computation. https:\/\/github.com\/alibaba-edu\/mpc4j. Accessed 06 Jan 2025"},{"key":"384_CR10","doi-asserted-by":"crossref","unstructured":"Alperin-Sheriff J, Peikert C (2014a) Faster bootstrapping with polynomial error. In: Advances in cryptology\u2013CRYPTO 2014: 34th annual cryptology conference, Santa Barbara, CA, USA, 17\u201321 Aug 2014, Proceedings, Part I 34. Springer, pp 297\u2013314","DOI":"10.1007\/978-3-662-44371-2_17"},{"key":"384_CR11","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1007\/978-3-662-44371-2_17","volume-title":"Faster bootstrapping with polynomial error","author":"J Alperin-Sheriff","year":"2014","unstructured":"Alperin-Sheriff J, Peikert C (2014) Faster bootstrapping with polynomial error. Springer, Berlin, pp 297\u2013314. https:\/\/doi.org\/10.1007\/978-3-662-44371-2_17"},{"key":"384_CR12","doi-asserted-by":"crossref","unstructured":"Angel S, Chen H, Laine K, et\u00a0al (2018) Pir with compressed queries and amortized query processing. In: 2018 IEEE symposium on security and privacy (SP). IEEE, pp 962\u2013979","DOI":"10.1109\/SP.2018.00062"},{"key":"384_CR13","doi-asserted-by":"crossref","unstructured":"Atallah MJ, Frikken KB (2010) Securely outsourcing linear algebra computations. In: Proceedings of the 5th ACM symposium on information, computer and communications security, pp 48\u201359","DOI":"10.1145\/1755688.1755695"},{"key":"384_CR14","doi-asserted-by":"crossref","unstructured":"Backes M, Fiore D, Reischuk RM (2013) Verifiable delegation of computation on outsourced data. In: Proceedings of the 2013 ACM SIGSAC conference on computer & communications security, pp 863\u2013874","DOI":"10.1145\/2508859.2516681"},{"key":"384_CR15","doi-asserted-by":"publisher","unstructured":"Bae Y, Cheon JH, Cho W, et\u00a0al (2022) Meta-bts: bootstrapping precision beyond the limit. In: Proceedings of the 2022 ACM SIGSAC conference on computer and communications security, CCS\u201922. ACM. https:\/\/doi.org\/10.1145\/3548606.3560696,","DOI":"10.1145\/3548606.3560696"},{"key":"384_CR16","doi-asserted-by":"publisher","first-page":"94","DOI":"10.1007\/978-3-031-58723-8_4","volume-title":"Bootstrapping bits with CKKS","author":"Y Bae","year":"2024","unstructured":"Bae Y, Cheon JH, Kim J et al (2024) Bootstrapping bits with CKKS. Springer, Cham, pp 94\u2013123. https:\/\/doi.org\/10.1007\/978-3-031-58723-8_4"},{"key":"384_CR17","doi-asserted-by":"publisher","first-page":"94","DOI":"10.1007\/978-3-031-58723-8_4","volume-title":"Bootstrapping bits with CKKS","author":"Y Bae","year":"2024","unstructured":"Bae Y, Cheon JH, Kim J et al (2024) Bootstrapping bits with CKKS. Springer, Cham, pp 94\u2013123. https:\/\/doi.org\/10.1007\/978-3-031-58723-8_4"},{"key":"384_CR18","doi-asserted-by":"crossref","unstructured":"Bethencourt J, Sahai A, Waters B (2007) Ciphertext-policy attribute-based encryption. In: 2007 IEEE symposium on security and privacy (SP\u201907). IEEE, pp 321\u2013334","DOI":"10.1109\/SP.2007.11"},{"key":"384_CR19","doi-asserted-by":"crossref","unstructured":"Bhardwaj D, Saravanan S, Chandran N, et\u00a0al (2024) Securely training decision trees efficiently. Cryptology ePrint Archive","DOI":"10.1145\/3658644.3670268"},{"key":"384_CR20","doi-asserted-by":"crossref","unstructured":"Bian S, Zhang Z, Pan H, et\u00a0al (2023) He3db: an efficient and elastic encrypted database via arithmetic-and-logic fully homomorphic encryption. In: Proceedings of the 2023 ACM SIGSAC conference on computer and communications security, pp 2930\u20132944","DOI":"10.1145\/3576915.3616608"},{"key":"384_CR21","doi-asserted-by":"crossref","unstructured":"Bois A, Cascudo I, Fiore D, et\u00a0al (2021) Flexible and efficient verifiable computation on encrypted data. In: IACR international conference on public-key cryptography. Springer, pp 528\u2013558","DOI":"10.1007\/978-3-030-75248-4_19"},{"key":"384_CR22","doi-asserted-by":"crossref","unstructured":"Boneh D, Franklin M (2001) Identity-based encryption from the Weil pairing. In: Annual international cryptology conference. Springer, pp 213\u2013229","DOI":"10.1007\/3-540-44647-8_13"},{"key":"384_CR23","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1007\/978-3-540-30576-7_18","volume-title":"Evaluating 2-DNF formulas on ciphertexts","author":"D Boneh","year":"2005","unstructured":"Boneh D, Goh EJ, Nissim K (2005) Evaluating 2-DNF formulas on ciphertexts. Springer, Berlin, pp 325\u2013341. https:\/\/doi.org\/10.1007\/978-3-540-30576-7_18"},{"key":"384_CR24","doi-asserted-by":"publisher","first-page":"587","DOI":"10.1007\/978-3-030-77870-5_21","volume-title":"Efficient bootstrapping for approximate homomorphic encryption with non-sparse keys","author":"JP Bossuat","year":"2021","unstructured":"Bossuat JP, Mouchet C, Troncoso-Pastoriza J et al (2021) Efficient bootstrapping for approximate homomorphic encryption with non-sparse keys. Springer, Berlin, pp 587\u2013617. https:\/\/doi.org\/10.1007\/978-3-030-77870-5_21"},{"issue":"1","key":"384_CR25","doi-asserted-by":"publisher","first-page":"316","DOI":"10.1515\/jmc-2019-0026","volume":"14","author":"C Boura","year":"2020","unstructured":"Boura C, Gama N, Georgieva M et al (2020) Chimera: combining ring-LWE-based fully homomorphic encryption schemes. J Math Cryptol 14(1):316\u2013338","journal-title":"J Math Cryptol"},{"key":"384_CR26","doi-asserted-by":"publisher","first-page":"868","DOI":"10.1007\/978-3-642-32009-5_50","volume-title":"Fully homomorphic encryption without modulus switching from classical GapSVP","author":"Z Brakerski","year":"2012","unstructured":"Brakerski Z (2012) Fully homomorphic encryption without modulus switching from classical GapSVP. Springer, Berlin, pp 868\u2013886. https:\/\/doi.org\/10.1007\/978-3-642-32009-5_50"},{"key":"384_CR27","doi-asserted-by":"publisher","unstructured":"Brakerski Z, Vaikuntanathan V (2011) Efficient fully homomorphic encryption from (standard) LWE. In: 2011 IEEE 52nd annual symposium on foundations of computer science. IEEE. https:\/\/doi.org\/10.1109\/focs.2011.12","DOI":"10.1109\/focs.2011.12"},{"issue":"3","key":"384_CR28","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 6(3):1\u201336. https:\/\/doi.org\/10.1145\/2633600","journal-title":"ACM Trans Comput Theory"},{"key":"384_CR29","unstructured":"Brutzkus A, Gilad-Bachrach R, Elisha O (2019) Low latency privacy preserving inference. In: International conference on machine learning, PMLR, pp 812\u2013821"},{"key":"384_CR30","doi-asserted-by":"crossref","unstructured":"Chen C, Zhou J, Wang L, et\u00a0al (2021a) When homomorphic encryption marries secret sharing: secure large-scale sparse logistic regression and applications in risk control. In: Proceedings of the 27th ACM SIGKDD conference on knowledge discovery & data mining, pp 2652\u20132662","DOI":"10.1145\/3447548.3467210"},{"key":"384_CR31","doi-asserted-by":"crossref","unstructured":"Chen H, Laine K, Rindal P (2017) Fast private set intersection from homomorphic encryption. In: Proceedings of the 2017 ACM SIGSAC conference on computer and communications security, pp 1243\u20131255","DOI":"10.1145\/3133956.3134061"},{"key":"384_CR32","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1186\/s12920-018-0397-z","volume":"11","author":"H Chen","year":"2018","unstructured":"Chen H, Gilad-Bachrach R, Han K et al (2018) Logistic regression over encrypted data from fully homomorphic encryption. BMC Med Genomics 11:3\u201312","journal-title":"BMC Med Genomics"},{"key":"384_CR33","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1007\/978-3-030-17656-3_2","volume-title":"Improved bootstrapping for approximate homomorphic encryption","author":"H Chen","year":"2019","unstructured":"Chen H, Chillotti I, Song Y (2019) Improved bootstrapping for approximate homomorphic encryption. Springer, Berlin, pp 34\u201354. https:\/\/doi.org\/10.1007\/978-3-030-17656-3_2"},{"key":"384_CR34","doi-asserted-by":"publisher","first-page":"460","DOI":"10.1007\/978-3-030-78372-3_18","volume-title":"Efficient homomorphic conversion between (ring) LWE ciphertexts","author":"H Chen","year":"2021","unstructured":"Chen H, Dai W, Kim M et al (2021) Efficient homomorphic conversion between (ring) LWE ciphertexts. Springer, Berlin, pp 460\u2013479. https:\/\/doi.org\/10.1007\/978-3-030-78372-3_18"},{"key":"384_CR35","doi-asserted-by":"crossref","unstructured":"Chen J, Feng Y, Liu Y, et\u00a0al (2021c) Non-interactive privacy-preserving Na\u00edve Bayes classifier using homomorphic encryption. In: International conference on security and privacy in new computing environments. Springer, pp 192\u2013203","DOI":"10.1007\/978-3-030-96791-8_14"},{"key":"384_CR36","doi-asserted-by":"publisher","first-page":"409","DOI":"10.1007\/978-3-319-70694-8_15","volume-title":"Homomorphic encryption for arithmetic of approximate numbers","author":"JH Cheon","year":"2017","unstructured":"Cheon JH, Kim A, Kim M et al (2017) Homomorphic encryption for arithmetic of approximate numbers. Springer, Berlin, pp 409\u2013437. https:\/\/doi.org\/10.1007\/978-3-319-70694-8_15"},{"key":"384_CR37","doi-asserted-by":"publisher","first-page":"360","DOI":"10.1007\/978-3-319-78381-9_14","volume-title":"Bootstrapping for approximate homomorphic encryption","author":"JH Cheon","year":"2018","unstructured":"Cheon JH, Han K, Kim A et al (2018) Bootstrapping for approximate homomorphic encryption. Springer, Berlin, pp 360\u2013384. https:\/\/doi.org\/10.1007\/978-3-319-78381-9_14"},{"key":"384_CR38","doi-asserted-by":"crossref","unstructured":"Cheon JH, Kim D, Kim D (2020) Efficient homomorphic comparison methods with optimal complexity. In: Advances in cryptology\u2013ASIACRYPT 2020: 26th international conference on the theory and application of cryptology and information security, Daejeon, South Korea, 7\u201311 Dec 2020, Proceedings, Part II 26. Springer, pp 221\u2013256","DOI":"10.1007\/978-3-030-64834-3_8"},{"key":"384_CR39","doi-asserted-by":"publisher","DOI":"10.1109\/tdsc.2024.3448406","author":"JH Cheon","year":"2024","unstructured":"Cheon JH, Kang M, Kim T et al (2024) Batch inference on deep convolutional neural networks with fully homomorphic encryption using channel-by-channel convolutions. IEEE Trans Depend Secure Comput. https:\/\/doi.org\/10.1109\/tdsc.2024.3448406","journal-title":"IEEE Trans Depend Secure Comput"},{"key":"384_CR40","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-662-53887-6_1","volume-title":"Faster fully homomorphic encryption: bootstrapping in less than 0.1 seconds","author":"I Chillotti","year":"2016","unstructured":"Chillotti I, Gama N, Georgieva M et al (2016) Faster fully homomorphic encryption: bootstrapping in less than 0.1 seconds. Springer, Berlin, pp 3\u201333. https:\/\/doi.org\/10.1007\/978-3-662-53887-6_1"},{"key":"384_CR41","doi-asserted-by":"publisher","first-page":"377","DOI":"10.1007\/978-3-319-70694-8_14","volume-title":"Faster packed homomorphic operations and efficient circuit bootstrapping for TFHE","author":"I Chillotti","year":"2017","unstructured":"Chillotti I, Gama N, Georgieva M et al (2017) Faster packed homomorphic operations and efficient circuit bootstrapping for TFHE. Springer, Berlin, pp 377\u2013408. https:\/\/doi.org\/10.1007\/978-3-319-70694-8_14"},{"issue":"1","key":"384_CR42","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1007\/s00145-019-09319-x","volume":"33","author":"I Chillotti","year":"2019","unstructured":"Chillotti I, Gama N, Georgieva M et al (2019) 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":"384_CR43","doi-asserted-by":"crossref","unstructured":"Chillotti I, Ligier D, Orfila JB, et\u00a0al (2021) Improved programmable bootstrapping with larger precision and efficient arithmetic circuits for TFHE. In: Advances in cryptology\u2014ASIACRYPT 2021: 27th international conference on the theory and application of cryptology and information security, Singapore, 6\u201310 Dec 2021, Proceedings, Part III 27. Springer, pp 670\u2013699","DOI":"10.1007\/978-3-030-92078-4_23"},{"key":"384_CR44","unstructured":"Chou E, Beal J, Levy D, et\u00a0al (2018) Faster cryptonets: leveraging sparsity for real-world encrypted inference. arXiv preprint arXiv:1811.09953"},{"key":"384_CR45","doi-asserted-by":"crossref","unstructured":"Cong K, Moreno RC, da\u00a0Gama MB, et\u00a0al (2021) Labeled psi from homomorphic encryption with reduced computation and communication. In: Proceedings of the 2021 ACM SIGSAC conference on computer and communications security, pp 1135\u20131150","DOI":"10.1145\/3460120.3484760"},{"key":"384_CR46","doi-asserted-by":"publisher","first-page":"322","DOI":"10.1007\/978-3-031-57728-4_11","volume-title":"Faster amortized FHEW bootstrapping using ring automorphisms","author":"G De Micheli","year":"2024","unstructured":"De Micheli G, Kim D, Micciancio D et al (2024) Faster amortized FHEW bootstrapping using ring automorphisms. Springer, Berlin, pp 322\u2013353. https:\/\/doi.org\/10.1007\/978-3-031-57728-4_11"},{"issue":"1","key":"384_CR47","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1007\/s42979-023-02316-9","volume":"5","author":"S Dhiman","year":"2023","unstructured":"Dhiman S, Mahato GK, Chakraborty SK (2023) Homomorphic encryption library, framework, toolkit and accelerator: a review. SN Comput Sci 5(1):24","journal-title":"SN Comput Sci"},{"key":"384_CR48","doi-asserted-by":"publisher","first-page":"617","DOI":"10.1007\/978-3-662-46800-5_24","volume-title":"FHEW: bootstrapping homomorphic encryption in less than a second","author":"L Ducas","year":"2015","unstructured":"Ducas L, Micciancio D (2015) FHEW: bootstrapping homomorphic encryption in less than a second. Springer, Berlin, pp 617\u2013640. https:\/\/doi.org\/10.1007\/978-3-662-46800-5_24"},{"key":"384_CR49","doi-asserted-by":"publisher","first-page":"294","DOI":"10.1007\/978-3-662-49890-3_12","volume-title":"Sanitization of FHE ciphertexts","author":"L Ducas","year":"2016","unstructured":"Ducas L, Stehl\u00e9 D (2016) Sanitization of FHE ciphertexts. Springer, Berlin, pp 294\u2013310. https:\/\/doi.org\/10.1007\/978-3-662-49890-3_12"},{"key":"384_CR50","doi-asserted-by":"publisher","first-page":"10","DOI":"10.1007\/3-540-39568-7_2","volume-title":"A public key cryptosystem and a signature scheme based on discrete logarithms","author":"T ElGamal","year":"2000","unstructured":"ElGamal T (2000) A public key cryptosystem and a signature scheme based on discrete logarithms. Springer, Berlin, pp 10\u201318. https:\/\/doi.org\/10.1007\/3-540-39568-7_2"},{"issue":"3","key":"384_CR51","doi-asserted-by":"publisher","first-page":"349","DOI":"10.1109\/TBIOM.2021.3139866","volume":"4","author":"JJ Engelsma","year":"2022","unstructured":"Engelsma JJ, Jain AK, Boddeti VN (2022) Hers: homomorphically encrypted representation search. IEEE Trans Biomet Behav Identity Sci 4(3):349\u2013360","journal-title":"IEEE Trans Biomet Behav Identity Sci"},{"key":"384_CR52","unstructured":"Fan J, Vercauteren F (2012) Somewhat practical fully homomorphic encryption. Cryptology ePrint Archive"},{"key":"384_CR53","doi-asserted-by":"crossref","unstructured":"Gama N, Izabach\u00e8ne M, Nguyen PQ, et\u00a0al (2016a) Structural lattice reduction: generalized worst-case to average-case reductions and homomorphic cryptosystems. In: Advances in cryptology\u2014EUROCRYPT 2016: 35th annual international conference on the theory and applications of cryptographic techniques, Vienna, Austria, 8\u201312 May 2016, Proceedings, Part II 35. Springer, pp 528\u2013558","DOI":"10.1007\/978-3-662-49896-5_19"},{"key":"384_CR54","doi-asserted-by":"publisher","first-page":"528","DOI":"10.1007\/978-3-662-49896-5_19","volume-title":"Structural lattice reduction: generalized worst-case to average-case reductions and homomorphic cryptosystems","author":"N Gama","year":"2016","unstructured":"Gama N, Izabach\u00e8ne M, Nguyen PQ et al (2016) Structural lattice reduction: generalized worst-case to average-case reductions and homomorphic cryptosystems. Springer, Berlin, pp 528\u2013558. https:\/\/doi.org\/10.1007\/978-3-662-49896-5_19"},{"key":"384_CR55","doi-asserted-by":"publisher","unstructured":"Gentry C (2009) Fully homomorphic encryption using ideal lattices. In: Proceedings of the forty-first annual ACM symposium on theory of computing. ACM, STOC\u201909. https:\/\/doi.org\/10.1145\/1536414.1536440","DOI":"10.1145\/1536414.1536440"},{"key":"384_CR56","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1007\/978-3-642-40041-4_5","volume-title":"Homomorphic encryption from learning with errors: conceptually-simpler, asymptotically-faster, attribute-based","author":"C Gentry","year":"2013","unstructured":"Gentry C, Sahai A, Waters B (2013) Homomorphic encryption from learning with errors: conceptually-simpler, asymptotically-faster, attribute-based. Springer, Berlin, pp 75\u201392. https:\/\/doi.org\/10.1007\/978-3-642-40041-4_5"},{"key":"384_CR57","unstructured":"Gilad-Bachrach R, Dowlin N, Laine K, et\u00a0al (2016) Cryptonets: applying neural networks to encrypted data with high throughput and accuracy. In: International conference on machine learning, PMLR, pp 201\u2013210"},{"key":"384_CR58","doi-asserted-by":"crossref","unstructured":"Goldreich O, Micali S, Wigderson A (2019) How to play any mental game, or a completeness theorem for protocols with honest majority. In: Providing sound foundations for cryptography: on the work of Shafi Goldwasser and Silvio Micali, pp 307\u2013328","DOI":"10.1145\/3335741.3335759"},{"issue":"1","key":"384_CR59","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1186\/s42400-023-00187-4","volume":"7","author":"Y Gong","year":"2024","unstructured":"Gong Y, Chang X, Mi\u0161i\u0107 J et al (2024) Practical solutions in fully homomorphic encryption: a survey analyzing existing acceleration methods. Cybersecurity 7(1):5","journal-title":"Cybersecurity"},{"key":"384_CR60","unstructured":"Group A (2024) Secretflow: a privacy-preserving computing framework. https:\/\/github.com\/secretflow\/secretflow. Accessed 06 Jan 2025"},{"key":"384_CR61","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-981-99-8736-8_1","volume-title":"Amortized bootstrapping revisited: simpler, asymptotically-faster, implemented","author":"A Guimar\u00e3es","year":"2023","unstructured":"Guimar\u00e3es A, Pereira HVL, van Leeuwen B (2023) Amortized bootstrapping revisited: simpler, asymptotically-faster, implemented. Springer, Singapore, pp 3\u201335. https:\/\/doi.org\/10.1007\/978-981-99-8736-8_1"},{"key":"384_CR62","doi-asserted-by":"publisher","first-page":"554","DOI":"10.1007\/978-3-662-44371-2_31","volume-title":"Algorithms in HElib","author":"S Halevi","year":"2014","unstructured":"Halevi S, Shoup V (2014) Algorithms in HElib. Springer, Berlin, pp 554\u2013571. https:\/\/doi.org\/10.1007\/978-3-662-44371-2_31"},{"key":"384_CR63","doi-asserted-by":"publisher","DOI":"10.1007\/s00145-020-09368-7","author":"S Halevi","year":"2021","unstructured":"Halevi S, Shoup V (2021) Bootstrapping for Helib. J Cryptol. https:\/\/doi.org\/10.1007\/s00145-020-09368-7","journal-title":"J Cryptol"},{"key":"384_CR64","unstructured":"Halevi S, Shoup V (2024) Helib. https:\/\/github.com\/homenc\/HElib. Accessed 06 Jan 2025"},{"key":"384_CR65","doi-asserted-by":"publisher","first-page":"364","DOI":"10.1007\/978-3-030-40186-3_16","volume-title":"Better bootstrapping for approximate homomorphic encryption","author":"K Han","year":"2020","unstructured":"Han K, Ki D (2020) Better bootstrapping for approximate homomorphic encryption. Springer, Berlin, pp 364\u2013390. https:\/\/doi.org\/10.1007\/978-3-030-40186-3_16"},{"key":"384_CR66","doi-asserted-by":"crossref","unstructured":"He K, Zhang X, Ren S, et\u00a0al (2016) Identity mappings in deep residual networks. In: Computer vision\u2014ECCV 2016: 14th European conference, Amsterdam, The Netherlands, 11\u201314 Oct 2016, Proceedings, Part IV 14. Springer, pp 630\u2013645","DOI":"10.1007\/978-3-319-46493-0_38"},{"key":"384_CR67","doi-asserted-by":"crossref","unstructured":"Henzinger A, Dauterman E, Corrigan-Gibbs H, et\u00a0al (2023) Private web search with tiptoe. In: Proceedings of the 29th symposium on operating systems principles, pp 396\u2013416","DOI":"10.1145\/3600006.3613134"},{"key":"384_CR68","doi-asserted-by":"publisher","first-page":"4389","DOI":"10.1109\/TIFS.2021.3106167","volume":"16","author":"S Hong","year":"2021","unstructured":"Hong S, Kim S, Choi J et al (2021) Efficient sorting of homomorphic encrypted data with k-way sorting network. IEEE Trans Inf Forensics Secur 16:4389\u20134404","journal-title":"IEEE Trans Inf Forensics Secur"},{"key":"384_CR69","unstructured":"Huang Z, Lu Wj, Hong C, et\u00a0al (2022) Cheetah: lean and fast secure $$\\{$$Two-Party$$\\}$$ deep neural network inference. In: 31st USENIX security symposium (USENIX Security 22), pp 809\u2013826"},{"key":"384_CR70","doi-asserted-by":"crossref","unstructured":"Ibarrondo A, Chabanne H, Despiegel V, et\u00a0al (2023) Grote: group testing for privacy-preserving face identification. In: Proceedings of the 13th ACM conference on data and application security and privacy, pp 117\u2013128","DOI":"10.1145\/3577923.3583656"},{"key":"384_CR71","unstructured":"Inc. C (2024) Heaan: homomorphic encryption for arithmetic of approximate numbers. https:\/\/github.com\/snucrypto\/HEAAN. Accessed 17 Oct 2024"},{"key":"384_CR72","doi-asserted-by":"publisher","unstructured":"Jiang X, Kim M, Lauter K, et\u00a0al (2018a) Secure outsourced matrix computation and application to neural networks. In: Proceedings of the 2018 ACM SIGSAC conference on computer and communications security. ACM, CCS\u201918. https:\/\/doi.org\/10.1145\/3243734.3243837","DOI":"10.1145\/3243734.3243837"},{"key":"384_CR73","doi-asserted-by":"crossref","unstructured":"Jiang X, Kim M, Lauter K, et\u00a0al (2018b) 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"},{"key":"384_CR74","doi-asserted-by":"crossref","unstructured":"Ju JH, Park J, Kim J, et\u00a0al (2023) Neujeans: private neural network inference with joint optimization of convolution and bootstrapping. arXiv preprint arXiv:2312.04356","DOI":"10.1145\/3658644.3690375"},{"key":"384_CR75","unstructured":"Jutla CS, Manohar N (2020) Modular Lagrange interpolation of the mod function for bootstrapping of approximate he. Cryptology ePrint Archive"},{"key":"384_CR76","doi-asserted-by":"publisher","first-page":"491","DOI":"10.1007\/978-3-031-06944-4_17","volume-title":"Sine series approximation of the mod function for bootstrapping of approximate HE","author":"CS Jutla","year":"2022","unstructured":"Jutla CS, Manohar N (2022) Sine series approximation of the mod function for bootstrapping of approximate HE. Springer, Berlin, pp 491\u2013520. https:\/\/doi.org\/10.1007\/978-3-031-06944-4_17"},{"key":"384_CR77","unstructured":"Kales D, Rechberger C, Schneider T, et\u00a0al (2019) Mobile private contact discovery at scale. In: 28th USENIX security symposium (USENIX Security 19), pp 1447\u20131464"},{"key":"384_CR78","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1186\/s12920-018-0401-7","volume":"11","author":"A Kim","year":"2018","unstructured":"Kim A, Song Y, Kim M et al (2018) Logistic regression model training based on the approximate homomorphic encryption. BMC Med Genomics 11:23\u201331","journal-title":"BMC Med Genomics"},{"issue":"1","key":"384_CR79","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1109\/tc.2023.3318405","volume":"73","author":"A Kim","year":"2024","unstructured":"Kim A, Deryabin M, Eom J et al (2024) General bootstrapping approach for RLWE-based homomorphic encryption. IEEE Trans Comput 73(1):86\u201396. https:\/\/doi.org\/10.1109\/tc.2023.3318405","journal-title":"IEEE Trans Comput"},{"key":"384_CR80","doi-asserted-by":"publisher","first-page":"2175","DOI":"10.1109\/tifs.2023.3263631","volume":"18","author":"D Kim","year":"2023","unstructured":"Kim D, Guyot C (2023) Optimized privacy-preserving CNN inference with fully homomorphic encryption. IEEE Trans Inf Forensics Secur 18:2175\u20132187. https:\/\/doi.org\/10.1109\/tifs.2023.3263631","journal-title":"IEEE Trans Inf Forensics Secur"},{"key":"384_CR81","doi-asserted-by":"crossref","unstructured":"Kim J, Seo J, Song Y (2024b) Simpler and faster BFV bootstrapping for arbitrary plaintext modulus from CKKS. Cryptology ePrint Archive","DOI":"10.1145\/3658644.3670302"},{"key":"384_CR82","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1007\/978-3-031-22966-4_6","volume-title":"EvalRound algorithm in CKKS bootstrapping","author":"S Kim","year":"2022","unstructured":"Kim S, Park M, Kim J et al (2022) EvalRound algorithm in CKKS bootstrapping. Springer, Cham, pp 161\u2013187. https:\/\/doi.org\/10.1007\/978-3-031-22966-4_6"},{"issue":"6","key":"384_CR83","doi-asserted-by":"publisher","first-page":"3711","DOI":"10.1109\/TDSC.2021.3105111","volume":"19","author":"E Lee","year":"2021","unstructured":"Lee E, Lee JW, No JS et al (2021) Minimax approximation of sign function by composite polynomial for homomorphic comparison. IEEE Trans Depend Secure Comput 19(6):3711\u20133727","journal-title":"IEEE Trans Depend Secure Comput"},{"key":"384_CR84","doi-asserted-by":"publisher","first-page":"26163","DOI":"10.1109\/ACCESS.2022.3155882","volume":"10","author":"E Lee","year":"2022","unstructured":"Lee E, Lee JW, Kim YS et al (2022) Optimization of homomorphic comparison algorithm on RNS-CKKS scheme. IEEE Access 10:26163\u201326176","journal-title":"IEEE Access"},{"key":"384_CR85","unstructured":"Lee E, Lee JW, Lee J, et\u00a0al (2022b) Low-complexity deep convolutional neural networks on fully homomorphic encryption using multiplexed parallel convolutions. In: International conference on machine learning, PMLR, pp 12403\u201312422"},{"key":"384_CR86","unstructured":"Lee J, Lee E, Kim YS, et\u00a0al (2023a) Optimizing layerwise polynomial approximation for efficient private inference on fully homomorphic encryption: a dynamic programming approach. arXiv preprint arXiv:2310.10349"},{"key":"384_CR87","doi-asserted-by":"publisher","first-page":"618","DOI":"10.1007\/978-3-030-77870-5_22","volume-title":"High-precision bootstrapping of RNS-CKKS homomorphic encryption using optimal minimax polynomial approximation and inverse sine function","author":"JW Lee","year":"2021","unstructured":"Lee JW, Lee E, Lee Y et al (2021) High-precision bootstrapping of RNS-CKKS homomorphic encryption using optimal minimax polynomial approximation and inverse sine function. Springer, Berlin, pp 618\u2013647. https:\/\/doi.org\/10.1007\/978-3-030-77870-5_22"},{"key":"384_CR88","doi-asserted-by":"publisher","first-page":"30039","DOI":"10.1109\/access.2022.3159694","volume":"10","author":"JW Lee","year":"2022","unstructured":"Lee JW, Kang H, Lee Y et al (2022) Privacy-preserving machine learning with fully homomorphic encryption for deep neural network. IEEE Access 10:30039\u201330054. https:\/\/doi.org\/10.1109\/access.2022.3159694","journal-title":"IEEE Access"},{"key":"384_CR89","doi-asserted-by":"publisher","first-page":"144321","DOI":"10.1109\/access.2020.3014369","volume":"8","author":"Y Lee","year":"2020","unstructured":"Lee Y, Lee JW, Kim YS et al (2020) Near-optimal polynomial for modulus reduction using l2-norm for approximate homomorphic encryption. IEEE Access 8:144321\u2013144330. https:\/\/doi.org\/10.1109\/access.2020.3014369","journal-title":"IEEE Access"},{"key":"384_CR90","doi-asserted-by":"publisher","first-page":"551","DOI":"10.1007\/978-3-031-06944-4_19","volume-title":"High-precision bootstrapping for approximate homomorphic encryption by error variance minimization","author":"Y Lee","year":"2022","unstructured":"Lee Y, Lee JW, Kim YS et al (2022) High-precision bootstrapping for approximate homomorphic encryption by error variance minimization. Springer, Berlin, pp 551\u2013580. https:\/\/doi.org\/10.1007\/978-3-031-06944-4_19"},{"key":"384_CR91","doi-asserted-by":"publisher","first-page":"551","DOI":"10.1007\/978-3-031-06944-4_19","volume-title":"High-precision bootstrapping for approximate homomorphic encryption by error variance minimization","author":"Y Lee","year":"2022","unstructured":"Lee Y, Lee JW, Kim YS et al (2022) High-precision bootstrapping for approximate homomorphic encryption by error variance minimization. Springer, Berlin, pp 551\u2013580. https:\/\/doi.org\/10.1007\/978-3-031-06944-4_19"},{"key":"384_CR92","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1007\/978-3-031-30620-4_8","volume-title":"Efficient FHEW bootstrapping with small evaluation keys, and applications to threshold homomorphic encryption","author":"Y Lee","year":"2023","unstructured":"Lee Y, Micciancio D, Kim A et al (2023) Efficient FHEW bootstrapping with small evaluation keys, and applications to threshold homomorphic encryption. Springer, Berlin, pp 227\u2013256. https:\/\/doi.org\/10.1007\/978-3-031-30620-4_8"},{"key":"384_CR93","doi-asserted-by":"publisher","first-page":"648","DOI":"10.1007\/978-3-030-77870-5_23","volume-title":"On the security of homomorphic encryption on approximate numbers","author":"B Li","year":"2021","unstructured":"Li B, Micciancio D (2021) On the security of homomorphic encryption on approximate numbers. Springer, Berlin, pp 648\u2013677. https:\/\/doi.org\/10.1007\/978-3-030-77870-5_23"},{"key":"384_CR94","doi-asserted-by":"crossref","unstructured":"Lin G, Han W, Ruan W, et\u00a0al (2024) Ents: an efficient three-party training framework for decision trees by communication optimization. arXiv preprint arXiv:2406.07948","DOI":"10.1145\/3658644.3670274"},{"key":"384_CR95","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1007\/978-3-031-30620-4_11","volume-title":"Batch bootstrapping I: a new framework for SIMD bootstrapping in polynomial modulus","author":"FH Liu","year":"2023","unstructured":"Liu FH, Wang H (2023) Batch bootstrapping I: a new framework for SIMD bootstrapping in polynomial modulus. Springer, Cham, pp 321\u2013352. https:\/\/doi.org\/10.1007\/978-3-031-30620-4_11"},{"key":"384_CR96","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1007\/978-3-031-30620-4_12","volume-title":"Batch bootstrapping II: bootstrapping in polynomial modulus only requires $$\\tilde{O}(1)$$ FHE multiplications in amortization","author":"FH Liu","year":"2023","unstructured":"Liu FH, Wang H (2023) Batch bootstrapping II: bootstrapping in polynomial modulus only requires $$\\tilde{O}(1)$$ FHE multiplications in amortization. Springer, Cham, pp 353\u2013384. https:\/\/doi.org\/10.1007\/978-3-031-30620-4_12"},{"key":"384_CR97","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1007\/978-981-99-8736-8_4","volume-title":"Amortized functional bootstrapping in less than 7 ms, with $$\\tilde{O}(1)$$ polynomial multiplications","author":"Z Liu","year":"2023","unstructured":"Liu Z, Wang Y (2023) Amortized functional bootstrapping in less than 7 ms, with $$\\tilde{O}(1)$$ polynomial multiplications. Springer, Singapore, pp 101\u2013132. https:\/\/doi.org\/10.1007\/978-981-99-8736-8_4"},{"key":"384_CR98","doi-asserted-by":"crossref","unstructured":"Liu Z, Micciancio D, Polyakov Y (2022) Large-precision homomorphic sign evaluation using FHEW\/TFHE bootstrapping. In: International conference on the theory and application of cryptology and information security. Springer, Berlin, pp 130\u2013160","DOI":"10.1007\/978-3-031-22966-4_5"},{"key":"384_CR99","unstructured":"Lu Wj, Huang Z, Zhang Q, et\u00a0al (2023) Squirrel: a scalable secure $$\\{$$Two-Party$$\\}$$ computation framework for training gradient boosting decision tree. In: 32nd USENIX security symposium (USENIX Security 23), pp 6435\u20136451"},{"key":"384_CR100","unstructured":"Mahdavi RA, Kerschbaum F (2022) Constant-weight $$\\{$$PIR$$\\}$$: single-round keyword $$\\{$$PIR$$\\}$$ via constant-weight equality operators. In: 31st USENIX security symposium (USENIX Security 22), pp 1723\u20131740"},{"issue":"5","key":"384_CR101","doi-asserted-by":"publisher","first-page":"1687","DOI":"10.1093\/comjnl\/bxad093","volume":"67","author":"A Marandi","year":"2024","unstructured":"Marandi A, Alves PGM, Aranha DF et al (2024) Lattice-based homomorphic encryption for privacy-preserving smart meter data analytics. Comput J 67(5):1687\u20131698","journal-title":"Comput J"},{"issue":"10","key":"384_CR102","doi-asserted-by":"publisher","first-page":"1572","DOI":"10.1109\/JPROC.2022.3205665","volume":"110","author":"C Marcolla","year":"2022","unstructured":"Marcolla C, Sucasas V, Manzano M et al (2022) Survey on fully homomorphic encryption, theory, and applications. Proc IEEE 110(10):1572\u20131609","journal-title":"Proc IEEE"},{"key":"384_CR103","unstructured":"Microsoft (2018) Sealpir: private information retrieval using seal. https:\/\/github.com\/microsoft\/SealPIR. Accessed 06 Jan 2025"},{"key":"384_CR104","unstructured":"Microsoft (2021a) Apsi: C++ library for asymmetric psi. https:\/\/github.com\/microsoft\/APSI. Accessed 06 Jan 2025"},{"key":"384_CR105","unstructured":"Microsoft (2021b) Eva:compiler for the seal homomorphic encryption library. https:\/\/github.com\/microsoft\/EVA. Accessed 06 Jan 2025"},{"key":"384_CR106","unstructured":"Microsoft (2024) Microsoft seal (simple encrypted arithmetic library). https:\/\/github.com\/microsoft\/SEAL. Accessed 06 Jan 2025"},{"key":"384_CR107","doi-asserted-by":"crossref","unstructured":"Mohassel P, Rindal P (2018) Aby3: a mixed protocol framework for machine learning. In: Proceedings of the 2018 ACM SIGSAC conference on computer and communications security, pp 35\u201352","DOI":"10.1145\/3243734.3243760"},{"key":"384_CR108","doi-asserted-by":"crossref","unstructured":"Mohassel P, Zhang Y (2017) Secureml: a system for scalable privacy-preserving machine learning. In: 2017 IEEE symposium on security and privacy (SP). IEEE, pp 19\u201338","DOI":"10.1109\/SP.2017.12"},{"key":"384_CR109","doi-asserted-by":"crossref","unstructured":"Moore C, O\u2019Neill M, O\u2019Sullivan E, et\u00a0al (2014) Practical homomorphic encryption: a survey. In: 2014 IEEE international symposium on circuits and systems (ISCAS). IEEE, pp 2792\u20132795","DOI":"10.1109\/ISCAS.2014.6865753"},{"key":"384_CR110","doi-asserted-by":"crossref","unstructured":"Morrison T, Scheffler S, Pal B, et\u00a0al (2021) Private outsourced translation for medical data. In: Protecting privacy through homomorphic encryption, pp 107\u2013116","DOI":"10.1007\/978-3-030-77287-1_7"},{"key":"384_CR111","unstructured":"Mouchet CV, Bossuat JP, Troncoso-Pastoriza JR, et\u00a0al (2020) Lattigo: a multiparty homomorphic encryption library in go. In: Proceedings of the 8th workshop on encrypted computing and applied homomorphic cryptography, pp 64\u201370"},{"key":"384_CR112","doi-asserted-by":"crossref","unstructured":"Mughees MH, Chen H, Ren L (2021) Onionpir: response efficient single-server PIR. In: Proceedings of the 2021 ACM SIGSAC conference on computer and communications security, pp 2292\u20132306","DOI":"10.1145\/3460120.3485381"},{"key":"384_CR113","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1007\/3-540-48910-x_16","volume-title":"Public-key cryptosystems based on composite degree residuosity classes","author":"P Paillier","year":"1999","unstructured":"Paillier P (1999) Public-key cryptosystems based on composite degree residuosity classes. Springer, Berlin, pp 223\u2013238. https:\/\/doi.org\/10.1007\/3-540-48910-x_16"},{"key":"384_CR114","doi-asserted-by":"crossref","unstructured":"Pereira HVL (2021a) Bootstrapping fully homomorphic encryption over the integers in less than one second. In: Public-key cryptography\u2014PKC 2021: 24th IACR international conference on practice and theory of public key cryptography, virtual event, May 10\u201313, 2021, Proceedings, Part I 24. Springer, pp 331\u2013359","DOI":"10.1007\/978-3-030-75245-3_13"},{"key":"384_CR115","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1007\/978-3-030-75245-3_13","volume-title":"Bootstrapping fully homomorphic encryption over the integers in less than one second","author":"HVL Pereira","year":"2021","unstructured":"Pereira HVL (2021) Bootstrapping fully homomorphic encryption over the integers in less than one second. Springer, Berlin, pp 331\u2013359. https:\/\/doi.org\/10.1007\/978-3-030-75245-3_13"},{"issue":"9","key":"384_CR116","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1145\/2330667.2330691","volume":"55","author":"RA Popa","year":"2012","unstructured":"Popa RA, Redfield CM, Zeldovich N et al (2012) Cryptdb: processing queries on an encrypted database. Commun ACM 55(9):103\u2013111","journal-title":"Commun ACM"},{"key":"384_CR117","unstructured":"Project TP (2024) Palisade lattice cryptography library. https:\/\/gitlab.com\/palisade\/palisade-release. Accessed 06 Jan 2025"},{"key":"384_CR118","doi-asserted-by":"crossref","unstructured":"Pulido-Gaytan LB, Tchernykh A, Cort\u00e9s-Mendoza JM, et\u00a0al (2020) A survey on privacy-preserving machine learning with fully homomorphic encryption. In: Latin American high performance computing conference. Springer, pp 115\u2013129","DOI":"10.1007\/978-3-030-68035-0_9"},{"issue":"4","key":"384_CR119","doi-asserted-by":"publisher","first-page":"601","DOI":"10.14778\/3574245.3574248","volume":"16","author":"X Ren","year":"2022","unstructured":"Ren X, Su L, Gu Z et al (2022) Heda: multi-attribute unbounded aggregation over homomorphically encrypted database. Proc VLDB Endow 16(4):601\u2013614","journal-title":"Proc VLDB Endow"},{"key":"384_CR120","doi-asserted-by":"crossref","unstructured":"Resende ACD, Aranha DF (2018) Faster unbalanced private set intersection. In: Financial cryptography and data security: 22nd international conference, FC 2018, Nieuwpoort, Cura\u00e7ao, February 26\u2013March 2, 2018, Revised Selected Papers 22. Springer, pp 203\u2013221","DOI":"10.1007\/978-3-662-58387-6_11"},{"key":"384_CR121","doi-asserted-by":"crossref","unstructured":"Riazi MS, Weinert C, Tkachenko O, et\u00a0al (2018) Chameleon: a hybrid secure computation framework for machine learning applications. In: Proceedings of the 2018 on Asia conference on computer and communications security, pp 707\u2013721","DOI":"10.1145\/3196494.3196522"},{"issue":"11","key":"384_CR122","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"},{"issue":"1","key":"384_CR123","doi-asserted-by":"publisher","first-page":"96","DOI":"10.1145\/357980.358017","volume":"26","author":"RL Rivest","year":"1983","unstructured":"Rivest RL, Shamir A, Adleman L (1983) A method for obtaining digital signatures and public-key cryptosystems. Commun ACM 26(1):96\u201399. https:\/\/doi.org\/10.1145\/357980.358017","journal-title":"Commun ACM"},{"key":"384_CR124","doi-asserted-by":"crossref","unstructured":"Rouhani BD, Riazi MS, Koushanfar F (2018) Deepsecure: scalable provably-secure deep learning. In: Proceedings of the 55th annual design automation conference, pp 1\u20136","DOI":"10.1145\/3195970.3196023"},{"key":"384_CR125","doi-asserted-by":"publisher","unstructured":"Son Y, Cheon JH (2019) Revisiting the hybrid attack on sparse secret LWE and application to he parameters. In: Proceedings of the 7th ACM workshop on encrypted computing; applied homomorphic cryptography. ACM, CCS\u201919, pp 11\u201320. https:\/\/doi.org\/10.1145\/3338469.3358941","DOI":"10.1145\/3338469.3358941"},{"issue":"6","key":"384_CR126","doi-asserted-by":"publisher","first-page":"2861","DOI":"10.1109\/TDSC.2020.2967740","volume":"18","author":"BHM Tan","year":"2020","unstructured":"Tan BHM, Lee HT, Wang H et al (2020) Efficient private comparison queries over encrypted databases using fully homomorphic encryption with finite fields. IEEE Trans Depend Secure Comput 18(6):2861\u20132874","journal-title":"IEEE Trans Depend Secure Comput"},{"key":"384_CR127","doi-asserted-by":"publisher","first-page":"433","DOI":"10.1016\/j.future.2021.06.050","volume":"125","author":"D Unal","year":"2021","unstructured":"Unal D, Al-Ali A, Catak FO et al (2021) A secure and efficient internet of things cloud encryption scheme with forensics investigation compatibility based on identity-based encryption. Futur Gener Comput Syst 125:433\u2013445","journal-title":"Futur Gener Comput Syst"},{"key":"384_CR128","unstructured":"Vaswani A (2017) Attention is all you need. In: Advances in neural information processing systems"},{"key":"384_CR129","doi-asserted-by":"crossref","unstructured":"Viand A, Jattke P, Hithnawi A (2021) Sok: fully homomorphic encryption compilers. In: 2021 IEEE symposium on security and privacy (SP). IEEE, pp 1092\u20131108","DOI":"10.1109\/SP40001.2021.00068"},{"key":"384_CR130","doi-asserted-by":"crossref","unstructured":"Wang R, Wen Y, Li Z, et\u00a0al (2024) Circuit bootstrapping: faster and smaller. In: Annual international conference on the theory and applications of cryptographic techniques. Springer, pp 342\u2013372","DOI":"10.1007\/978-3-031-58723-8_12"},{"key":"384_CR131","doi-asserted-by":"crossref","unstructured":"Wang X, Tang H, Wang S, et\u00a0al (2018) Idash secure genome analysis competition 2017","DOI":"10.1186\/s12920-018-0396-0"},{"key":"384_CR132","doi-asserted-by":"crossref","unstructured":"Wang Y, Liu J, Luo M, et\u00a0al (2022) Privacy-preserving face recognition in the frequency domain. In: Proceedings of the AAAI conference on artificial intelligence, pp 2558\u20132566","DOI":"10.1609\/aaai.v36i3.20157"},{"issue":"4","key":"384_CR133","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3394658","volume":"53","author":"A Wood","year":"2020","unstructured":"Wood A, Najarian K, Kahrobaei D (2020) Homomorphic encryption for machine learning in medicine and bioinformatics. ACM Comput Surv (CSUR) 53(4):1\u201335","journal-title":"ACM Comput Surv (CSUR)"},{"issue":"4","key":"384_CR134","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3394658","volume":"53","author":"A Wood","year":"2020","unstructured":"Wood A, Najarian K, Kahrobaei D (2020) Homomorphic encryption for machine learning in medicine and bioinformatics. ACM Comput Surv 53(4):1\u201335. https:\/\/doi.org\/10.1145\/3394658","journal-title":"ACM Comput Surv"},{"key":"384_CR135","doi-asserted-by":"crossref","unstructured":"Xiang B, Zhang J, Deng Y, et\u00a0al (2023) Fast blind rotation for bootstrapping FHES. In: Annual international cryptology conference. Springer, pp 3\u201336","DOI":"10.1007\/978-3-031-38551-3_1"},{"issue":"7","key":"384_CR136","doi-asserted-by":"publisher","first-page":"3566","DOI":"10.3390\/s23073566","volume":"23","author":"W Yang","year":"2023","unstructured":"Yang W, Wang S, Cui H et al (2023) A review of homomorphic encryption for privacy-preserving biometrics. Sensors 23(7):3566","journal-title":"Sensors"},{"key":"384_CR137","unstructured":"Yang Z, Xie X, Shen H, et\u00a0al (2021) Tota: fully homomorphic encryption with smaller parameters and stronger security. Cryptology ePrint Archive"},{"key":"384_CR138","unstructured":"Zama (2022a) Concrete ML: a privacy-preserving machine learning library using fully homomorphic encryption for data scientists. https:\/\/github.com\/zama-ai\/concrete-ml"},{"key":"384_CR139","unstructured":"Zama (2022b) TFHE-rs: a pure rust implementation of the TFHE scheme for Boolean and integer arithmetics over encrypted data. https:\/\/github.com\/zama-ai\/tfhe-rs. Accessed 06 Jan 2025"},{"key":"384_CR140","unstructured":"Zama (2024) Confidential EVM smart contracts using fully homomorphic encryption. https:\/\/github.com\/zama-ai\/fhevm"},{"issue":"12","key":"384_CR141","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3676955","volume":"56","author":"J Zhang","year":"2024","unstructured":"Zhang J, Cheng X, Yang L et al (2024) Sok: fully homomorphic encryption accelerators. ACM Comput Surv 56(12):1\u201332","journal-title":"ACM Comput Surv"},{"key":"384_CR142","doi-asserted-by":"crossref","unstructured":"Zhang J, Yang X, He L, et\u00a0al (2024b) Secure transformer inference made non-interactive. Cryptology ePrint Archive","DOI":"10.14722\/ndss.2025.230868"},{"issue":"3","key":"384_CR143","first-page":"2348","volume":"20","author":"P Zhang","year":"2022","unstructured":"Zhang P, Huang T, Sun X et al (2022) Privacy-preserving and outsourced multi-party k-means clustering based on multi-key fully homomorphic encryption. IEEE Trans Depend Secure Comput 20(3):2348\u20132359","journal-title":"IEEE Trans Depend Secure Comput"},{"key":"384_CR144","doi-asserted-by":"crossref","unstructured":"Zhang Z, Bian S, Zhao Z, et\u00a0al (2024c) Arcedb: an arbitrary-precision encrypted database via (amortized) modular homomorphic encryption. In: Proceedings of the 2024 on ACM SIGSAC conference on computer and communications security, pp 4613\u20134627","DOI":"10.1145\/3658644.3670384"},{"key":"384_CR145","doi-asserted-by":"publisher","first-page":"3637","DOI":"10.1109\/TIFS.2022.3211707","volume":"17","author":"B Zhao","year":"2022","unstructured":"Zhao B, Yuan J, Liu X et al (2022) Soci: a toolkit for secure outsourced computation on integers. IEEE Trans Inf Forensics Secur 17:3637\u20133648","journal-title":"IEEE Trans Inf Forensics Secur"}],"container-title":["Cybersecurity"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1186\/s42400-025-00384-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1186\/s42400-025-00384-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1186\/s42400-025-00384-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,11,25]],"date-time":"2025-11-25T02:01:56Z","timestamp":1764036116000},"score":1,"resource":{"primary":{"URL":"https:\/\/cybersecurity.springeropen.com\/articles\/10.1186\/s42400-025-00384-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,11,25]]},"references-count":145,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2025,12]]}},"alternative-id":["384"],"URL":"https:\/\/doi.org\/10.1186\/s42400-025-00384-3","relation":{},"ISSN":["2523-3246"],"issn-type":[{"value":"2523-3246","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,11,25]]},"assertion":[{"value":"7 November 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 February 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"25 November 2025","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":"Competing interests"}}],"article-number":"87"}}