{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,23]],"date-time":"2026-09-23T20:18:53Z","timestamp":1790194733937,"version":"4.1.0"},"publisher-location":"Singapore","reference-count":31,"publisher":"Springer Nature Singapore","isbn-type":[{"value":"9789819551217","type":"print"},{"value":"9789819551224","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,12,8]],"date-time":"2025-12-08T00:00:00Z","timestamp":1765152000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,12,8]],"date-time":"2025-12-08T00:00:00Z","timestamp":1765152000000},"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":[[2026]]},"DOI":"10.1007\/978-981-95-5122-4_1","type":"book-chapter","created":{"date-parts":[[2025,12,7]],"date-time":"2025-12-07T10:28:48Z","timestamp":1765103328000},"page":"3-35","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Bootstrapping (T)FHE Ciphertexts via\u00a0Automorphisms: Closing the\u00a0Gap Between Binary and\u00a0Gaussian Keys"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3410-3134","authenticated-orcid":false,"given":"Olivier","family":"Bernard","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4433-2333","authenticated-orcid":false,"given":"Marc","family":"Joye","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2025,12,8]]},"reference":[{"key":"1_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1007\/978-3-662-44371-2_17","volume-title":"Advances in Cryptology \u2013 CRYPTO 2014","author":"J Alperin-Sheriff","year":"2014","unstructured":"Alperin-Sheriff, J., Peikert, C.: Faster bootstrapping with polynomial error. In: Garay, J.A., Gennaro, R. (eds.) CRYPTO 2014. LNCS, vol. 8616, pp. 297\u2013314. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-662-44371-2_17"},{"key":"1_CR2","doi-asserted-by":"publisher","unstructured":"Belorgey, M.G., Carpov, S., Gama, N., Guasch, S., Jetchev, D.: Revisiting key decomposition techniques for FHE: simpler, faster and more generic. In: Chung, KM., Sasaki, Y. (eds.) ASIACRYPT 2024. LNCS, vol. 15484. Springer, Singapore (2025). https:\/\/doi.org\/10.1007\/978-981-96-0875-1_6","DOI":"10.1007\/978-981-96-0875-1_6"},{"key":"1_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1007\/978-3-319-89339-6_13","volume-title":"Progress in Cryptology \u2013 AFRICACRYPT 2018","author":"G Bonnoron","year":"2018","unstructured":"Bonnoron, G., Ducas, L., Fillinger, M.: Large FHE gates from tensored homomorphic accumulator. In: Joux, A., Nitaj, A., Rachidi, T. (eds.) AFRICACRYPT 2018. LNCS, vol. 10831, pp. 217\u2013251. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-89339-6_13"},{"key":"1_CR4","doi-asserted-by":"publisher","unstructured":"Bonte, C., Iliashenko, I., Park, J., Pereira, H.V.L., Smart, N.P.: FINAL: faster FHE instantiated with NTRU and LWE. In: Agrawal, S., Lin, D. (eds.) ASIACRYPT 2022. LNCS, vol. 13792. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-22966-4_7","DOI":"10.1007\/978-3-031-22966-4_7"},{"key":"1_CR5","unstructured":"Bernard, O., Joye, M.: Approximate CRT-based gadget decomposition and application to TFHE blind rotation. Cryptology ePrint Archive (2024). https:\/\/ia.cr\/2024\/909"},{"key":"1_CR6","unstructured":"Bernard, O., Joye, M.: Bootstrapping (T)FHE ciphertexts via automorphisms: closing the gap between binary and gaussian keys. Cryptology ePrint Archive (2025). https:\/\/ia.cr\/2025\/163"},{"issue":"1","key":"1_CR7","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., Izabach\u00e8ne, M.: TFHE: fast fully homomorphic encryption over the torus. J. Cryptol. 33(1), 34\u201391 (2019). https:\/\/doi.org\/10.1007\/s00145-019-09319-x","journal-title":"J. Cryptol."},{"key":"1_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-030-78086-9_1","volume-title":"Cyber Security Cryptography and Machine Learning","author":"I Chillotti","year":"2021","unstructured":"Chillotti, I., Joye, M., Paillier, P.: Programmable bootstrapping enables efficient homomorphic inference of deep neural networks. In: Dolev, S., Margalit, O., Pinkas, B., Schwarzmann, A. (eds.) CSCML 2021. LNCS, vol. 12716, pp. 1\u201319. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-78086-9_1"},{"issue":"2","key":"1_CR9","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1214\/aoms\/1177729030","volume":"24","author":"DA Darling","year":"1953","unstructured":"Darling, D.A.: On a class of problems related to the random division of an interval. Ann. Math. Stat. 24(2), 239\u2013253 (1953). https:\/\/doi.org\/10.1214\/aoms\/1177729030","journal-title":"Ann. Math. Stat."},{"key":"1_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"617","DOI":"10.1007\/978-3-662-46800-5_24","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2015","author":"L Ducas","year":"2015","unstructured":"Ducas, L., Micciancio, D.: FHEW: bootstrapping homomorphic encryption in less than a second. In: Oswald, E., Fischlin, M. (eds.) EUROCRYPT 2015. LNCS, vol. 9056, pp. 617\u2013640. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-46800-5_24"},{"key":"1_CR11","doi-asserted-by":"publisher","unstructured":"David, H.A., Nagaraja, H.N.: Order Statistics. Wiley Series in Probability and Statistics, 3rd edn. John Wiley & Sons, Inc. (2003). https:\/\/doi.org\/10.1002\/0471722162","DOI":"10.1002\/0471722162"},{"issue":"3","key":"1_CR12","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1145\/1666420.1666444","volume":"53","author":"C Gentry","year":"2010","unstructured":"Gentry, C.: Computing arbitrary functions of encrypted data. Commun. ACM 53(3), 97\u2013105 (2010). https:\/\/doi.org\/10.1145\/1666420.1666444","journal-title":"Commun. ACM"},{"key":"1_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"528","DOI":"10.1007\/978-3-662-49896-5_19","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2016","author":"N Gama","year":"2016","unstructured":"Gama, N., Izabach\u00e8ne, M., Nguyen, P.Q., Xie, X.: Structural lattice reduction: generalized worst-case to average-case reductions and homomorphic cryptosystems. In: Fischlin, M., Coron, J.-S. (eds.) EUROCRYPT 2016. LNCS, vol. 9666, pp. 528\u2013558. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-49896-5_19"},{"key":"1_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1007\/978-3-642-40041-4_5","volume-title":"Advances in Cryptology \u2013 CRYPTO 2013","author":"C Gentry","year":"2013","unstructured":"Gentry, C., Sahai, A., Waters, B.: Homomorphic encryption from learning with errors: conceptually-simpler, asymptotically-faster, attribute-based. In: Canetti, R., Garay, J.A. (eds.) CRYPTO 2013. LNCS, vol. 8042, pp. 75\u201392. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-40041-4_5"},{"key":"1_CR15","doi-asserted-by":"publisher","unstructured":"Joye, M.: SoK: fully homomorphic encryption over the [discretized] torus. IACR Trans. Cryptographic Hardware Embedded Syst. 2022(4), 661\u2013692 (2022). https:\/\/doi.org\/10.46586\/tches.v2022.i4.661-692","DOI":"10.46586\/tches.v2022.i4.661-692"},{"key":"1_CR16","doi-asserted-by":"publisher","unstructured":"Joye, M., Paillier, P.: Blind rotation in fully homomorphic encryption with extended keys. In: Dolev, S., Katz, J., Meisels, A. (eds.) Cyber Security, Cryptology, and Machine Learning. CSCML 2022. LNCS, vol. 13301. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-07689-3_1","DOI":"10.1007\/978-3-031-07689-3_1"},{"key":"1_CR17","doi-asserted-by":"publisher","unstructured":"Joye, M., Walter, M.: Liberating TFHE: programmable bootstrapping with general quotient polynomials. In: Brenner, M., Costache, A., Rohloff, K. (eds.) WAHC 2022: Proceedings of the 10th Workshop on Encrypted Computing & Applied Homomorphic Cryptography, pp. 1\u201311. Association for Computing Machinery, New York (2022). https:\/\/doi.org\/10.1145\/3560827.3563376","DOI":"10.1145\/3560827.3563376"},{"key":"1_CR18","doi-asserted-by":"publisher","unstructured":"Lee, Y.: LMKCDEY revisited: speeding up blind rotation with signed evaluation keys. Mathematics 12(18) (2024). https:\/\/doi.org\/10.3390\/math12182909","DOI":"10.3390\/math12182909"},{"key":"1_CR19","doi-asserted-by":"publisher","unstructured":"Li, Z., et al.: NTRU-based bootstrapping in less than 4 ms. IACR Trans. Cryptographic Hardware Embedded Syst. 2024(3), 418\u2013451 (2024). https:\/\/doi.org\/10.46586\/tches.v2024.i3.418-451","DOI":"10.46586\/tches.v2024.i3.418-451"},{"key":"1_CR20","doi-asserted-by":"publisher","unstructured":"Lee, Y. et al.: Efficient FHEW bootstrapping with small evaluation keys, and applications to threshold homomorphic encryption. In: Hazay, C., Stam, M. (eds.) Advances in Cryptology \u2013 EUROCRYPT 2023. EUROCRYPT 2023. LNCS, vol. 14006. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-30620-4_8","DOI":"10.1007\/978-3-031-30620-4_8"},{"key":"1_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-13190-5_1","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2010","author":"V Lyubashevsky","year":"2010","unstructured":"Lyubashevsky, V., Peikert, C., Regev, O.: On ideal lattices and learning with errors over rings. In: Gilbert, H. (ed.) EUROCRYPT 2010. LNCS, vol. 6110, pp. 1\u201323. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-13190-5_1"},{"issue":"3","key":"1_CR22","doi-asserted-by":"publisher","first-page":"565","DOI":"10.1007\/s10623-014-9938-4","volume":"75","author":"A Langlois","year":"2014","unstructured":"Langlois, A., Stehl\u00e9, D.: Worst-case to average-case reductions for module lattices. Des. Codes Crypt. 75(3), 565\u2013599 (2014). https:\/\/doi.org\/10.1007\/s10623-014-9938-4","journal-title":"Des. Codes Crypt."},{"key":"1_CR23","doi-asserted-by":"publisher","unstructured":"De Micheli, G., Kim, D., Micciancio, D., Suhl, A.: Faster amortized FHEW bootstrapping using ring automorphisms. In: Tang, Q., Teague, V. (eds.) PKC 2024. LNCS, vol. 14604. Springer, Cham (2024). https:\/\/doi.org\/10.1007\/978-3-031-57728-4_11","DOI":"10.1007\/978-3-031-57728-4_11"},{"key":"1_CR24","doi-asserted-by":"publisher","unstructured":"Micciancio, D., Polyakov, Y.: Bootstrapping in FHEW-like cryptosystems. In: Brenner, M., Player, R., Rohloff, K. (eds.) 9th Workshop on Encrypted Computing & Applied Homomorphic Cryptography (WAHC\u00a02021), pp. 17\u201328. ACM Press (2021). https:\/\/doi.org\/10.1145\/3474366.3486924","DOI":"10.1145\/3474366.3486924"},{"key":"1_CR25","unstructured":"Rivest, R.L., Adleman, L., Dertouzos, M.L.: On data banks and privacy homomorphisms. In: DeMillo, R.A., et\u00a0al (eds.) Foundations of Secure Computation, pp. 169\u2013179. Academic Press (1978.) https:\/\/people.csail.mit.edu\/rivest\/pubs.html#RAD78"},{"issue":"6","key":"1_CR26","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1145\/1568318.1568324","volume":"56","author":"O Regev","year":"2009","unstructured":"Regev, O.: On lattices, learning with errors, random linear codes, and cryptography. J. ACM 56(6), 341\u20133440 (2009). https:\/\/doi.org\/10.1145\/1568318.1568324","journal-title":"J. ACM"},{"key":"1_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"617","DOI":"10.1007\/978-3-642-10366-7_36","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2009","author":"D Stehl\u00e9","year":"2009","unstructured":"Stehl\u00e9, D., Steinfeld, R., Tanaka, K., Xagawa, K.: Efficient public key encryption based on ideal lattices. In: Matsui, M. (ed.) ASIACRYPT 2009. LNCS, vol. 5912, pp. 617\u2013635. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-10366-7_36"},{"key":"1_CR28","doi-asserted-by":"publisher","unstructured":"Wang, R. et al.: Circuit bootstrapping: faster and smaller. In: Joye, M., Leander, G. (eds) EUROCRYPT 2024. LNCS, vol. 14652. Springer, Cham (2024). https:\/\/doi.org\/10.1007\/978-3-031-58723-8_12","DOI":"10.1007\/978-3-031-58723-8_12"},{"key":"1_CR29","doi-asserted-by":"publisher","unstructured":"Xiang, B., Zhang, J., Deng, Y., Dai, Y., Feng, D.: Fast blind rotation for bootstrapping FHEs. In: Handschuh, H., Lysyanskaya, A. (eds.) CRYPTO 2023. LNCS, vol 14084. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-38551-3_1","DOI":"10.1007\/978-3-031-38551-3_1"},{"key":"1_CR30","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":"1_CR31","doi-asserted-by":"crossref","unstructured":"Zhang, Q., Wang, M., Cheng, X.: Faster FHEW bootstrapping with adaptive key update. Cryptology ePrint Archive (2025). https:\/\/ia.cr\/2025\/381","DOI":"10.1007\/978-981-95-4434-9_14"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 ASIACRYPT 2025"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-95-5122-4_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,12,7]],"date-time":"2025-12-07T10:28:50Z","timestamp":1765103330000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-95-5122-4_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,12,8]]},"ISBN":["9789819551217","9789819551224"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/978-981-95-5122-4_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,12,8]]},"assertion":[{"value":"8 December 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ASIACRYPT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on the Theory and Application of Cryptology and Information Security","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Melbourne, VIC","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Australia","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":"8 December 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12 December 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"31","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"asiacrypt2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/asiacrypt.iacr.org\/2025\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}