{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,7]],"date-time":"2026-08-07T19:16:50Z","timestamp":1786130210814,"version":"3.56.0"},"publisher-location":"Cham","reference-count":48,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032018809","type":"print"},{"value":"9783032018816","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2025]]},"DOI":"10.1007\/978-3-032-01881-6_10","type":"book-chapter","created":{"date-parts":[[2025,8,16]],"date-time":"2025-08-16T08:59:34Z","timestamp":1755334774000},"page":"304-337","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":13,"title":["General Functional Bootstrapping Using CKKS"],"prefix":"10.1007","author":[{"given":"Andreea","family":"Alexandru","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Andrey","family":"Kim","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yuriy","family":"Polyakov","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2025,8,17]]},"reference":[{"key":"10_CR1","doi-asserted-by":"publisher","unstructured":"Al Badawi, A., et al.: OpenFHE: Open-source fully homomorphic encryption library. Cryptology ePrint Archive, Paper 2022\/915 (2022). https:\/\/doi.org\/10.1145\/3560827.3563379, https:\/\/eprint.iacr.org\/2022\/915","DOI":"10.1145\/3560827.3563379"},{"key":"10_CR2","unstructured":"Al Badawi, A., Polyakov, Y.: Demystifying bootstrapping in fully homomorphic encryption. Cryptology ePrint Archive, Paper 2023\/149 (2023). https:\/\/eprint.iacr.org\/2023\/149"},{"key":"10_CR3","unstructured":"Alexandru, A., Badawi, A.A., Micciancio, D., Polyakov, Y.: Application-aware approximate homomorphic encryption: configuring FHE for practical use. Cryptology ePrint Archive, Paper 2024\/203 (2024). https:\/\/eprint.iacr.org\/2024\/203"},{"key":"10_CR4","unstructured":"Alexandru, A., Kim, A., Polyakov, Y.: General functional bootstrapping using CKKS. Cryptology ePrint Archive, Paper 2024\/1623 (2024). https:\/\/eprint.iacr.org\/2024\/1623"},{"key":"10_CR5","doi-asserted-by":"publisher","unstructured":"Bae, Y., Cheon, J.H., Kim, J., Park, J.H., Stehl\u00e9, D.: HERMES: efficient ring packing using MLWE ciphertexts and application to transciphering. In: CRYPTO (4). LNCS, vol. 14084, pp. 37\u201369. Springer (2023). https:\/\/doi.org\/10.1007\/978-3-031-38551-3_2","DOI":"10.1007\/978-3-031-38551-3_2"},{"key":"10_CR6","doi-asserted-by":"publisher","unstructured":"Bae, Y., Cheon, J.H., Kim, J., Stehl\u00e9, D.: Bootstrapping bits with CKKS. In: EUROCRYPT (2). LNCS, vol. 14652, pp. 94\u2013123. Springer (2024).https:\/\/doi.org\/10.1007\/978-3-031-58723-8_4","DOI":"10.1007\/978-3-031-58723-8_4"},{"key":"10_CR7","doi-asserted-by":"publisher","unstructured":"Bae, Y., Kim, J., Stehl\u00e9, D., Suvanto, E.: Bootstrapping small integers with CKKS. In: ASIACRYPT (1). LNCS, vol. 15484, pp. 330\u2013360. Springer (2024). https:\/\/doi.org\/10.1007\/978-981-96-0875-1_11","DOI":"10.1007\/978-981-96-0875-1_11"},{"issue":"3","key":"10_CR8","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1007\/S00145-023-09463-5","volume":"36","author":"L Bergerat","year":"2023","unstructured":"Bergerat, L., et al.: Parameter optimization and larger precision for (T)FHE. J. Cryptol. 36(3), 28 (2023). https:\/\/doi.org\/10.1007\/S00145-023-09463-5","journal-title":"J. Cryptol."},{"key":"10_CR9","doi-asserted-by":"publisher","unstructured":"Bossuat, J., Mouchet, C., Troncoso-Pastoriza, J.R., Hubaux, J.: Efficient bootstrapping for approximate homomorphic encryption with non-sparse keys. In: EUROCRYPT (1). LNCS, vol. 12696, pp. 587\u2013617. Springer (2021). https:\/\/doi.org\/10.1007\/978-3-030-77870-5_21","DOI":"10.1007\/978-3-030-77870-5_21"},{"key":"10_CR10","doi-asserted-by":"publisher","unstructured":"Brakerski, Z.: Fully homomorphic encryption without modulus switching from classical gapsvp. In: CRYPTO. LNCS, vol.\u00a07417, pp. 868\u2013886. Springer (2012). https:\/\/doi.org\/10.1007\/978-3-642-32009-5_50","DOI":"10.1007\/978-3-642-32009-5_50"},{"key":"10_CR11","doi-asserted-by":"publisher","unstructured":"Brakerski, Z., Gentry, C., Vaikuntanathan, V.: (leveled) fully homomorphic encryption without bootstrapping. ACM Trans. Comput. Theory 6(3), 13:1\u201313:36 (2014). https:\/\/doi.org\/10.1145\/2633600","DOI":"10.1145\/2633600"},{"key":"10_CR12","doi-asserted-by":"publisher","unstructured":"Carpov, S., Izabach\u00e8ne, M., Mollimard, V.: New techniques for multi-value input homomorphic evaluation and applications. In: CT-RSA. LNCS, vol. 11405, pp. 106\u2013126. Springer (2019). https:\/\/doi.org\/10.1007\/978-3-030-12612-4_6","DOI":"10.1007\/978-3-030-12612-4_6"},{"key":"10_CR13","doi-asserted-by":"publisher","unstructured":"Chen, H., Chillotti, I., Song, Y.: Improved bootstrapping for approximate homomorphic encryption. In: EUROCRYPT (2). LNCS, vol. 11477, pp. 34\u201354. Springer (2019). https:\/\/doi.org\/10.1007\/978-3-030-17656-3_2","DOI":"10.1007\/978-3-030-17656-3_2"},{"key":"10_CR14","doi-asserted-by":"publisher","unstructured":"Cheon, J.H., Han, K., Kim, A., Kim, M., Song, Y.: Bootstrapping for approximate homomorphic encryption. In: EUROCRYPT (1). LNCS, vol. 10820, pp. 360\u2013384. Springer (2018). https:\/\/doi.org\/10.1007\/978-3-319-78381-9_14","DOI":"10.1007\/978-3-319-78381-9_14"},{"key":"10_CR15","doi-asserted-by":"publisher","unstructured":"Cheon, J.H., Kim, A., Kim, M., Song, Y.S.: Homomorphic encryption for arithmetic of approximate numbers. In: ASIACRYPT (1). LNCS, vol. 10624, pp. 409\u2013437. Springer (2017). https:\/\/doi.org\/10.1007\/978-3-319-70694-8_15","DOI":"10.1007\/978-3-319-70694-8_15"},{"key":"10_CR16","doi-asserted-by":"publisher","unstructured":"Cheon, J.H., Kim, D., Kim, D.: Efficient homomorphic comparison methods with optimal complexity. In: ASIACRYPT (2). LNCS, vol. 12492, pp. 221\u2013256. Springer (2020). https:\/\/doi.org\/10.1007\/978-3-030-64834-3_8","DOI":"10.1007\/978-3-030-64834-3_8"},{"key":"10_CR17","doi-asserted-by":"publisher","unstructured":"Cheon, J.H., Kim, D., Kim, D., Lee, H., Lee, K.: Numerical method for comparison on homomorphically encrypted numbers. In: ASIACRYPT (2). LNCS, vol. 11922, pp. 415\u2013445. Springer (2019). https:\/\/doi.org\/10.1007\/978-3-030-34621-8_15","DOI":"10.1007\/978-3-030-34621-8_15"},{"key":"10_CR18","doi-asserted-by":"publisher","unstructured":"Chillotti, I., Gama, N., Georgieva, M., Izabach\u00e8ne, M.: Faster fully homomorphic encryption: bootstrapping in less than 0.1 seconds. In: ASIACRYPT (1). LNCS, vol. 10031, pp. 3\u201333 (2016). https:\/\/doi.org\/10.1007\/978-3-662-53887-6_1","DOI":"10.1007\/978-3-662-53887-6_1"},{"key":"10_CR19","doi-asserted-by":"publisher","unstructured":"Chillotti, I., Joye, M., Paillier, P.: Programmable bootstrapping enables efficient homomorphic inference of deep neural networks. In: CSCML. LNCS, vol. 12716, pp. 1\u201319. Springer (2021). https:\/\/doi.org\/10.1007\/978-3-030-78086-9_1","DOI":"10.1007\/978-3-030-78086-9_1"},{"key":"10_CR20","doi-asserted-by":"publisher","unstructured":"Chillotti, I., Ligier, D., Orfila, J., Tap, S.: Improved programmable bootstrapping with larger precision and efficient arithmetic circuits for TFHE. In: ASIACRYPT (3). LNCS, vol. 13092, pp. 670\u2013699. Springer (2021). https:\/\/doi.org\/10.1007\/978-3-030-92078-4_23","DOI":"10.1007\/978-3-030-92078-4_23"},{"key":"10_CR21","unstructured":"Chung, H., Kim, H., Kim, Y.S., Lee, Y.: Amortized large look-up table evaluation with multivariate polynomials for homomorphic encryption. Cryptology ePrint Archive, Paper 2024\/274 (2024). https:\/\/eprint.iacr.org\/2024\/274"},{"key":"10_CR22","doi-asserted-by":"publisher","unstructured":"Curtis, B.R., Player, R.: On the feasibility and impact of standardising sparse-secret LWE parameter sets for homomorphic encryption. In: WAHC@CCS, pp. 1\u201310. ACM (2019). https:\/\/doi.org\/10.1145\/3338469.3358940","DOI":"10.1145\/3338469.3358940"},{"issue":"1","key":"10_CR23","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/S00145-023-09483-1","volume":"37","author":"N Drucker","year":"2024","unstructured":"Drucker, N., Moshkowich, G., Pelleg, T., Shaul, H.: BLEACH: cleaning errors in discrete computations over CKKS. J. Cryptol. 37(1), 3 (2024). https:\/\/doi.org\/10.1007\/S00145-023-09483-1","journal-title":"J. Cryptol."},{"key":"10_CR24","doi-asserted-by":"publisher","unstructured":"Ducas, L., Micciancio, D.: FHEW: bootstrapping homomorphic encryption in less than a second. In: EUROCRYPT (1). LNCS, vol.\u00a09056, pp. 617\u2013640. Springer (2015). https:\/\/doi.org\/10.1007\/978-3-662-46800-5_24","DOI":"10.1007\/978-3-662-46800-5_24"},{"key":"10_CR25","unstructured":"Fan, J., Vercauteren, F.: Somewhat practical fully homomorphic encryption. Cryptology ePrint Archive, Paper 2012\/144 (2012). https:\/\/eprint.iacr.org\/2012\/144"},{"issue":"2","key":"10_CR26","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1007\/S00145-023-09454-6","volume":"36","author":"R Geelen","year":"2023","unstructured":"Geelen, R., Vercauteren, F.: Bootstrapping for BGV and BFV revisited. J. Cryptol. 36(2), 12 (2023). https:\/\/doi.org\/10.1007\/S00145-023-09454-6","journal-title":"J. Cryptol."},{"key":"10_CR27","unstructured":"Gentry, C.: A fully homomorphic encryption scheme. Ph.D. thesis, Stanford University (2009). https:\/\/crypto.stanford.edu\/craig\/craig-thesis.pdf"},{"key":"10_CR28","doi-asserted-by":"publisher","unstructured":"Gentry, C.: Fully homomorphic encryption using ideal lattices. In: STOC, pp. 169\u2013178. ACM (2009). https:\/\/doi.org\/10.1145\/1536414.1536440","DOI":"10.1145\/1536414.1536440"},{"key":"10_CR29","doi-asserted-by":"publisher","unstructured":"Guimar\u00e3es, A., Borin, E., Aranha, D.F.: Revisiting the functional bootstrap in TFHE. IACR Trans. Cryptogr. Hardw. Embed. Syst. 2021(2), 229\u2013253 (2021). https:\/\/doi.org\/10.46586\/tches.v2021.i2.229-253","DOI":"10.46586\/tches.v2021.i2.229-253"},{"key":"10_CR30","doi-asserted-by":"publisher","unstructured":"Han, K., Ki, D.: Better bootstrapping for approximate homomorphic encryption. In: CT-RSA. LNCS, vol. 12006, pp. 364\u2013390. Springer (2020). https:\/\/doi.org\/10.1007\/978-3-030-40186-3_16","DOI":"10.1007\/978-3-030-40186-3_16"},{"key":"10_CR31","doi-asserted-by":"publisher","unstructured":"Kim, A., Papadimitriou, A., Polyakov, Y.: Approximate homomorphic encryption with reduced approximation error. In: CT-RSA. LNCS, vol. 13161, pp. 120\u2013144. Springer (2022). https:\/\/doi.org\/10.1007\/978-3-030-95312-6_6","DOI":"10.1007\/978-3-030-95312-6_6"},{"key":"10_CR32","unstructured":"Kim, J., Noh, T.: Modular reduction in CKKS. Cryptology ePrint Archive, Paper 2024\/1638 (2024). https:\/\/eprint.iacr.org\/2024\/1638"},{"key":"10_CR33","doi-asserted-by":"publisher","unstructured":"Kluczniak, K., Schild, L.: FDFB: full domain functional bootstrapping towards practical fully homomorphic encryption. IACR Trans. Cryptogr. Hardw. Embed. Syst. 2023(1), 501\u2013537 (2023). https:\/\/doi.org\/10.46586\/tches.v2023.i1.501-537","DOI":"10.46586\/tches.v2023.i1.501-537"},{"key":"10_CR34","unstructured":"Lee, D., Min, S., Song, Y.: Functional bootstrapping for packed ciphertexts via homomorphic LUT evaluation. Cryptology ePrint Archive, Paper 2024\/181 (2024). https:\/\/eprint.iacr.org\/2024\/181"},{"key":"10_CR35","doi-asserted-by":"publisher","unstructured":"Li, B., Micciancio, D.: On the security of homomorphic encryption on approximate numbers. In: EUROCRYPT (1). LNCS, vol. 12696, pp. 648\u2013677. Springer (2021). https:\/\/doi.org\/10.1007\/978-3-030-77870-5_23","DOI":"10.1007\/978-3-030-77870-5_23"},{"key":"10_CR36","doi-asserted-by":"publisher","unstructured":"Liu, Z., Micciancio, D., Polyakov, Y.: Large-precision homomorphic sign evaluation using FHEW\/TFHE bootstrapping. In: ASIACRYPT (2). LNCS, vol. 13792, pp. 130\u2013160. Springer (2022). https:\/\/doi.org\/10.1007\/978-3-031-22966-4_5","DOI":"10.1007\/978-3-031-22966-4_5"},{"key":"10_CR37","doi-asserted-by":"publisher","unstructured":"Liu, Z., Wang, Y.: Amortized functional bootstrapping in less than 7 ms, with \u00f5(1) polynomial multiplications. In: ASIACRYPT (6). LNCS, vol. 14443, pp. 101\u2013132. Springer (2023). https:\/\/doi.org\/10.1007\/978-981-99-8736-8_4","DOI":"10.1007\/978-981-99-8736-8_4"},{"key":"10_CR38","doi-asserted-by":"publisher","unstructured":"Liu, Z., Wang, Y.: Relaxed functional bootstrapping: a new perspective on BGV\/BFV bootstrapping. In: ASIACRYPT (1). LNCS, vol. 15484, pp. 208\u2013240. Springer (2024). https:\/\/doi.org\/10.1007\/978-981-96-0875-1_7","DOI":"10.1007\/978-981-96-0875-1_7"},{"key":"10_CR39","doi-asserted-by":"publisher","unstructured":"Lu, W., Huang, Z., Hong, C., Ma, Y., Qu, H.: PEGASUS: bridging polynomial and non-polynomial evaluations in homomorphic encryption. In: SP, pp. 1057\u20131073. IEEE (2021). https:\/\/doi.org\/10.1109\/SP40001.2021.00043","DOI":"10.1109\/SP40001.2021.00043"},{"issue":"10","key":"10_CR40","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., Bassoli, R., Fitzek, F.H.P., Aaraj, N.: Survey on fully homomorphic encryption, theory, and applications. Proc. IEEE 110(10), 1572\u20131609 (2022). https:\/\/doi.org\/10.1109\/JPROC.2022.3205665","journal-title":"Proc. IEEE"},{"key":"10_CR41","doi-asserted-by":"publisher","unstructured":"Micciancio, D., Polyakov, Y.: Bootstrapping in FHEW-like cryptosystems. In: WAHC@CCS, pp. 17\u201328. WAHC@ACM (2021). https:\/\/doi.org\/10.1145\/3474366.3486924","DOI":"10.1145\/3474366.3486924"},{"issue":"1","key":"10_CR42","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1137\/0202007","volume":"2","author":"M Paterson","year":"1973","unstructured":"Paterson, M., Stockmeyer, L.J.: On the number of nonscalar multiplications necessary to evaluate polynomials. SIAM J. Comput. 2(1), 60\u201366 (1973). https:\/\/doi.org\/10.1137\/0202007","journal-title":"SIAM J. Comput."},{"key":"10_CR43","doi-asserted-by":"publisher","unstructured":"Regev, O.: On lattices, learning with errors, random linear codes, and cryptography. J. ACM 56(6), 34:1\u201334:40 (2009). https:\/\/doi.org\/10.1145\/1568318.1568324","DOI":"10.1145\/1568318.1568324"},{"issue":"2","key":"10_CR44","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1215\/S0012-7094-65-03235-7","volume":"32","author":"A Sharma","year":"1965","unstructured":"Sharma, A., Varma, A.K.: Trigonometric interpolation. Duke Math. J. 32(2), 341\u2013357 (1965). https:\/\/doi.org\/10.1215\/S0012-7094-65-03235-7","journal-title":"Duke Math. J."},{"key":"10_CR45","doi-asserted-by":"publisher","unstructured":"Trama, D., Clet, P., Boudguiga, A., Sirdey, R.: A homomorphic AES evaluation in less than 30 seconds by means of TFHE. In: WAHC@CCS, pp. 79\u201390. ACM (2023). https:\/\/doi.org\/10.1145\/3605759.3625260","DOI":"10.1145\/3605759.3625260"},{"issue":"3","key":"10_CR46","doi-asserted-by":"publisher","first-page":"652","DOI":"10.1016\/0022-247X(69)90018-3","volume":"28","author":"AK Varma","year":"1969","unstructured":"Varma, A.K.: Trigonometric interpolation. J. Math. Analy. Appli. 28(3), 652\u2013659 (1969). https:\/\/doi.org\/10.1016\/0022-247X(69)90018-3","journal-title":"J. Math. Analy. Appli."},{"key":"10_CR47","unstructured":"Zama: TFHE-rs: A Pure Rust Implementation of the TFHE Scheme for Boolean and Integer Arithmetics Over Encrypted Data (2022). https:\/\/github.com\/zama-ai\/tfhe-rs"},{"key":"10_CR48","doi-asserted-by":"publisher","unstructured":"Zygmund, A.: Trigonometric Series. Cambridge Mathematical Library, Cambridge University Press, 3 edn. (2003). https:\/\/doi.org\/10.1017\/CBO9781316036587","DOI":"10.1017\/CBO9781316036587"}],"updated-by":[{"DOI":"10.1007\/978-3-032-01881-6_21","type":"correction","label":"Correction","source":"publisher","updated":{"date-parts":[[2025,8,17]],"date-time":"2025-08-17T00:00:00Z","timestamp":1755388800000}}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 CRYPTO 2025"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-01881-6_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,8,4]],"date-time":"2026-08-04T15:13:26Z","timestamp":1785856406000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-01881-6_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9783032018809","9783032018816"],"references-count":48,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-01881-6_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"17 August 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"17 August 2025","order":2,"name":"change_date","label":"Change Date","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"Correction","order":3,"name":"change_type","label":"Change Type","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"A correction has been published.","order":4,"name":"change_details","label":"Change Details","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CRYPTO","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Annual International Cryptology Conference","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Santa Barbara, CA","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 August 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 August 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"45","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"crypto2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/crypto.iacr.org\/2025\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}