{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,2]],"date-time":"2026-01-02T02:39:05Z","timestamp":1767321545610,"version":"3.48.0"},"publisher-location":"Cham","reference-count":27,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032105356","type":"print"},{"value":"9783032105363","type":"electronic"}],"license":[{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"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-3-032-10536-3_25","type":"book-chapter","created":{"date-parts":[[2026,1,2]],"date-time":"2026-01-02T02:34:10Z","timestamp":1767321250000},"page":"679-699","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Efficient Full Domain Functional Bootstrapping from\u00a0Recursive LUT Decomposition"],"prefix":"10.1007","author":[{"given":"Intak","family":"Hwang","sequence":"first","affiliation":[]},{"given":"Shinwon","family":"Lee","sequence":"additional","affiliation":[]},{"given":"Seonhong","family":"Min","sequence":"additional","affiliation":[]},{"given":"Yongsoo","family":"Song","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2026,1,2]]},"reference":[{"issue":"3","key":"25_CR1","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1007\/S00145-023-09463-5","volume":"36","author":"L Bergerat","year":"2023","unstructured":"Bergerat, L.: 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":"25_CR2","doi-asserted-by":"publisher","unstructured":"Bergerat, L., et al.: New secret keys for enhanced performance in (T)FHE. In: Luo, B., Liao, X., Xu, J., Kirda, E., Lie, D. (eds.) ACM CCS 2024: 31st Conference on Computer and Communications Security. pp. 2547\u20132561. ACM Press, Salt Lake City, UT, USA (October\u00a014\u201318, 2024). https:\/\/doi.org\/10.1145\/3658644.3670376","DOI":"10.1145\/3658644.3670376"},{"key":"25_CR3","doi-asserted-by":"publisher","unstructured":"Bon, N., Pointcheval, D., Rivain, M.: Optimized homomorphic evaluation of Boolean functions. IACR Trans. Cryptogr. Hardw. Embed. Syst. 2024(3), 302\u2013341 (2024). https:\/\/doi.org\/10.46586\/TCHES.V2024.I3.302-341","DOI":"10.46586\/TCHES.V2024.I3.302-341"},{"key":"25_CR4","doi-asserted-by":"crossref","unstructured":"Brakerski, Z.: Fully homomorphic encryption without modulus switching from classical gapsvp. In: Annual cryptology conference, pp. 868\u2013886. Springer (2012)","DOI":"10.1007\/978-3-642-32009-5_50"},{"issue":"3","key":"25_CR5","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.: (Leveled) fully homomorphic encryption without bootstrapping. ACM Trans. Comput. Theory (TOCT) 6(3), 1\u201336 (2014)","journal-title":"ACM Trans. Comput. Theory (TOCT)"},{"key":"25_CR6","doi-asserted-by":"crossref","unstructured":"Carpov, S., Izabach\u00e8ne, M., Mollimard, V.: New techniques for multi-value input homomorphic evaluation and applications. In: Cryptographers\u2019 Track at the RSA Conference, pp. 106\u2013126. Springer (2019)","DOI":"10.1007\/978-3-030-12612-4_6"},{"key":"25_CR7","doi-asserted-by":"crossref","unstructured":"Cheon, J.H., Kim, A., Kim, M., Song, Y.: Homomorphic encryption for arithmetic of approximate numbers. In: Advances in cryptology\u2013ASIACRYPT 2017: 23rd international conference on the theory and applications of cryptology and information security, Hong kong, China, December 3-7, 2017, proceedings, part I 23, pp. 409\u2013437. Springer (2017)","DOI":"10.1007\/978-3-319-70694-8_15"},{"issue":"1","key":"25_CR8","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.: TFHE: fast fully homomorphic encryption over the torus. J. Cryptol. 33(1), 34\u201391 (2020)","journal-title":"J. Cryptol."},{"key":"25_CR9","doi-asserted-by":"crossref","unstructured":"Chillotti, I., Ligier, D., Orfila, J.B., Tap, S.: 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 (2021)","DOI":"10.1007\/978-3-030-92078-4_23"},{"key":"25_CR10","doi-asserted-by":"publisher","unstructured":"Ducas, L., Micciancio, D.: FHEW: bootstrapping homomorphic encryption in less than a second. In: Oswald, E., Fischlin, M. (eds.) Advances in Cryptology \u2013 EUROCRYPT\u00a02015, Part\u00a0I. Lecture Notes in Computer Science, vol.\u00a09056, pp. 617\u2013640. Springer Berlin Heidelberg, Germany, Sofia, Bulgaria (April\u00a026\u201330, 2015). https:\/\/doi.org\/10.1007\/978-3-662-46800-5_24","DOI":"10.1007\/978-3-662-46800-5_24"},{"key":"25_CR11","unstructured":"Fan, J., Vercauteren, F.: Somewhat practical fully homomorphic encryption. Cryptology ePrint Archive (2012)"},{"key":"25_CR12","doi-asserted-by":"publisher","unstructured":"Gentry, C.: Fully homomorphic encryption using ideal lattices. In: Proceedings of the Forty-First Annual ACM Symposium on Theory of Computing, pp. 169\u2013178. STOC \u201909, Association for Computing Machinery, New York, NY, USA (2009). https:\/\/doi.org\/10.1145\/1536414.1536440","DOI":"10.1145\/1536414.1536440"},{"key":"25_CR13","doi-asserted-by":"crossref","unstructured":"Gentry, C., Sahai, A., Waters, B.: Homomorphic encryption from learning with errors: conceptually-simpler, asymptotically-faster, attribute-based. In: Advances in Cryptology\u2013CRYPTO 2013: 33rd Annual Cryptology Conference, Santa Barbara, CA, USA, August 18-22, 2013. Proceedings, Part I, pp. 75\u201392. Springer (2013)","DOI":"10.1007\/978-3-642-40041-4_5"},{"key":"25_CR14","doi-asserted-by":"crossref","unstructured":"Guimar$$\\tilde{\\text{a}}$$es, A., Borin, E., Aranha, D.F.: Revisiting the functional bootstrap in TFHE. IACR Trans. Cryptographic Hardware Embed. Syst. 229\u2013253 (2021)","DOI":"10.46586\/tches.v2021.i2.229-253"},{"key":"25_CR15","unstructured":"Hwang, I.: TFHE-go (2023). https:\/\/github.com\/sp301415\/tfhe-go"},{"key":"25_CR16","unstructured":"Hwang, I., Min, S., Song, Y.: Carousel: fully homomorphic encryption with bootstrapping over automorphism group. Cryptology ePrint Archive, Paper 2024\/2032 (2024). https:\/\/eprint.iacr.org\/2024\/2032"},{"key":"25_CR17","unstructured":"Hwang, I., Min, S., Song, Y.: Practical circuit privacy\/sanitization for TFHE. Cryptology ePrint Archive, Paper 2025\/216 (2025). https:\/\/eprint.iacr.org\/2025\/216"},{"key":"25_CR18","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":"25_CR19","unstructured":"Kluczniak, K., Schild, L.: FDFB$$^2$$: functional bootstrapping via sparse polynomial multiplication. Cryptology ePrint Archive, Paper 2024\/1376 (2024). https:\/\/eprint.iacr.org\/2024\/1376"},{"key":"25_CR20","doi-asserted-by":"publisher","unstructured":"Lee, C., Min, S., Seo, J., Song, Y.: Faster TFHE bootstrapping with block binary keys. In: Liu, J.K., Xiang, Y., Nepal, S., Tsudik, G. (eds.) Proceedings of the 2023 ACM Asia Conference on Computer and Communications Security, ASIA CCS 2023, Melbourne, VIC, Australia, July 10-14, 2023, pp. 2\u201313. ACM (2023). https:\/\/doi.org\/10.1145\/3579856.3595804","DOI":"10.1145\/3579856.3595804"},{"key":"25_CR21","doi-asserted-by":"publisher","unstructured":"Lee, K., Yoon, J.W.: Discretization error reduction for high precision torus fully homomorphic encryption. In: Boldyreva, A., Kolesnikov, V. (eds.) Public-Key Cryptography - PKC 2023 - 26th IACR International Conference on Practice and Theory of Public-Key Cryptography, Atlanta, GA, USA, May 7-10, 2023, Proceedings, Part II. Lecture Notes in Computer Science, vol. 13941, pp. 33\u201362. Springer (2023). https:\/\/doi.org\/10.1007\/978-3-031-31371-4_2","DOI":"10.1007\/978-3-031-31371-4_2"},{"key":"25_CR22","doi-asserted-by":"publisher","unstructured":"Liu, Z., Micciancio, D., Polyakov, Y.: Large-precision homomorphic sign evaluation using FHEW\/TFHE bootstrapping. In: Agrawal, S., Lin, D. (eds.) Advances in Cryptology - ASIACRYPT 2022 - 28th International Conference on the Theory and Application of Cryptology and Information Security, Taipei, Taiwan, December 5-9, 2022, Proceedings, Part II. Lecture Notes in Computer Science, 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":"25_CR23","doi-asserted-by":"crossref","unstructured":"Lyubashevsky, V., Peikert, C., Regev, O.: On ideal lattices and learning with errors over rings. In: Advances in Cryptology\u2013EUROCRYPT 2010: 29th Annual International Conference on the Theory and Applications of Cryptographic Techniques, French Riviera, May 30\u2013June 3, 2010. Proceedings 29, pp. 1\u201323. Springer (2010)","DOI":"10.1007\/978-3-642-13190-5_1"},{"key":"25_CR24","doi-asserted-by":"publisher","unstructured":"Ma, S., Huang, T., Wang, A., Zhou, Q., Wang, X.: Fast and accurate: efficient full-domain functional bootstrap and digit decomposition for homomorphic computation. IACR Trans. Cryptogr. Hardw. Embed. Syst. 2024(1), 592\u2013616 (2024). https:\/\/doi.org\/10.46586\/TCHES.V2024.I1.592-616","DOI":"10.46586\/TCHES.V2024.I1.592-616"},{"issue":"6","key":"25_CR25","doi-asserted-by":"publisher","first-page":"1","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 (JACM) 56(6), 1\u201340 (2009)","journal-title":"J. ACM (JACM)"},{"key":"25_CR26","doi-asserted-by":"crossref","unstructured":"Stehl\u00e9, D., Steinfeld, R., Tanaka, K., Xagawa, K.: Efficient public key encryption based on ideal lattices. In: International Conference on the Theory and Application of Cryptology and Information Security, pp. 617\u2013635. Springer (2009)","DOI":"10.1007\/978-3-642-10366-7_36"},{"key":"25_CR27","unstructured":"Yang, Z., Xie, X., Shen, H., Chen, S., Zhou, J.: TOTA: fully homomorphic encryption with smaller parameters and stronger security. Cryptology ePrint Archive, Paper 2021\/1347 (2021). https:\/\/eprint.iacr.org\/2021\/1347"}],"container-title":["Lecture Notes in Computer Science","Selected Areas in Cryptography \u2013 SAC 2025"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-10536-3_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,1,2]],"date-time":"2026-01-02T02:34:12Z","timestamp":1767321252000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-10536-3_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9783032105356","9783032105363"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-10536-3_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026]]},"assertion":[{"value":"2 January 2026","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SAC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Selected Areas in Cryptography","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Toronto, ON","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Canada","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":"13 August 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 August 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"32","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sacrypt2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/sacworkshop.org\/SAC25\/index.html","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}