{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,6]],"date-time":"2026-05-06T17:14:39Z","timestamp":1778087679042,"version":"3.51.4"},"publisher-location":"Cham","reference-count":52,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032253262","type":"print"},{"value":"9783032253279","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-25327-9_7","type":"book-chapter","created":{"date-parts":[[2026,5,6]],"date-time":"2026-05-06T16:38:22Z","timestamp":1778085502000},"page":"183-213","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["REFHE: Fully Homomorphic ALU"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-4867-7999","authenticated-orcid":false,"given":"Zvika","family":"Brakerski","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0002-1654-3934","authenticated-orcid":false,"given":"Offir","family":"Friedman","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Daniel","family":"Golan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alon","family":"Gurny","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1003-0732","authenticated-orcid":false,"given":"Dolev","family":"Mutzari","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0001-2213-7329","authenticated-orcid":false,"given":"Ohad","family":"Sheinfeld","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2026,5,7]]},"reference":[{"key":"7_CR1","unstructured":"Albrecht, M.R., Player, R., Scott, S.: On the concrete hardness of learning with errors. IACR ePrint 2015\/046 (2015)"},{"key":"7_CR2","doi-asserted-by":"crossref","unstructured":"Bernstein, D.J., Chuengsatiansup, C., Lange, T., van Vredendaal, C.: NTRU prime: reducing attack surface at low cost. IACR ePrint 2016\/461 (2016)","DOI":"10.1007\/978-3-319-72565-9_12"},{"issue":"1","key":"7_CR3","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1007\/s00200-020-00433-z","volume":"33","author":"I Blanco-Chac\u00f3n","year":"2022","unstructured":"Blanco-Chac\u00f3n, I.: On the RLWE\/PLWE equivalence for cyclotomic number fields. Appl. Algebra Eng. Commun. Comput. 33(1), 53\u201371 (2022)","journal-title":"Appl. Algebra Eng. Commun. Comput."},{"key":"7_CR4","unstructured":"Boemer, F., Tarbe, K., Rishi, R.: Announcing swift homomorphic encryption (2024). https:\/\/www.swift.org\/blog\/announcing-swift-homomorphic-encryption\/"},{"key":"7_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1007\/978-3-030-34621-8_4","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2019","author":"M Bolboceanu","year":"2019","unstructured":"Bolboceanu, M., Brakerski, Z., Perlman, R., Sharma, D.: Order-LWE and the hardness of ring-LWE with entropic secrets. In: Galbraith, S.D., Moriai, S. (eds.) ASIACRYPT 2019. LNCS, vol. 11922, pp. 91\u2013120. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-34621-8_4"},{"key":"7_CR6","doi-asserted-by":"crossref","unstructured":"Boneh, D., Kim, J.: Homomorphic encryption for large integers from nested residue number systems. IACR ePrint 2025\/346 (2025)","DOI":"10.1007\/978-3-032-01881-6_11"},{"issue":"1","key":"7_CR7","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1515\/JMC-2015-0051","volume":"14","author":"C Bootland","year":"2020","unstructured":"Bootland, C., Castryck, W., Iliashenko, I., Vercauteren, F.: Efficiently processing complex-valued data in homomorphic encryption. J. Math. Cryptol. 14(1), 55\u201365 (2020). https:\/\/doi.org\/10.1515\/JMC-2015-0051","journal-title":"J. Math. Cryptol."},{"key":"7_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"868","DOI":"10.1007\/978-3-642-32009-5_50","volume-title":"Advances in Cryptology \u2013 CRYPTO 2012","author":"Z Brakerski","year":"2012","unstructured":"Brakerski, Z.: Fully homomorphic encryption without modulus switching from classical GapSVP. In: Safavi-Naini, R., Canetti, R. (eds.) CRYPTO 2012. LNCS, vol. 7417, pp. 868\u2013886. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-32009-5_50"},{"key":"7_CR9","doi-asserted-by":"publisher","unstructured":"Brakerski, Z., Gentry, C., Vaikuntanathan, V.: (leveled) fully homomorphic encryption without bootstrapping. In: Innovations in Theoretical Computer Science (ITCS), pp. 309\u2013325. ACM (2012). https:\/\/doi.org\/10.1145\/2090236.2090262","DOI":"10.1145\/2090236.2090262"},{"key":"7_CR10","doi-asserted-by":"publisher","unstructured":"Brakerski, Z., Vaikuntanathan, V.: Efficient fully homomorphic encryption from (standard) LWE. In: IEEE 52nd Annual Symposium on Foundations of Computer Science (FOCS), pp. 97\u2013106. IEEE (2011). https:\/\/doi.org\/10.1109\/FOCS.2011.12","DOI":"10.1109\/FOCS.2011.12"},{"key":"7_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"505","DOI":"10.1007\/978-3-642-22792-9_29","volume-title":"Advances in Cryptology \u2013 CRYPTO 2011","author":"Z Brakerski","year":"2011","unstructured":"Brakerski, Z., Vaikuntanathan, V.: Fully homomorphic encryption from ring-LWE and security for key dependent messages. In: Rogaway, P. (ed.) CRYPTO 2011. LNCS, vol. 6841, pp. 505\u2013524. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-22792-9_29"},{"key":"7_CR12","doi-asserted-by":"crossref","unstructured":"Castryck, W., Iliashenko, I., Vercauteren, F.: Provably weak instances of ring-LWE revisited. IACR ePrint 2016\/239 (2016)","DOI":"10.1007\/978-3-662-49890-3_6"},{"key":"7_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"116","DOI":"10.1007\/978-3-319-76953-0_7","volume-title":"Topics in Cryptology \u2013 CT-RSA 2018","author":"H Chen","year":"2018","unstructured":"Chen, H., Laine, K., Player, R., Xia, Y.: High-precision arithmetic in\u00a0homomorphic encryption. In: Smart, N.P. (ed.) CT-RSA 2018. LNCS, vol. 10808, pp. 116\u2013136. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-76953-0_7"},{"key":"7_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"409","DOI":"10.1007\/978-3-319-70694-8_15","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2017","author":"JH Cheon","year":"2017","unstructured":"Cheon, J.H., Kim, A., Kim, M., Song, Y.: Homomorphic encryption for arithmetic of approximate numbers. In: Takagi, T., Peyrin, T. (eds.) ASIACRYPT 2017. LNCS, vol. 10624, pp. 409\u2013437. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-70694-8_15"},{"issue":"1","key":"7_CR15","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). https:\/\/doi.org\/10.1007\/S00145-019-09319-X","journal-title":"J. Cryptol."},{"key":"7_CR16","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"},{"key":"7_CR17","unstructured":"Conrad, K.: The different ideal. Expository papers\/Lecture notes (2009). http:\/\/www.math.uconn.edu\/~kconrad\/blurbs\/gradnumthy\/different.pdf"},{"key":"7_CR18","doi-asserted-by":"crossref","unstructured":"Ducas, L., Micciancio, D.: FHEW: Bootstrapping homomorphic encryption in less than a second. IACR ePrint 2014\/816 (2014)","DOI":"10.1007\/978-3-662-46800-5_24"},{"key":"7_CR19","doi-asserted-by":"crossref","unstructured":"Eisentraeger, K., Hallgren, S., Lauter, K.: Weak instances of PLWE. IACR ePrint 2014\/784 (2014)","DOI":"10.1007\/978-3-319-13051-4_11"},{"key":"7_CR20","doi-asserted-by":"crossref","unstructured":"Elias, Y., Lauter, K.E., Ozman, E., Stange, K.E.: Provably weak instances of ring-LWE (2015)","DOI":"10.1007\/978-3-662-47989-6_4"},{"key":"7_CR21","unstructured":"Fan, J., Vercauteren, F.: Somewhat practical fully homomorphic encryption. IACR ePrint 2012\/144 (2012)"},{"key":"7_CR22","doi-asserted-by":"crossref","unstructured":"Geelen, R., Iliashenko, I., Kang, J., Vercauteren, F.: On polynomial functions modulo $$p^e$$ and faster bootstrapping for homomorphic encryption. In: Advances in Cryptology \u2013 EUROCRYPT 2023, pp. 257\u2013286. Springer, Cham (2023)","DOI":"10.1007\/978-3-031-30620-4_9"},{"key":"7_CR23","unstructured":"Geelen, R., Vercauteren, F.: Fully homomorphic encryption for cyclotomic prime moduli. IACR ePrint 2024\/1587 (2024)"},{"key":"7_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1007\/978-3-319-16295-9_3","volume-title":"Progress in Cryptology - LATINCRYPT 2014","author":"M Geihs","year":"2015","unstructured":"Geihs, M., Cabarcas, D.: Efficient integer encoding for homomorphic encryption via ring isomorphisms. In: Aranha, D.F., Menezes, A. (eds.) LATINCRYPT 2014. LNCS, vol. 8895, pp. 48\u201363. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-16295-9_3"},{"key":"7_CR25","doi-asserted-by":"publisher","unstructured":"Gentry, C.: Fully homomorphic encryption using ideal lattices. In: Proceedings of the 41st Annual ACM STOC, pp. 169\u2013178. ACM (2009). https:\/\/doi.org\/10.1145\/1536414.1536440","DOI":"10.1145\/1536414.1536440"},{"key":"7_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"438","DOI":"10.1007\/978-3-030-36033-7_17","volume-title":"Theory of Cryptography","author":"C Gentry","year":"2019","unstructured":"Gentry, C., Halevi, S.: Compressible FHE with applications to PIR. In: Hofheinz, D., Rosen, A. (eds.) TCC 2019. LNCS, vol. 11892, pp. 438\u2013464. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-36033-7_17"},{"key":"7_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"465","DOI":"10.1007\/978-3-642-29011-4_28","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2012","author":"C Gentry","year":"2012","unstructured":"Gentry, C., Halevi, S., Smart, N.P.: Fully homomorphic encryption with polylog overhead. In: Pointcheval, D., Johansson, T. (eds.) EUROCRYPT 2012. LNCS, vol. 7237, pp. 465\u2013482. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-29011-4_28"},{"key":"7_CR28","doi-asserted-by":"crossref","unstructured":"Gentry, C., Sahai, A., Waters, B.: Homomorphic encryption from learning with errors: conceptually-simpler, asymptotically-faster, attribute-based. IACR ePrint 2013\/340 (2013)","DOI":"10.1007\/978-3-642-40041-4_5"},{"key":"7_CR29","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1016\/0024-3795(84)90089-2","volume":"62","author":"GR Greenfield","year":"1984","unstructured":"Greenfield, G.R., Drucker, D.: On the discriminant of a trinomial. Linear Algebra Appl. 62, 105\u2013112 (1984). https:\/\/doi.org\/10.1016\/0024-3795(84)90089-2","journal-title":"Linear Algebra Appl."},{"key":"7_CR30","unstructured":"Halevi, S., Shoup, V.: Design and implementation of HElib: a homomorphic encryption library. IACR ePrint 2020\/1481 (2020)"},{"issue":"1","key":"7_CR31","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.: Bootstrapping for HElib. J. Cryptol. 34(1), 7 (2021). https:\/\/doi.org\/10.1007\/S00145-020-09368-7","journal-title":"J. Cryptol."},{"key":"7_CR32","unstructured":"Hoffstein, J., Silverman, J.H.: Optimizations for NTRU. In: Proceedings of the Conference on Public Key Cryptography and Computational Number Theory, Warsaw, pp. 77\u201388 (2000)"},{"issue":"1","key":"7_CR33","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1109\/TC.2023.3318405","volume":"73","author":"A Kim","year":"2024","unstructured":"Kim, A., et al.: General bootstrapping approach for RLWE-based homomorphic encryption. IEEE Trans. Comput. 73(1), 86\u201396 (2024). https:\/\/doi.org\/10.1109\/TC.2023.3318405","journal-title":"IEEE Trans. Comput."},{"issue":"3","key":"7_CR34","doi-asserted-by":"publisher","first-page":"565","DOI":"10.1007\/S10623-014-9938-4","volume":"75","author":"A Langlois","year":"2015","unstructured":"Langlois, A., Stehl\u00e9, D.: Worst-case to average-case reductions for module lattices. Des. Codes Cryptogr. 75(3), 565\u2013599 (2015). https:\/\/doi.org\/10.1007\/S10623-014-9938-4","journal-title":"Des. Codes Cryptogr."},{"key":"7_CR35","doi-asserted-by":"publisher","unstructured":"Lin, W., Mook, E., Wichs, D.: Doubly efficient private information retrieval and fully homomorphic RAM computation from ring LWE. In: Proceedings of the 55th Annual ACM STOC, pp. 595\u2013608. ACM (2023). https:\/\/doi.org\/10.1145\/3564246.3585175","DOI":"10.1145\/3564246.3585175"},{"key":"7_CR36","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"},{"key":"7_CR37","doi-asserted-by":"publisher","unstructured":"Lyubashevsky, V., Peikert, C., Regev, O.: On ideal lattices and learning with errors over rings. J. ACM 60(6), 43:1\u201343:35 (2013). https:\/\/doi.org\/10.1145\/2535925","DOI":"10.1145\/2535925"},{"key":"7_CR38","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1007\/978-3-642-38348-9_3","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2013","author":"V Lyubashevsky","year":"2013","unstructured":"Lyubashevsky, V., Peikert, C., Regev, O.: A toolkit for ring-LWE cryptography. In: Johansson, T., Nguyen, P.Q. (eds.) EUROCRYPT 2013. LNCS, vol. 7881, pp. 35\u201354. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-38348-9_3"},{"key":"7_CR39","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"700","DOI":"10.1007\/978-3-642-29011-4_41","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2012","author":"D Micciancio","year":"2012","unstructured":"Micciancio, D., Peikert, C.: Trapdoors for lattices: simpler, tighter, faster, smaller. In: Pointcheval, D., Johansson, T. (eds.) EUROCRYPT 2012. LNCS, vol. 7237, pp. 700\u2013718. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-29011-4_41"},{"key":"7_CR40","unstructured":"Microsoft SEAL: Microsoft SEAL: Homomorphic encryption library (2011). https:\/\/github.com\/Microsoft\/SEAL"},{"key":"7_CR41","doi-asserted-by":"crossref","unstructured":"Peikert, C.: How (not) to instantiate ring-LWE. IACR ePrint 2016\/351 (2016)","DOI":"10.1007\/978-3-319-44618-9_22"},{"key":"7_CR42","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-030-36030-6_1","volume-title":"Theory of Cryptography","author":"C Peikert","year":"2019","unstructured":"Peikert, C., Pepin, Z.: Algebraically structured LWE, revisited. In: Hofheinz, D., Rosen, A. (eds.) TCC 2019. LNCS, vol. 11891, pp. 1\u201323. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-36030-6_1"},{"key":"7_CR43","doi-asserted-by":"publisher","unstructured":"Peikert, C., Regev, O., Stephens-Davidowitz, N.: Pseudorandomness of ring-LWE for any ring and modulus. In: Proceedings of the 49th Annual ACM STOC, pp. 461\u2013473. ACM (2017). https:\/\/doi.org\/10.1145\/3055399.3055489","DOI":"10.1145\/3055399.3055489"},{"key":"7_CR44","doi-asserted-by":"publisher","unstructured":"Regev, O.: On lattices, learning with errors, random linear codes, and cryptography. In: Proceedings of the 37th Annual ACM STOC, pp. 84\u201393. ACM (2005). https:\/\/doi.org\/10.1145\/1060590.1060603","DOI":"10.1145\/1060590.1060603"},{"issue":"11","key":"7_CR45","first-page":"169","volume":"4","author":"RL Rivest","year":"1978","unstructured":"Rivest, R.L., Adleman, L., Dertouzos, M.L.: On data banks and privacy homomorphisms. Found. Secure Comput. 4(11), 169\u2013180 (1978)","journal-title":"Found. Secure Comput."},{"key":"7_CR46","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1007\/978-3-319-63697-9_10","volume-title":"Advances in Cryptology \u2013 CRYPTO 2017","author":"M Ro\u015fca","year":"2017","unstructured":"Ro\u015fca, M., Sakzad, A., Stehl\u00e9, D., Steinfeld, R.: Middle-product learning with errors. In: Katz, J., Shacham, H. (eds.) CRYPTO 2017. LNCS, vol. 10403, pp. 283\u2013297. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-63697-9_10"},{"key":"7_CR47","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1007\/978-3-319-78381-9_6","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2018","author":"M Rosca","year":"2018","unstructured":"Rosca, M., Stehl\u00e9, D., Wallet, A.: On the ring-LWE and polynomial-LWE problems. In: Nielsen, J.B., Rijmen, V. (eds.) EUROCRYPT 2018. LNCS, vol. 10820, pp. 146\u2013173. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-78381-9_6"},{"key":"7_CR48","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"377","DOI":"10.1007\/978-3-642-17373-8_22","volume-title":"Advances in Cryptology - ASIACRYPT 2010","author":"D Stehl\u00e9","year":"2010","unstructured":"Stehl\u00e9, D., Steinfeld, R.: Faster fully homomorphic encryption. In: Abe, M. (ed.) ASIACRYPT 2010. LNCS, vol. 6477, pp. 377\u2013394. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-17373-8_22"},{"key":"7_CR49","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":"7_CR50","unstructured":"TFHE: TFHE: Fast fully homomorphic encryption library over the torus (2017). https:\/\/github.com\/tfhe\/tfhe"},{"key":"7_CR51","unstructured":"Zama: Concrete: TFHE compiler that converts python programs into FHE equivalent (2021). https:\/\/github.com\/zama-ai\/concrete"},{"key":"7_CR52","unstructured":"Zama AI: 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"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 EUROCRYPT 2026"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-25327-9_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,5,6]],"date-time":"2026-05-06T16:38:34Z","timestamp":1778085514000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-25327-9_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9783032253262","9783032253279"],"references-count":52,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-25327-9_7","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":"7 May 2026","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"Offir Friedman, Daniel Golan, Alon Gurny, Dolev Mutzari, and Ohad Sheinfeld were employees of dWallet Labs Ltd. while working on this paper and may hold equity in the company. Zvika Brakerski is a paid advisor to dWallet Labs Ltd and a faculty member in the Department of Computer Science and Applied Mathematics at the Weizmann Institute of Science. These relationships could be viewed as potential competing interests; however, the authors declare that they have no other competing interests relevant to the content of this article.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Disclosure of Interests"}},{"value":"EUROCRYPT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Annual International Conference on the Theory and Applications of Cryptographic Techniques","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Rome","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2026","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 May 2026","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 May 2026","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":"eurocrypt2026","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/eurocrypt.iacr.org\/2026\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}