{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,5]],"date-time":"2026-03-05T15:44:17Z","timestamp":1772725457506,"version":"3.50.1"},"publisher-location":"Singapore","reference-count":36,"publisher":"Springer Nature Singapore","isbn-type":[{"value":"9789819608744","type":"print"},{"value":"9789819608751","type":"electronic"}],"license":[{"start":{"date-parts":[[2024,12,10]],"date-time":"2024-12-10T00:00:00Z","timestamp":1733788800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,12,10]],"date-time":"2024-12-10T00:00:00Z","timestamp":1733788800000},"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-981-96-0875-1_6","type":"book-chapter","created":{"date-parts":[[2024,12,9]],"date-time":"2024-12-09T07:10:16Z","timestamp":1733728216000},"page":"176-207","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Revisiting Key Decomposition Techniques for\u00a0FHE: Simpler, Faster and\u00a0More Generic"],"prefix":"10.1007","author":[{"given":"M. G.","family":"Belorgey","sequence":"first","affiliation":[]},{"given":"S.","family":"Carpov","sequence":"additional","affiliation":[]},{"given":"N.","family":"Gama","sequence":"additional","affiliation":[]},{"given":"S.","family":"Guasch","sequence":"additional","affiliation":[]},{"given":"D.","family":"Jetchev","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,12,10]]},"reference":[{"key":"6_CR1","doi-asserted-by":"crossref","unstructured":"M.\u00a0R. Albrecht, R.\u00a0Player, and S.\u00a0Scott. On the concrete hardness of learning with errors. Journal of Mathematical Cryptology, 9(3):169\u2013203, 2015.","DOI":"10.1515\/jmc-2015-0016"},{"key":"6_CR2","doi-asserted-by":"crossref","unstructured":"J.-C. Bajard, J.\u00a0Eynard, M.\u00a0A. Hasan, and V.\u00a0Zucca. A full RNS variant of FV like somewhat homomorphic encryption schemes. In Selected Areas in Cryptography \u2013 SAC 2016, pages 423\u2013442. Springer, 2017.","DOI":"10.1007\/978-3-319-69453-5_23"},{"key":"6_CR3","unstructured":"M.\u00a0G. Belorgey, S.\u00a0Carpov, N.\u00a0Gama, S.\u00a0Guasch, and D.\u00a0Jetchev. Revisiting key decomposition techniques for FHE: Simpler, faster and more generic. Cryptology ePrint Archive, Paper 2023\/771, 2023."},{"key":"6_CR4","doi-asserted-by":"crossref","unstructured":"C.\u00a0Boura, N.\u00a0Gama, M.\u00a0Georgieva, and D.\u00a0Jetchev. CHIMERA: combining ring-lwe-based fully homomorphic encryption schemes. J. Math. Cryptol., 14(1):316\u2013338, 2020.","DOI":"10.1515\/jmc-2019-0026"},{"key":"6_CR5","doi-asserted-by":"crossref","unstructured":"Z.\u00a0Brakerski, C.\u00a0Gentry, and V.\u00a0Vaikuntanathan. (leveled) fully homomorphic encryption without bootstrapping. In Innovations in Theoretical Computer Science 2012, pages 309\u2013325. ACM, 2012.","DOI":"10.1145\/2090236.2090262"},{"key":"6_CR6","doi-asserted-by":"crossref","unstructured":"R.\u00a0Cammarota. Intel HERACLES: homomorphic encryption revolutionary accelerator with correctness for learning-oriented end-to-end solutions. In Proceedings of the 2022 on Cloud Computing Security Workshop, CCSW. ACM, 2022.","DOI":"10.1145\/3560810.3565290"},{"key":"6_CR7","doi-asserted-by":"crossref","unstructured":"J.\u00a0H. Cheon, K.\u00a0Han, A.\u00a0Kim, M.\u00a0Kim, and Y.\u00a0Song. A full rns variant of approximate homomorphic encryption. Selected areas in cryptography : ... annual international workshop, SAC ... proceedings. SAC, 11349:347\u2013368, 2018.","DOI":"10.1007\/978-3-030-10970-7_16"},{"key":"6_CR8","doi-asserted-by":"crossref","unstructured":"J.\u00a0H. Cheon, A.\u00a0Kim, M.\u00a0Kim, and Y.\u00a0S. Song. Homomorphic encryption for arithmetic of approximate numbers. In Advances in Cryptology - ASIACRYPT, Part I, pages 409\u2013437. Springer, 2017.","DOI":"10.1007\/978-3-319-70694-8_15"},{"key":"6_CR9","doi-asserted-by":"crossref","unstructured":"I.\u00a0Chillotti, N.\u00a0Gama, M.\u00a0Georgieva, and M.\u00a0Izabach\u00e8ne. Faster fully homomorphic encryption: Bootstrapping in less than 0.1 seconds. In ASIACRYPT 2016, Proceedings, Part I, volume 10031 of LNCS, pages 3\u201333. Springer, 2016.","DOI":"10.1007\/978-3-662-53887-6_1"},{"key":"6_CR10","doi-asserted-by":"crossref","unstructured":"I.\u00a0Chillotti, N.\u00a0Gama, M.\u00a0Georgieva, and M.\u00a0Izabach\u00e8ne. TFHE: fast fully homomorphic encryption over the torus. J. Cryptol., 33(1):34\u201391, 2020.","DOI":"10.1007\/s00145-019-09319-x"},{"key":"6_CR11","doi-asserted-by":"crossref","unstructured":"I.\u00a0Chillotti, D.\u00a0Ligier, J.-B. Orfila, and S.\u00a0Tap. Improved programmable bootstrapping with larger precision and efficient arithmetic circuits for tfhe. In M.\u00a0Tibouchi and H.\u00a0Wang, editors, Advances in Cryptology \u2013 ASIACRYPT 2021, pages 670\u2013699, Cham, 2021. Springer International Publishing.","DOI":"10.1007\/978-3-030-92078-4_23"},{"key":"6_CR12","doi-asserted-by":"crossref","unstructured":"J.\u00a0Cooley and J.\u00a0Tukey. An algorithm for the machine calculation of complex fourier series. Mathematics of Computation, 19(90):297\u2013301, 1965.","DOI":"10.1090\/S0025-5718-1965-0178586-1"},{"key":"6_CR13","doi-asserted-by":"crossref","unstructured":"M.\u00a0Creeger. The rise of fully homomorphic encryption: Often called the holy grail of cryptography, commercial FHE is near. ACM Queue, 20(4):39\u201360, 2022.","DOI":"10.1145\/3561800"},{"key":"6_CR14","unstructured":"DARPA. DARPA:data protection in virtual environments (DPRIVE)."},{"key":"6_CR15","doi-asserted-by":"crossref","unstructured":"K.\u00a0Derya, A.\u00a0C. Mert, E.\u00a0\u00d6zt\u00fcrk, and E.\u00a0Savas. Coha-ntt: A configurable hardware accelerator for ntt-based polynomial multiplication. Microprocess. Microsystems, 89:104451, 2022.","DOI":"10.1016\/j.micpro.2022.104451"},{"key":"6_CR16","doi-asserted-by":"crossref","unstructured":"L.\u00a0Ducas and D.\u00a0Micciancio. FHEW: bootstrapping homomorphic encryption in less than a second. In EUROCRYPT 2015, Proceedings, Part I, volume 9056 of LNCS, pages 617\u2013640. Springer, 2015.","DOI":"10.1007\/978-3-662-46800-5_24"},{"key":"6_CR17","unstructured":"J.\u00a0Fan and F.\u00a0Vercauteren. Somewhat practical fully homomorphic encryption. IACR Cryptol. ePrint Arch., page 144, 2012."},{"key":"6_CR18","doi-asserted-by":"crossref","unstructured":"C.\u00a0Gentry. Fully homomorphic encryption using ideal lattices. In Proceedings of the 41st Annual ACM Symposium on Theory of Computing, STOC 2009, pages 169\u2013178. ACM, 2009.","DOI":"10.1145\/1536414.1536440"},{"key":"6_CR19","doi-asserted-by":"crossref","unstructured":"C.\u00a0Gentry, S.\u00a0Halevi, and N.\u00a0P. Smart. Homomorphic evaluation of the aes circuit. In Advances in Cryptology \u2013 CRYPTO 2012, pages 850\u2013867. Springer, 2012.","DOI":"10.1007\/978-3-642-32009-5_49"},{"key":"6_CR20","doi-asserted-by":"crossref","unstructured":"C.\u00a0Gentry, A.\u00a0Sahai, and B.\u00a0Waters. Homomorphic encryption from learning with errors: Conceptually-simpler, asymptotically-faster, attribute-based. In Advances in Cryptology - CRYPTO 2013, Part I, pages 75\u201392. Springer, 2013.","DOI":"10.1007\/978-3-642-40041-4_5"},{"key":"6_CR21","doi-asserted-by":"crossref","unstructured":"C.\u00a0Gentry, A.\u00a0Sahai, and B.\u00a0Waters. Homomorphic encryption from learning with errors: Conceptually-simpler, asymptotically-faster, attribute-based. In CRYPTO 2013, Proceedings, Part I, volume 8042 of LNCS, pages 75\u201392. Springer, 2013.","DOI":"10.1007\/978-3-642-40041-4_5"},{"key":"6_CR22","doi-asserted-by":"crossref","unstructured":"S.\u00a0Halevi, Y.\u00a0Polyakov, and V.\u00a0Shoup. An improved rns variant of the bfv homomorphic encryption scheme. In Topics in Cryptology \u2013 CT-RSA 2019, pages 83\u2013105. Springer, 2019.","DOI":"10.1007\/978-3-030-12612-4_5"},{"key":"6_CR23","doi-asserted-by":"crossref","unstructured":"M.\u00a0Kim, D.\u00a0Lee, J.\u00a0Seo, and Y.\u00a0Song. Accelerating he operations from key decomposition technique. In Advances in Cryptology \u2013 CRYPTO 2023: 43rd Annual International Cryptology Conference, Proceedings, Part IV. Springer-Verlag, 2023.","DOI":"10.1007\/978-3-031-38551-3_3"},{"key":"6_CR24","doi-asserted-by":"crossref","unstructured":"I.\u00a0Kundu, E.\u00a0Cottle, F.\u00a0Michel, J.\u00a0Wilson, and N.\u00a0New. The dawn of energy efficient computing: Optically accelerating the fast fourier transform core. In Photonics in Switching and Computing 2021. Optica Publishing Group, 2021.","DOI":"10.1364\/PSC.2021.M3B.1"},{"key":"6_CR25","doi-asserted-by":"crossref","unstructured":"Y.\u00a0Lee, S.\u00a0Heo, S.\u00a0Cheon, S.\u00a0Jeong, C.\u00a0Kim, E.\u00a0Kim, D.\u00a0Lee, and H.\u00a0Kim. Hecate: Performance-aware scale optimization for homomorphic encryption compiler. In 2022 IEEE\/ACM International Symposium on Code Generation and Optimization (CGO), pages 193\u2013204, 2022.","DOI":"10.1109\/CGO53902.2022.9741265"},{"key":"6_CR26","doi-asserted-by":"crossref","unstructured":"V.\u00a0Lyubashevsky, C.\u00a0Peikert, and O.\u00a0Regev. EUROCRYPT, chapter On Ideal Lattices and Learning with Errors over Rings, pages 1\u201323. Springer, 2010.","DOI":"10.1007\/978-3-642-13190-5_1"},{"key":"6_CR27","doi-asserted-by":"crossref","unstructured":"A.\u00a0C. Mert, E.\u00a0\u00d6zt\u00fcrk, and E.\u00a0Savas. FPGA implementation of a run-time configurable ntt-based polynomial multiplication hardware. Microprocess. Microsystems, 78:103219, 2020.","DOI":"10.1016\/j.micpro.2020.103219"},{"key":"6_CR28","doi-asserted-by":"crossref","unstructured":"D.\u00a0T. Nguyen and K.\u00a0Gaj. Fast falcon signature generation and verification using armv8 neon instructions. In Progress in Cryptology - AFRICACRYPT 2023, pages 417\u2013441. Springer, 2023.","DOI":"10.1007\/978-3-031-37679-5_18"},{"key":"6_CR29","doi-asserted-by":"crossref","unstructured":"\u00d6.\u00a0\u00d6zerk, C.\u00a0Elgezen, A.\u00a0C. Mert, E.\u00a0\u00d6zt\u00fcrk, and E.\u00a0Savas. Efficient number theoretic transform implementation on GPU for homomorphic encryption. J. Supercomput., 78(2):2840\u20132872, 2022.","DOI":"10.1007\/s11227-021-03980-5"},{"key":"6_CR30","doi-asserted-by":"crossref","unstructured":"O.\u00a0Regev. On lattices, learning with errors, random linear codes, and cryptography. J. ACM, 56(6):34:1\u201334:40, 2009.","DOI":"10.1145\/1568318.1568324"},{"key":"6_CR31","unstructured":"S.\u00a0S. Roy, F.\u00a0Turan, K.\u00a0J\u00e4rvinen, F.\u00a0Vercauteren, and I.\u00a0Verbauwhede. FPGA-based high-performance parallel architecture for homomorphic computing on encrypted data. In 25th IEEE International Symposium on High Performance Computer Architecture, pages 387\u2013398. IEEE, 2019."},{"key":"6_CR32","doi-asserted-by":"crossref","unstructured":"A.\u00a0Sch\u00f6nhage and V.\u00a0Strassen. Schnelle Multiplikation grosser Zahlen. Computing (Arch. Elektron. Rechnen), 7:281\u2013292, 1971.","DOI":"10.1007\/BF02242355"},{"key":"6_CR33","unstructured":"TFHE-lib. TFHE: Fast Fully Homomorphic Encryption over the Torus. https:\/\/tfhe.github.io\/tfhe\/."},{"key":"6_CR34","doi-asserted-by":"crossref","unstructured":"F.\u00a0Turan, S.\u00a0S. Roy, and I.\u00a0Verbauwhede. HEAWS: an accelerator for homomorphic encryption on the amazon AWS FPGA. IEEE Trans. Computers, 2020.","DOI":"10.1109\/TC.2020.2988765"},{"key":"6_CR35","doi-asserted-by":"crossref","unstructured":"E.\u00a0R. T\u00fcrkoglu, A.\u00a0S. \u00d6zcan, C.\u00a0Ayduman, A.\u00a0C. Mert, E.\u00a0\u00d6zt\u00fcrk, and E.\u00a0Savas. An accelerated GPU library for homomorphic encryption operations of BFV scheme. In IEEE International Symposium on Circuits and Systems, 2022.","DOI":"10.1109\/ISCAS48785.2022.9937503"},{"key":"6_CR36","unstructured":"Zama. TFHE-rs: A Pure Rust Implementation of the TFHE Scheme for Boolean and Integer Arithmetics Over Encrypted Data, 2024. https:\/\/github.com\/zama-ai\/tfhe-rs."}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 ASIACRYPT 2024"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-96-0875-1_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,12,9]],"date-time":"2024-12-09T08:03:47Z","timestamp":1733731427000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-96-0875-1_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,12,10]]},"ISBN":["9789819608744","9789819608751"],"references-count":36,"URL":"https:\/\/doi.org\/10.1007\/978-981-96-0875-1_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,12,10]]},"assertion":[{"value":"10 December 2024","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":"Kolkata","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"India","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 December 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 December 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"asiacrypt2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/asiacrypt.iacr.org\/2024\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}