{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,27]],"date-time":"2026-10-27T11:59:40Z","timestamp":1793102380785,"version":"4.5.0"},"publisher-location":"Cham","reference-count":39,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032353733","type":"print"},{"value":"9783032353740","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-35374-0_13","type":"book-chapter","created":{"date-parts":[[2026,8,10]],"date-time":"2026-08-10T13:50:30Z","timestamp":1786369830000},"page":"396-427","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["SMOOTHIE: (Multi-)scalar Multiplication Optimisations On TFHE"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0009-0001-0072-7731","authenticated-orcid":false,"given":"Xander","family":"Pottier","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9675-7988","authenticated-orcid":false,"given":"Jan-Pieter","family":"D\u2019Anvers","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0007-7118-8337","authenticated-orcid":false,"given":"Thomas","family":"de Ruijter","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0879-076X","authenticated-orcid":false,"given":"Ingrid","family":"Verbauwhede","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2026,8,11]]},"reference":[{"key":"13_CR1","doi-asserted-by":"publisher","unstructured":"Alexandru, A., Kim, A., Polyakov, Y.: General functional bootstrapping using CKKS. In: Kalai, Y.T., Kamara, S.F. (eds.) CRYPTO\u00a02025, Part\u00a0III. LNCS, vol. 16002, pp. 304\u2013337. Springer, Cham (Aug 2025). https:\/\/doi.org\/10.1007\/978-3-032-01881-6_10","DOI":"10.1007\/978-3-032-01881-6_10"},{"key":"13_CR2","unstructured":"Ballandras, M., et al.: Tfhe-rs: A (practical) handbook (2025). https:\/\/github.com\/zama-ai\/tfhe-rs-handbook\/blob\/main\/tfhe-rs-handbook.pdf"},{"key":"13_CR3","unstructured":"Benamira, A., Gu\u00e9rand, T., Peyrin, T., Saha, S.: TT-TFHE: a torus fully homomorphic encryption-friendly neural network architecture (2025). https:\/\/arxiv.org\/abs\/2302.01584"},{"key":"13_CR4","doi-asserted-by":"publisher","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","DOI":"10.1007\/s00145-023-09463-5"},{"key":"13_CR5","doi-asserted-by":"publisher","unstructured":"Bergerat, L., Chillotti, I., Ligier, D., Orfila, J.B., Tap, S.: TFHE gets real: an efficient and flexible homomorphic floating-point arithmetic. IACR Trans. Cryptographic Hardware Embedded Syst. 2025(2), 126\u2013162 (2025). https:\/\/doi.org\/10.46586\/tches.v2025.i2.126-162, https:\/\/tches.iacr.org\/index.php\/TCHES\/article\/view\/12044","DOI":"10.46586\/tches.v2025.i2.126-162"},{"key":"13_CR6","doi-asserted-by":"crossref","unstructured":"Blake, I., Seroussi, G., Smart, N.: Elliptic Curves in Cryptography. Lecture note series. Cambridge University Press (1999),.https:\/\/books.google.be\/books?id=0_vegzgyqGMC","DOI":"10.1017\/CBO9781107360211"},{"key":"13_CR7","unstructured":"Boura, C., Gama, N., Georgieva, M., Jetchev, D.: CHIMERA: combining ring-LWE-based fully homomorphic encryption schemes. Cryptology ePrint Archive, Report 2018\/758 (2018). https:\/\/eprint.iacr.org\/2018\/758"},{"key":"13_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"483","DOI":"10.1007\/978-3-319-96878-0_17","volume-title":"Advances in Cryptology \u2013 CRYPTO 2018","author":"F Bourse","year":"2018","unstructured":"Bourse, F., Minelli, M., Minihold, M., Paillier, P.: Fast homomorphic evaluation of deep discretized neural networks. In: Shacham, H., Boldyreva, A. (eds.) CRYPTO 2018. LNCS, vol. 10993, pp. 483\u2013512. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-96878-0_17"},{"key":"13_CR9","doi-asserted-by":"publisher","unstructured":"Bourse, F., Sanders, O., Traor\u00e9, J.: Improved secure integer comparison via homomorphic encryption. In: Jarecki, S. (ed.) CT-RSA 2020. LNCS, vol. 12006, pp. 391\u2013416. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-40186-3_17","DOI":"10.1007\/978-3-030-40186-3_17"},{"key":"13_CR10","doi-asserted-by":"publisher","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","DOI":"10.1007\/978-3-642-32009-5_50"},{"key":"13_CR11","doi-asserted-by":"publisher","unstructured":"Brakerski, Z., Gentry, C., Vaikuntanathan, V.: (Leveled) fully homomorphic encryption without bootstrapping. In: Goldwasser, S. (ed.) ITCS 2012, pp. 309\u2013325. ACM (Jan 2012).https:\/\/doi.org\/10.1145\/2090236.2090262","DOI":"10.1145\/2090236.2090262"},{"key":"13_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"200","DOI":"10.1007\/3-540-47555-9_18","volume-title":"Advances in Cryptology \u2014 EUROCRYPT\u2019 92","author":"EF Brickell","year":"1993","unstructured":"Brickell, E.F., Gordon, D.M., McCurley, K.S., Wilson, D.B.: Fast exponentiation with precomputation. In: Rueppel, R.A. (ed.) EUROCRYPT 1992. LNCS, vol. 658, pp. 200\u2013207. Springer, Heidelberg (1993). https:\/\/doi.org\/10.1007\/3-540-47555-9_18"},{"key":"13_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"106","DOI":"10.1007\/978-3-030-12612-4_6","volume-title":"Topics in Cryptology \u2013 CT-RSA 2019","author":"S Carpov","year":"2019","unstructured":"Carpov, S., Izabach\u00e8ne, M., Mollimard, V.: New techniques for multi-value input homomorphic evaluation and applications. In: Matsui, M. (ed.) CT-RSA 2019. LNCS, vol. 11405, pp. 106\u2013126. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-12612-4_6"},{"key":"13_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"},{"key":"13_CR15","doi-asserted-by":"publisher","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","DOI":"10.1007\/s00145-019-09319-x"},{"key":"13_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"670","DOI":"10.1007\/978-3-030-92078-4_23","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2021","author":"I Chillotti","year":"2021","unstructured":"Chillotti, I., Ligier, D., Orfila, J.-B., Tap, S.: Improved programmable bootstrapping with\u00a0larger precision and\u00a0efficient arithmetic circuits for\u00a0TFHE. In: Tibouchi, M., Wang, H. (eds.) ASIACRYPT 2021. LNCS, vol. 13092, pp. 670\u2013699. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-92078-4_23"},{"key":"13_CR17","unstructured":"Clet, P.E., Zuber, M., Boudguiga, A., Sirdey, R., Gouy-Pailler, C.: Putting up the swiss army knife of homomorphic calculations by means of TFHE functional bootstrapping. Cryptology ePrint Archive, Report 2022\/149 (2022). https:\/\/eprint.iacr.org\/2022\/149"},{"key":"13_CR18","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":"13_CR19","doi-asserted-by":"publisher","unstructured":"Dumezy, J., Alexandru, A., Polyakov, Y., Clet, P.E., Chakraborty, O., Boudguiga, A.: Evaluating larger lookup tables using ckks. IACR Trans. Cryptographic Hardware Embedded Syst. 2026(1), 559\u2013591 (2026). https:\/\/doi.org\/10.46586\/tches.v2026.i1.559-591, https:\/\/tches.iacr.org\/index.php\/TCHES\/article\/view\/12693","DOI":"10.46586\/tches.v2026.i1.559-591"},{"key":"13_CR20","unstructured":"Fan, J., Vercauteren, F.: Somewhat practical fully homomorphic encryption. Cryptology ePrint Archive, Report 2012\/144 (2012). https:\/\/eprint.iacr.org\/2012\/144"},{"key":"13_CR21","doi-asserted-by":"publisher","unstructured":"Geelen, R., Vercauteren, F.: Fully homomorphic encryption for cyclotomic prime moduli. In: Fehr, S., Fouque, P.A. (eds.) EUROCRYPT\u00a02025, Part\u00a0III. LNCS, vol. 15603, pp. 366\u2013397. Springer, Cham (May 2025). https:\/\/doi.org\/10.1007\/978-3-031-91131-6_13","DOI":"10.1007\/978-3-031-91131-6_13"},{"key":"13_CR22","doi-asserted-by":"publisher","unstructured":"Guimar\u00e3es, A., Borin, E., Aranha, D.F.: Revisiting the functional bootstrap in TFHE. IACR TCHES 2021(2), 229\u2013253 (2021). https:\/\/doi.org\/10.46586\/tches.v2021.i2.229-253, https:\/\/tches.iacr.org\/index.php\/TCHES\/article\/view\/8793","DOI":"10.46586\/tches.v2021.i2.229-253"},{"key":"13_CR23","doi-asserted-by":"crossref","unstructured":"Hillis, W.D., Steele, G.L.: Data parallel algorithms. Commun. ACM 29(12), 1170\u20131183 (1986)","DOI":"10.1145\/7902.7903"},{"key":"13_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1007\/978-3-030-31578-8_2","volume-title":"Cryptology and Network Security","author":"M Izabach\u00e8ne","year":"2019","unstructured":"Izabach\u00e8ne, M., Sirdey, R., Zuber, M.: Practical fully homomorphic encryption for fully masked neural networks. In: Mu, Y., Deng, R.H., Huang, X. (eds.) CANS 2019. LNCS, vol. 11829, pp. 24\u201336. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-31578-8_2"},{"key":"13_CR25","unstructured":"Joye, M.: Guide to fully homomorphic encryption over the [discretized] torus. Cryptology ePrint Archive, Report 2021\/1402 (2021). https:\/\/eprint.iacr.org\/2021\/1402"},{"key":"13_CR26","doi-asserted-by":"crossref","unstructured":"Klemsa, J., \u00d6nen, M.: Parallel operations over TFHE-encrypted multi-digit integers. Cryptology ePrint Archive, Report 2022\/067 (2022). https:\/\/eprint.iacr.org\/2022\/067","DOI":"10.1145\/3508398.3511527"},{"key":"13_CR27","unstructured":"Klemsa, J., \u00d6nen, M.: PARMESAN: Parallel ARithMEticS over ENcrypted data. Cryptology ePrint Archive, Report 2023\/544 (2023). https:\/\/eprint.iacr.org\/2023\/544"},{"key":"13_CR28","doi-asserted-by":"publisher","unstructured":"Kluczniak, K., Schild, L.: FDFB: full domain functional bootstrapping towards practical fully homomorphic encryption. IACR TCHES 2023(1), 501\u2013537 (2023). https:\/\/doi.org\/10.46586\/tches.v2023.i1.501-537","DOI":"10.46586\/tches.v2023.i1.501-537"},{"key":"13_CR29","unstructured":"Kluczniak, K., Schild, L.: FDFB$$^2$$: functional bootstrapping via sparse polynomial multiplication. Cryptology ePrint Archive, Report 2024\/1376 (2024). https:\/\/eprint.iacr.org\/2024\/1376"},{"key":"13_CR30","doi-asserted-by":"crossref","unstructured":"Krizhevsky, A., Sutskever, I., Hinton, G.E.: Imagenet classification with deep convolutional neural networks. Commun. ACM 60(6), 84\u201390 (2017)","DOI":"10.1145\/3065386"},{"key":"13_CR31","unstructured":"Legiest, W., D\u2019Anvers, J.P., Spasic, B., Tran, N.L., Verbauwhede, I.: Leuvenshtein: efficient FHE-based edit distance computation with single bootstrap per cell. In: Proceedings of the 34th USENIX Conference on Security Symposium, SEC 2025, USENIX Association, USA (2025)"},{"key":"13_CR32","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.) ASIACRYPT\u00a02022, Part\u00a0II. LNCS, vol. 13792, pp. 130\u2013160. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-22966-4_5","DOI":"10.1007\/978-3-031-22966-4_5"},{"key":"13_CR33","doi-asserted-by":"publisher","unstructured":"jie Lu, W., Huang, Z., Hong, C., Ma, Y., Qu, H.: PEGASUS: bridging polynomial and non-polynomial evaluations in homomorphic encryption. In: 2021 IEEE Symposium on Security and Privacy. pp. 1057\u20131073. IEEE Computer Society Press (May 2021). https:\/\/doi.org\/10.1109\/SP40001.2021.00043","DOI":"10.1109\/SP40001.2021.00043"},{"key":"13_CR34","doi-asserted-by":"publisher","unstructured":"Morain, F., Olivos, J.: Speeding up the computations on an elliptic curve using addition-subtraction chains. ITA 24, 531\u2013544 (1990). https:\/\/doi.org\/10.1051\/ita\/1990240605311","DOI":"10.1051\/ita\/1990240605311"},{"key":"13_CR35","doi-asserted-by":"publisher","unstructured":"Pippenger, N.: On the evaluation of powers and related problems (preliminary version). In: 17th Annual Symposium on Foundations of Computer Science, Houston, Texas, USA, 25-27 October 1976, pp. 258\u2013263. IEEE Computer Society (1976). https:\/\/doi.org\/10.1109\/SFCS.1976.21","DOI":"10.1109\/SFCS.1976.21"},{"key":"13_CR36","doi-asserted-by":"crossref","unstructured":"Pottier, X., D\u2019Anvers, J.P., de\u00a0Ruijter, T., Verbauwhede, I.: SMOOTHIE: (multi-)scalar multiplication optimisations on TFHE. Cryptology ePrint Archive, Paper 2025\/1267 (2025). https:\/\/eprint.iacr.org\/2025\/1267","DOI":"10.46586\/tches.v2025.i2.489-510"},{"key":"13_CR37","doi-asserted-by":"publisher","unstructured":"Trama, D., Boudguiga, A., Clet, P.E., Sirdey, R., Ye, N.: Designing a general-purpose 8-bit (T)FHE processor abstraction. IACR Trans. Cryptographic Hardware Embedded Syst. 2025(2), 535\u2013578 (2025). https:\/\/doi.org\/10.46586\/tches.v2025.i2.535-578, https:\/\/tches.iacr.org\/index.php\/TCHES\/article\/view\/12057","DOI":"10.46586\/tches.v2025.i2.535-578"},{"key":"13_CR38","unstructured":"Yang, Z., Xie, X., Shen, H., Chen, S., Zhou, J.: TOTA: Fully homomorphic encryption with smaller parameters and stronger security. Cryptology ePrint Archive, Report 2021\/1347 (2021). https:\/\/eprint.iacr.org\/2021\/1347"},{"key":"13_CR39","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"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 CRYPTO 2026"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-35374-0_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,8,10]],"date-time":"2026-08-10T13:50:35Z","timestamp":1786369835000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-35374-0_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9783032353733","9783032353740"],"references-count":39,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-35374-0_13","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":"11 August 2026","order":1,"name":"first_online","label":"First Online","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":"2026","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 August 2026","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 August 2026","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"46","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"crypto2026","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/crypto.iacr.org\/2026\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}