{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,7]],"date-time":"2026-04-07T07:50:01Z","timestamp":1775548201491,"version":"3.50.1"},"reference-count":103,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2026,4,7]],"date-time":"2026-04-07T00:00:00Z","timestamp":1775520000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2026,4,7]],"date-time":"2026-04-07T00:00:00Z","timestamp":1775520000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"name":"National Key Research and Development Program of China","award":["2023YFB4503200"],"award-info":[{"award-number":["2023YFB4503200"]}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["621252208, 62202464"],"award-info":[{"award-number":["621252208, 62202464"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Strategic Priority Research Program of the Chinese Academy of Sciences","award":["XDB0690100"],"award-info":[{"award-number":["XDB0690100"]}]}],"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) enables arbitrary computation on encrypted data without decryption, making it a cornerstone of privacy-preserving outsourcing, such as cloud computing. However, homomorphic operations cause ciphertext noise to grow until decryption fails. The efficient solution is bootstrapping, which refreshes the noise in FHE ciphertexts to sustain arbitrary deep homomorphic evaluation. But in practice, bootstrapping consumes over 50% of total execution time, posing a serious obstacle to FHE adoption. This paper presents a systematic survey of FHE bootstrapping algorithms and their optimizations. We organize existing works into three main paradigms: word-wise bootstrapping for BGV, BFV, and CKKS schemes; bit-wise bootstrapping for FHEW and TFHE schemes; and hybrid bootstrapping, which leverages both word-wise schemes and bit-wise schemes. We analyze the evolution of crucial techniques, highlight latest advances in reducing latency, enhancing parallelism, and controlling noise growth, and compare the advantages and limitations of different schemes. Finally, we discuss emerging research trends.<\/jats:p>","DOI":"10.1186\/s42400-026-00571-w","type":"journal-article","created":{"date-parts":[[2026,4,7]],"date-time":"2026-04-07T06:54:13Z","timestamp":1775544853000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A survey of optimization techniques for bootstrapping algorithms in FHE"],"prefix":"10.1186","volume":"9","author":[{"given":"Tianyu","family":"Li","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhiwei","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3672-6463","authenticated-orcid":false,"given":"Lutan","family":"Zhao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ruida","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Qingyun","family":"Niu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xianhui","family":"Lu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dan","family":"Meng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rui","family":"Hou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2026,4,7]]},"reference":[{"key":"571_CR1","unstructured":"Al\u00a0Badawi A, Polyakov Y (2023) Demystifying bootstrapping in fully homomorphic encryption. Cryptology eprint archive"},{"key":"571_CR2","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":"571_CR3","doi-asserted-by":"crossref","unstructured":"Alperin-Sheriff J, Peikert C (2013) Practical bootstrapping in quasilinear time. In: Annual cryptology conference, pp 1\u201320. Springer","DOI":"10.1007\/978-3-642-40041-4_1"},{"key":"571_CR4","doi-asserted-by":"crossref","unstructured":"Alperin-Sheriff J, Peikert C (2014) Faster bootstrapping with polynomial error. In: Annual cryptology conference, pp 297\u2013314. Springer","DOI":"10.1007\/978-3-662-44371-2_17"},{"key":"571_CR5","doi-asserted-by":"crossref","unstructured":"Anggriane SM, Nasution SM, Azmi F (2016) Advanced e-voting system using paillier homomorphic encryption algorithm. In: 2016 International conference on informatics and computing (ICIC), pp 338\u2013342. IEEE","DOI":"10.1109\/IAC.2016.7905741"},{"key":"571_CR6","doi-asserted-by":"crossref","unstructured":"Badawi AA, Alexandru A, Bates J, Bergamaschi F, Cousins DB, Erabelli S, Genise N, Halevi S, Hunt H, Kim A, Lee Y, Liu Z, Micciancio D, Pascoe C, Polyakov Y, Quah I, RV S, Rohloff K, Saylor J, Suponitsky D, Triplett M, Vaikuntanathan V, Zucca V (2022) OpenFHE: open-source fully homomorphic encryption library. Cryptology ePrint Archive, Paper 2022\/915. https:\/\/eprint.iacr.org\/2022\/915","DOI":"10.1145\/3560827.3563379"},{"key":"571_CR7","doi-asserted-by":"crossref","unstructured":"Bae Y, Cheon JH, Kim J, Park JH, Stehl\u00e9 D (2023) Hermes: efficient ring packing using mlwe ciphertexts and application to transciphering. In: Annual international cryptology conference, pp 37\u201369. Springer","DOI":"10.1007\/978-3-031-38551-3_2"},{"key":"571_CR8","doi-asserted-by":"crossref","unstructured":"Bae Y, Cheon JH, Kim J, Stehl\u00e9 D (2024) Bootstrapping bits with CKKS. In: Annual international conference on the theory and applications of cryptographic techniques, pp 94\u2013123. Springer","DOI":"10.1007\/978-3-031-58723-8_4"},{"key":"571_CR9","doi-asserted-by":"crossref","unstructured":"Bae Y, Kim J, Stehl\u00e9 D, Suvanto E (2024) Bootstrapping small integers with CKKS. In: international conference on the theory and application of cryptology and information security, pp 330\u2013360. Springer","DOI":"10.1007\/978-981-96-0875-1_11"},{"key":"571_CR10","doi-asserted-by":"crossref","unstructured":"Barrington DA (1986) Bounded-width polynomial-size branching programs recognize exactly those languages in NC. In: Proceedings of the eighteenth annual ACM symposium on theory of computing, pp 1\u20135","DOI":"10.1145\/12130.12131"},{"key":"571_CR11","doi-asserted-by":"crossref","unstructured":"Belorgey MG, Carpov S, Gama N, Guasch S, Jetchev D (2024) Revisiting key decomposition techniques for FHE: simpler, faster and more generic. In: International conference on the theory and application of cryptology and information security, pp 176\u2013207. Springer","DOI":"10.1007\/978-981-96-0875-1_6"},{"issue":"3","key":"571_CR12","doi-asserted-by":"publisher","DOI":"10.1007\/s00145-023-09463-5","volume":"36","author":"L Bergerat","year":"2023","unstructured":"Bergerat L, Boudi A, Bourgerie Q, Chillotti I, Ligier D, Orfila J-B, Tap S (2023) Parameter optimization and larger precision for (T) FHE. J Cryptol 36(3):28","journal-title":"J Cryptol"},{"issue":"3","key":"571_CR13","doi-asserted-by":"publisher","first-page":"302","DOI":"10.46586\/tches.v2024.i3.302-341","volume":"2024","author":"N Bon","year":"2024","unstructured":"Bon N, Pointcheval D, Rivain M (2024) Optimized homomorphic evaluation of boolean functions. IACR Trans Cryptogr Hardw Embed Syst 2024(3):302\u2013341","journal-title":"IACR Trans Cryptogr Hardw Embed Syst"},{"key":"571_CR14","doi-asserted-by":"crossref","unstructured":"Boneh D, Goh E-J, Nissim K (2005) Evaluating 2-DNF formulas on ciphertexts. In: Theory of cryptography conference, pp 325\u2013341. Springer","DOI":"10.1007\/978-3-540-30576-7_18"},{"key":"571_CR15","unstructured":"Bonnoron G, Ducas L, Fillinger M (2017) Large FHE gates from tensored homomorphic accumulator. Cryptology ePrint Archive, Paper 2017\/996. https:\/\/eprint.iacr.org\/2017\/996"},{"key":"571_CR16","doi-asserted-by":"crossref","unstructured":"Bossuat J-P, Mouchet C, Troncoso-Pastoriza J, Hubaux J-P (2021) Efficient bootstrapping for approximate homomorphic encryption with non-sparse keys. In: Annual international conference on the theory and applications of cryptographic techniques, pp 587\u2013617. Springer","DOI":"10.1007\/978-3-030-77870-5_21"},{"issue":"1","key":"571_CR17","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, Jetchev D (2020) Chimera: combining ring-lwe-based fully homomorphic encryption schemes. J Math Cryptol 14(1):316\u2013338","journal-title":"J Math Cryptol"},{"key":"571_CR18","doi-asserted-by":"crossref","unstructured":"Bourse F, Minelli M, Minihold M, Paillier P (2018) Fast homomorphic evaluation of deep discretized neural networks. In: Annual international cryptology conference, pp 483\u2013512. Springer","DOI":"10.1007\/978-3-319-96878-0_17"},{"key":"571_CR19","doi-asserted-by":"crossref","unstructured":"Brakerski Z (2012) Fully homomorphic encryption without modulus switching from classical GapSVP. In: Annual cryptology conference, pp 868\u2013886. Springer","DOI":"10.1007\/978-3-642-32009-5_50"},{"issue":"2","key":"571_CR20","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"},{"issue":"3","key":"571_CR21","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":"571_CR22","doi-asserted-by":"crossref","unstructured":"Brakerski Z, Vaikuntanathan V (2011) Fully homomorphic encryption from ring-lwe and security for key dependent messages. In: Annual cryptology conference, pp 505\u2013524. Springer","DOI":"10.1007\/978-3-642-22792-9_29"},{"key":"571_CR23","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":"571_CR24","doi-asserted-by":"crossref","unstructured":"Carpov S, Izabach\u00e8ne M, Mollimard V (2019) New techniques for multi-value input homomorphic evaluation and applications. In: Cryptographers\u2019 track at the RSA conference, pp 106\u2013126. Springer","DOI":"10.1007\/978-3-030-12612-4_6"},{"key":"571_CR25","doi-asserted-by":"crossref","unstructured":"Chen H, Chillotti I, Song Y (2019) Improved bootstrapping for approximate homomorphic encryption. In: Annual international conference on the theory and applications of cryptographic techniques, pp 34\u201354. Springer","DOI":"10.1007\/978-3-030-17656-3_2"},{"key":"571_CR26","doi-asserted-by":"crossref","unstructured":"Chen H, Han K (2018) Homomorphic lower digits removal and improved FHE bootstrapping. In: Annual international conference on the theory and applications of cryptographic techniques, pp 315\u2013337. Springer","DOI":"10.1007\/978-3-319-78381-9_12"},{"key":"571_CR27","doi-asserted-by":"crossref","unstructured":"Cheon JH, Han K, Kim A, Kim M, Song Y (2018) Bootstrapping for approximate homomorphic encryption. In: Annual international conference on the theory and applications of cryptographic techniques, pp 360\u2013384. Springer","DOI":"10.1007\/978-3-319-78381-9_14"},{"key":"571_CR28","doi-asserted-by":"crossref","unstructured":"Cheon JH, Kim A, Kim M, Song Y (2017) Homomorphic encryption for arithmetic of approximate numbers. In: International conference on the theory and application of cryptology and information security, pp 409\u2013437. Springer","DOI":"10.1007\/978-3-319-70694-8_15"},{"key":"571_CR29","unstructured":"Chillotti I (2022) TFHE Deep Dive \u2013 Part I \u2013 Ciphertext types. Zama Blog. https:\/\/www.zama.ai\/post\/tfhe-deep-dive-part-1"},{"issue":"1","key":"571_CR30","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1007\/s00145-019-09319-x","volume":"33","author":"I Chillotti","year":"2020","unstructured":"Chillotti I, Gama N, Georgieva M, Izabach\u00e8ne M (2020) TFHE: fast fully homomorphic encryption over the torus. J Cryptol 33(1):34\u201391","journal-title":"J Cryptol"},{"key":"571_CR31","doi-asserted-by":"crossref","unstructured":"Chillotti I, Gama N, Georgieva M, Izabach\u00e8ne M (2017) Faster packed homomorphic operations and efficient circuit bootstrapping for TFHE. In: International conference on the theory and application of cryptology and information security, pp 377\u2013408. Springer","DOI":"10.1007\/978-3-319-70694-8_14"},{"key":"571_CR32","doi-asserted-by":"crossref","unstructured":"Chillotti I, Joye M, Paillier P (2021) Programmable bootstrapping enables efficient homomorphic inference of deep neural networks. In: International symposium on cyber security cryptography and machine learning, pp 1\u201319. Springer","DOI":"10.1007\/978-3-030-78086-9_1"},{"key":"571_CR33","doi-asserted-by":"crossref","unstructured":"Chillotti I, Ligier D, Orfila J-B, Tap S (2021) Improved programmable bootstrapping with larger precision and efficient arithmetic circuits for TFHE. In: International Conference on the theory and application of cryptology and information security, pp 670\u2013699. Springer","DOI":"10.1007\/978-3-030-92078-4_23"},{"key":"571_CR34","unstructured":"Chung H, Kim H, Kim Y-S, Lee Y (2024) Amortized large look-up table evaluation with multivariate polynomials for homomorphic encryption. Cryptology ePrint Archive"},{"key":"571_CR35","unstructured":"Clet P-E, Zuber M, Boudguiga A, Sirdey R, Gouy-Pailler C (2022) Putting up the Swiss army knife of homomorphic calculations by means of TFHE functional bootstrapping. Cryptology ePrint Archive"},{"issue":"1","key":"571_CR36","doi-asserted-by":"publisher","DOI":"10.1049\/ise2\/7550044","volume":"2025","author":"X Dai","year":"2025","unstructured":"Dai X, Wu W, Feng Y (2025) Multikey fully homomorphic encryption: removing noise flooding in distributed decryption via the smudging lemma on discrete Gaussian distribution. IET Inf Secur 2025(1):7550044. https:\/\/doi.org\/10.1049\/ise2\/7550044","journal-title":"IET Inf Secur"},{"key":"571_CR37","doi-asserted-by":"crossref","unstructured":"De\u00a0Micheli G, Kim D, Micciancio D, Suhl A (2024) Faster amortized FHEW bootstrapping using ring automorphisms. In: IACR international conference on public-key cryptography, pp 322\u2013353. Springer","DOI":"10.1007\/978-3-031-57728-4_11"},{"issue":"1","key":"571_CR38","doi-asserted-by":"publisher","DOI":"10.1007\/s00145-023-09483-1","volume":"37","author":"N Drucker","year":"2024","unstructured":"Drucker N, Moshkowich G, Pelleg T, Shaul H (2024) Bleach: cleaning errors in discrete computations over CKKS. J Cryptol 37(1):3","journal-title":"J Cryptol"},{"key":"571_CR39","doi-asserted-by":"crossref","unstructured":"Ducas L, Micciancio D (2015) FHEW: bootstrapping homomorphic encryption in less than a second. In: Annual international conference on the theory and applications of cryptographic techniques, pp 617\u2013640. Springer","DOI":"10.1007\/978-3-662-46800-5_24"},{"issue":"4","key":"571_CR40","doi-asserted-by":"publisher","DOI":"10.3390\/fi13040094","volume":"13","author":"H Fang","year":"2021","unstructured":"Fang H, Qian Q (2021) Privacy preserving machine learning with homomorphic encryption and federated learning. Future Internet 13(4):94","journal-title":"Future Internet"},{"key":"571_CR41","unstructured":"Fan J, Vercauteren F (2012) Somewhat practical fully homomorphic encryption. Cryptology ePrint Archive"},{"key":"571_CR42","doi-asserted-by":"crossref","unstructured":"Gama N, Izabach\u00e8ne M, Nguyen PQ, Xie X (2016) Structural lattice reduction: generalized worst-case to average-case reductions and homomorphic cryptosystems. In: Annual international conference on the theory and applications of cryptographic techniques, pp 528\u2013558. Springer","DOI":"10.1007\/978-3-662-49896-5_19"},{"issue":"2","key":"571_CR43","doi-asserted-by":"publisher","DOI":"10.1007\/s00145-023-09454-6","volume":"36","author":"R Geelen","year":"2023","unstructured":"Geelen R, Vercauteren F (2023) Bootstrapping for BGV and BFV revisited. J Cryptol 36(2):12","journal-title":"J Cryptol"},{"key":"571_CR44","doi-asserted-by":"crossref","unstructured":"Gentry C (2009) Fully homomorphic encryption using ideal lattices. In: Proceedings of the forty-first annual ACM symposium on theory of computing, pp 169\u2013178","DOI":"10.1145\/1536414.1536440"},{"key":"571_CR45","doi-asserted-by":"crossref","unstructured":"Gentry C, Halevi S (2011) Implementing gentry\u2019s fully-homomorphic encryption scheme. In: Annual international conference on the theory and applications of cryptographic techniques, pp 129\u2013148. Springer","DOI":"10.1007\/978-3-642-20465-4_9"},{"key":"571_CR46","doi-asserted-by":"crossref","unstructured":"Gentry C, Halevi S (2019) Compressible FHE with applications to pir. In: Theory of cryptography conference, pp 438\u2013464. Springer","DOI":"10.1007\/978-3-030-36033-7_17"},{"key":"571_CR47","doi-asserted-by":"crossref","unstructured":"Gentry C, Halevi S, Peikert C, Smart NP (2012) Ring switching in BGV-style homomorphic encryption. In: International conference on security and cryptography for networks, pp 19\u201337. Springer","DOI":"10.1007\/978-3-642-32928-9_2"},{"key":"571_CR48","doi-asserted-by":"crossref","unstructured":"Gentry C, Halevi S, Smart NP (2012) Better bootstrapping in fully homomorphic encryption. In: International workshop on public key cryptography, pp 1\u201316. Springer","DOI":"10.1007\/978-3-642-30057-8_1"},{"key":"571_CR49","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: Annual cryptology conference, pp 75\u201392. Springer","DOI":"10.1007\/978-3-642-40041-4_5"},{"key":"571_CR50","unstructured":"Gilad-Bachrach R, Dowlin N, Laine K, Lauter K, Naehrig M, Wernsing J (2016) Cryptonets: applying neural networks to encrypted data with high throughput and accuracy. In: International conference on machine learning, pp 201\u2013210. PMLR"},{"issue":"3","key":"571_CR51","doi-asserted-by":"publisher","first-page":"577","DOI":"10.1007\/s13389-024-00359-z","volume":"14","author":"A Guimar\u00e3es","year":"2024","unstructured":"Guimar\u00e3es A, Borin E, Aranha DF (2024) Mosfhet: optimized software for FHE over the torus. J Cryptogr Eng 14(3):577\u2013593","journal-title":"J Cryptogr Eng"},{"key":"571_CR52","doi-asserted-by":"crossref","unstructured":"Guimar\u00e3es A, Borin E, Aranha DF (2021) Revisiting the functional bootstrap in TFHE. IACR Trans Cryptogr Hardw Embedd Syst 229\u2013253","DOI":"10.46586\/tches.v2021.i2.229-253"},{"key":"571_CR53","doi-asserted-by":"crossref","unstructured":"Guimar\u00e3es A, Pereira HV (2025) Fast amortized bootstrapping with small keys and polynomial noise overhead. Cryptology ePrint Archive","DOI":"10.1145\/3719027.3765181"},{"key":"571_CR54","doi-asserted-by":"crossref","unstructured":"Guimar\u00e3es A, Pereira HV, Van\u00a0Leeuwen B (2023) Amortized bootstrapping revisited: simpler, asymptotically-faster, implemented. In: International conference on the theory and application of cryptology and information security, pp 3\u201335. Springer","DOI":"10.1007\/978-981-99-8736-8_1"},{"issue":"1","key":"571_CR55","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1007\/s00145-020-09368-7","volume":"34","author":"S Halevi","year":"2021","unstructured":"Halevi S, Shoup V (2021) Bootstrapping for HElib. J Cryptol 34(1):7","journal-title":"J Cryptol"},{"key":"571_CR56","doi-asserted-by":"crossref","unstructured":"Halevi S, Shoup V (2018) Faster homomorphic linear transformations in HElib. In: Annual international cryptology conference, pp 93\u2013120. Springer","DOI":"10.1007\/978-3-319-96884-1_4"},{"key":"571_CR57","doi-asserted-by":"crossref","unstructured":"Han K, Ki D (2020) Better bootstrapping for approximate homomorphic encryption. In: Cryptographers\u2019 track at the RSA conference, pp 364\u2013390. Springer","DOI":"10.1007\/978-3-030-40186-3_16"},{"key":"571_CR58","unstructured":"HomomorphicEncryption.org (2018) Homomorphic Encryption Standard. https:\/\/homomorphicencryption.org\/standard\/. Version 2.0"},{"key":"571_CR59","doi-asserted-by":"crossref","unstructured":"Joye M, Paillier P (2022) Blind rotation in fully homomorphic encryption with extended keys. In: International symposium on cyber security, cryptology, and machine learning, pp 1\u201318. Springer","DOI":"10.1007\/978-3-031-07689-3_1"},{"key":"571_CR60","doi-asserted-by":"crossref","unstructured":"Jutla CS, Manohar N (2022) Sine series approximation of the mod function for bootstrapping of approximate he. In: Annual international conference on the theory and applications of cryptographic techniques, pp 491\u2013520. Springer","DOI":"10.1007\/978-3-031-06944-4_17"},{"key":"571_CR61","doi-asserted-by":"publisher","DOI":"10.46586\/tches.v2025.i4.873-898","author":"J Kim","year":"2025","unstructured":"Kim J (2025) Efficient homomorphic integer computer from CKKS. IACR Trans Cryptogr Hardw Embed Syst. https:\/\/doi.org\/10.46586\/tches.v2025.i4.873-898","journal-title":"IACR Trans Cryptogr Hardw Embed Syst"},{"issue":"Suppl 7","key":"571_CR62","doi-asserted-by":"publisher","DOI":"10.1186\/s12920-020-0724-z","volume":"13","author":"M Kim","year":"2020","unstructured":"Kim M, Song Y, Li B, Micciancio D (2020) Semi-parallel logistic regression for GWAS on encrypted data. BMC Med Genomics 13(Suppl 7):99","journal-title":"BMC Med Genomics"},{"issue":"1","key":"571_CR63","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1109\/TC.2023.3318405","volume":"73","author":"A Kim","year":"2023","unstructured":"Kim A, Deryabin M, Eom J, Choi R, Lee Y, Ghang W, Yoo D (2023) General bootstrapping approach for RLWE-based homomorphic encryption. IEEE Trans Comput 73(1):86\u201396","journal-title":"IEEE Trans Comput"},{"key":"571_CR64","doi-asserted-by":"crossref","unstructured":"Kim M, Lee D, Seo J, Song Y (2023) Accelerating he operations from key decomposition technique. In: Annual international cryptology conference, pp 70\u201392. Springer","DOI":"10.1007\/978-3-031-38551-3_3"},{"key":"571_CR65","doi-asserted-by":"crossref","unstructured":"Kim J, Noh T (2024) Modular reduction in CKKS. Cryptology ePrint Archive","DOI":"10.62056\/aevur-iuc"},{"key":"571_CR66","doi-asserted-by":"crossref","unstructured":"Kluczniak K, Schild L (2021) Fdfb: full domain functional bootstrapping towards practical fully homomorphic encryption. arXiv preprint arXiv:2109.02731","DOI":"10.46586\/tches.v2023.i1.501-537"},{"key":"571_CR67","doi-asserted-by":"crossref","unstructured":"Lee J-W, Lee E, Lee Y, Kim Y-S, No J-S (2021) High-precision bootstrapping of RNS-CKKS homomorphic encryption using optimal minimax polynomial approximation and inverse sine function. In: Annual international conference on the theory and applications of cryptographic techniques, pp 618\u2013647. Springer","DOI":"10.1007\/978-3-030-77870-5_22"},{"key":"571_CR68","doi-asserted-by":"publisher","first-page":"144321","DOI":"10.1109\/ACCESS.2020.3014369","volume":"8","author":"Y Lee","year":"2020","unstructured":"Lee Y, Lee J-W, Kim Y-S, No J-S (2020) Near-optimal polynomial for modulus reduction using l2-norm for approximate homomorphic encryption. IEEE Access 8:144321\u2013144330","journal-title":"IEEE Access"},{"key":"571_CR69","doi-asserted-by":"crossref","unstructured":"Lee Y, Micciancio D, Kim A, Choi R, Deryabin M, Eom J, Yoo D (2023) Efficient FHEW bootstrapping with small evaluation keys, and applications to threshold homomorphic encryption. In: Annual international conference on the theory and applications of cryptographic techniques, pp 227\u2013256. Springer","DOI":"10.1007\/978-3-031-30620-4_8"},{"key":"571_CR70","unstructured":"Lee D, Min S, Song Y (2024) Functional bootstrapping for packed ciphertexts via homomorphic LUT evaluation. Cryptology ePrint Archive"},{"issue":"3","key":"571_CR71","doi-asserted-by":"publisher","first-page":"418","DOI":"10.46586\/tches.v2024.i3.418-451","volume":"2024","author":"Z Li","year":"2024","unstructured":"Li Z, Lu X, Wang Z, Wang R, Liu Y, Zheng Y, Zhao L, Wang K, Hou R (2024) Faster NTRU-based bootstrapping in less than 4 ms. IACR Trans Cryptogr Hardw Embed Syst 2024(3):418\u2013451","journal-title":"IACR Trans Cryptogr Hardw Embed Syst"},{"key":"571_CR72","doi-asserted-by":"crossref","unstructured":"Li B, Micciancio D (2021) On the security of homomorphic encryption on approximate numbers. In: Annual international conference on the theory and applications of cryptographic techniques, pp 648\u2013677. Springer","DOI":"10.1007\/978-3-030-77870-5_23"},{"key":"571_CR73","doi-asserted-by":"crossref","unstructured":"Liu F-H, Wang H (2023) Batch bootstrapping I:-a new framework for SIMD bootstrapping in polynomial modulus. Eurocrpyt","DOI":"10.1007\/978-3-031-30620-4_11"},{"key":"571_CR74","doi-asserted-by":"crossref","unstructured":"Liu F-H, Wang H (2023) Batch bootstrapping II:-bootstrapping in polynomial modulus only requires o$$\\tilde{\\phantom{a}}$$(1) FHE multiplications in amortization. Eurocrpyt","DOI":"10.1007\/978-3-031-30620-4_12"},{"key":"571_CR75","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, pp 130\u2013160. Springer","DOI":"10.1007\/978-3-031-22966-4_5"},{"key":"571_CR76","doi-asserted-by":"crossref","unstructured":"Liu Z, Wang Y (2023) Amortized functional bootstrapping in less than 7 ms, with o$$\\tilde{\\phantom{a}}$$(1) polynomial multiplications. In: International conference on the theory and application of cryptology and information security, pp 101\u2013132. Springer","DOI":"10.1007\/978-981-99-8736-8_4"},{"key":"571_CR77","doi-asserted-by":"crossref","unstructured":"Liu Z, Wang Y (2024) Relaxed functional bootstrapping: a new perspective on BGV\/BFV bootstrapping. In: International conference on the theory and application of cryptology and information security, pp 208\u2013240. Springer","DOI":"10.1007\/978-981-96-0875-1_7"},{"key":"571_CR78","doi-asserted-by":"crossref","unstructured":"Lu W-j, Huang Z, Hong C, Ma Y, Qu H (2021) Pegasus: bridging polynomial and non-polynomial evaluations in homomorphic encryption. In: 2021 IEEE symposium on security and privacy (SP), pp 1057\u20131073. IEEE","DOI":"10.1109\/SP40001.2021.00043"},{"key":"571_CR79","unstructured":"Matsuoka K (2020) TFHEpp: pure C++ implementation of TFHE cryptosystem. https:\/\/github.com\/virtualsecureplatform\/TFHEpp"},{"key":"571_CR80","doi-asserted-by":"crossref","unstructured":"Micciancio D, Polyakov Y (2021) Bootstrapping in FHEW-like cryptosystems. In: Proceedings of the 9th on workshop on encrypted computing & applied homomorphic cryptography, pp 17\u201328","DOI":"10.1145\/3474366.3486924"},{"key":"571_CR81","unstructured":"Miccianco D, Sorrell J (2018) Ring packing and amortized FHEW bootstrapping. In: 45th international colloquium on automata, languages, and programming (ICALP 2018), pp 100\u20131. Schloss Dagstuhl\u2013Leibniz-Zentrum f\u00fcr Informatik"},{"key":"571_CR82","unstructured":"Najjar MA, Huang R-Y, Samaraweera D, Shekhar P (2025) Secure distributed learning for cavs: defending against gradient leakage with leveled homomorphic encryption. arXiv preprint arXiv:2506.07894"},{"key":"571_CR83","doi-asserted-by":"crossref","unstructured":"Nussbaumer H (1980) Fast polynomial transform methods for multidimensional DFTS. In: ICASSP\u201980. IEEE international conference on acoustics, speech, and signal processing, vol. 5, pp 235\u2013237. IEEE","DOI":"10.1109\/ICASSP.1980.1170902"},{"key":"571_CR84","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2025.3561728","author":"Y Ohba","year":"2025","unstructured":"Ohba Y, Sanuki T, Gravel C, Mihara K, Wakasugi A, Adachi K (2025) An NVME-based secure computing platform with FPGA-based TFHE accelerator. IEEE Access. https:\/\/doi.org\/10.1109\/ACCESS.2025.3561728","journal-title":"IEEE Access"},{"key":"571_CR85","doi-asserted-by":"crossref","unstructured":"Paillier P (1999) Public-key cryptosystems based on composite degree residuosity classes. In: International conference on the theory and applications of cryptographic techniques, pp 223\u2013238. Springer","DOI":"10.1007\/3-540-48910-X_16"},{"key":"571_CR86","doi-asserted-by":"crossref","unstructured":"Paiva TB, De\u00a0Micheli G, Hafiz SM, Simplicio\u00a0Jr MA, Yildiz B (2025) Faster amortized bootstrapping using the incomplete NTT for free. Cryptology ePrint Archive","DOI":"10.46586\/tches.v2025.i4.520-543"},{"issue":"11","key":"571_CR87","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 Secur Comput 4(11):169\u2013180","journal-title":"Found Secur Comput"},{"issue":"2","key":"571_CR88","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1145\/359340.359342","volume":"21","author":"RL Rivest","year":"1978","unstructured":"Rivest RL, Shamir A, Adleman L (1978) A method for obtaining digital signatures and public-key cryptosystems. Commun ACM 21(2):120\u2013126","journal-title":"Commun ACM"},{"key":"571_CR89","doi-asserted-by":"crossref","unstructured":"Samardzic N, Sanchez D (2024) Bitpacker: enabling high arithmetic efficiency in fully homomorphic encryption accelerators. In: Proceedings of the 29th ACM international conference on architectural support for programming languages and operating systems, Volume 2, pp 137\u2013150","DOI":"10.1145\/3620665.3640397"},{"key":"571_CR90","unstructured":"SEAL M (2023) Microsoft SEAL. https:\/\/github.com\/microsoft\/SEAL. Microsoft Research, Redmond, WA"},{"issue":"2","key":"571_CR91","doi-asserted-by":"publisher","first-page":"535","DOI":"10.46586\/tches.v2025.i2.535-578","volume":"2025","author":"D Trama","year":"2025","unstructured":"Trama D, Boudguiga A, Clet P-E, Sirdey R, Ye N (2025) Designing a general-purpose 8-bit (t) FHE processor abstraction. IACR Trans Cryptogr Hardw Embed Syst 2025(2):535\u2013578","journal-title":"IACR Trans Cryptogr Hardw Embed Syst"},{"key":"571_CR92","doi-asserted-by":"crossref","unstructured":"Wang R, Ha J, Shen X, Lu X, Chen C, Wang K, Lee J (2024) Refined TFHE leveled homomorphic evaluation and its application. Cryptology ePrint Archive","DOI":"10.1145\/3719027.3744873"},{"key":"571_CR93","doi-asserted-by":"crossref","unstructured":"Wang R, Wei B, Li Z, Lu X, Wang K (2024) TFHE bootstrapping: faster, smaller and time-space trade-offs. In: Australasian conference on information security and privacy, pp 196\u2013216. Springer","DOI":"10.1007\/978-981-97-5025-2_11"},{"key":"571_CR94","doi-asserted-by":"crossref","unstructured":"Wang R, Wen Y, Li Z, Lu X, Wei B, Liu K, Wang K (2024) Circuit bootstrapping: faster and smaller. In: Annual international conference on the theory and applications of cryptographic techniques, pp 342\u2013372. Springer","DOI":"10.1007\/978-3-031-58723-8_12"},{"key":"571_CR95","doi-asserted-by":"crossref","unstructured":"Xiang B, Zhang J, Deng Y, Dai Y, Feng D (2023) Fast blind rotation for bootstrapping FHEs. In: Annual international cryptology conference, pp 3\u201336. Springer","DOI":"10.1007\/978-3-031-38551-3_1"},{"key":"571_CR96","doi-asserted-by":"crossref","unstructured":"Yang Z, J\u00e4rvinen K (2018) The death and rebirth of privacy-preserving wifi fingerprint localization with paillier encryption. In: IEEE INFOCOM 2018-IEEE conference on computer communications, pp 1223\u20131231. IEEE","DOI":"10.1109\/INFOCOM.2018.8486221"},{"key":"571_CR97","unstructured":"Yang Z, Xie X, Shen H, Chen S, Zhou J (2021) TOTA: fully homomorphic encryption with smaller parameters and stronger security. Cryptology ePrint Archive"},{"issue":"5","key":"571_CR98","first-page":"1774","volume":"46","author":"D Yiran","year":"2024","unstructured":"Yiran D, Jiang Z, Binwu X, Yi D (2024) Overview on the research status and development route of fully homomorphic encryption technology. J Electron Inf Technol 46(5):1774\u20131789","journal-title":"J Electron Inf Technol"},{"key":"571_CR99","doi-asserted-by":"crossref","unstructured":"Yoo JS, Hong MY, Heo JW, Lee KH, Yoon JW (2024) Fast private location-based information retrieval over the torus. In: 2024 IEEE international conference on advanced video and signal based surveillance (AVSS), pp 1\u20137. IEEE","DOI":"10.1109\/AVSS61716.2024.10672601"},{"key":"571_CR100","unstructured":"Zama (2022) Concrete ML: a Privacy-preserving machine learning library using fully homomorphic encryption for data scientists. https:\/\/github.com\/zama-ai\/concrete-ml"},{"key":"571_CR101","unstructured":"Zama (2022) 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"},{"key":"571_CR102","doi-asserted-by":"crossref","unstructured":"Zhang X, Fu A, Wang H, Zhou C, Chen Z (2020) A privacy-preserving and verifiable federated learning scheme. In: ICC 2020-2020 IEEE international conference on communications (ICC), pp 1\u20136. IEEE","DOI":"10.1109\/ICC40277.2020.9148628"},{"key":"571_CR103","doi-asserted-by":"publisher","first-page":"49868","DOI":"10.1109\/ACCESS.2018.2867655","volume":"6","author":"T Zhou","year":"2018","unstructured":"Zhou T, Yang X, Liu L, Zhang W, Li N (2018) Faster bootstrapping with multiple addends. IEEE Access 6:49868\u201349876","journal-title":"IEEE Access"}],"container-title":["Cybersecurity"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1186\/s42400-026-00571-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1186\/s42400-026-00571-w","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1186\/s42400-026-00571-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,7]],"date-time":"2026-04-07T06:54:45Z","timestamp":1775544885000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1186\/s42400-026-00571-w"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,4,7]]},"references-count":103,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2026,12]]}},"alternative-id":["571"],"URL":"https:\/\/doi.org\/10.1186\/s42400-026-00571-w","relation":{},"ISSN":["2523-3246"],"issn-type":[{"value":"2523-3246","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,4,7]]},"assertion":[{"value":"20 August 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 March 2026","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 April 2026","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 no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"150"}}