{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,27]],"date-time":"2026-10-27T11:59:42Z","timestamp":1793102382094,"version":"4.5.0"},"publisher-location":"Cham","reference-count":39,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031911002","type":"print"},{"value":"9783031911019","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"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-3-031-91101-9_7","type":"book-chapter","created":{"date-parts":[[2025,4,27]],"date-time":"2025-04-27T21:14:27Z","timestamp":1745788467000},"page":"181-211","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["Drifting Towards Better Error Probabilities in\u00a0Fully Homomorphic Encryption Schemes"],"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"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3567-3304","authenticated-orcid":false,"given":"Nigel P.","family":"Smart","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3186-2482","authenticated-orcid":false,"given":"Michael","family":"Walter","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2025,4,28]]},"reference":[{"key":"7_CR1","unstructured":"Alexandru, A., Badawi, A.A., Micciancio, D., Polyakov, Y.: Application-aware approximate homomorphic encryption: Configuring FHE for practical use. Cryptology ePrint Archive, Report 2024\/203 (2024), https:\/\/ia.cr\/2024\/203"},{"key":"7_CR2","doi-asserted-by":"publisher","unstructured":"Alperin-Sheriff, J., Peikert, C.: Faster bootstrapping with polynomial error. In: Garay, J.A., Gennaro, R. (eds.) CRYPTO\u00a02014, Part\u00a0I. LNCS, vol.\u00a08616, pp. 297\u2013314. Springer, Berlin, Heidelberg (Aug 2014). https:\/\/doi.org\/10.1007\/978-3-662-44371-2_17","DOI":"10.1007\/978-3-662-44371-2_17"},{"key":"7_CR3","unstructured":"Azzalini, A.: A class of distributions which includes the normal ones. Scandinavian Journal of Statistics 12(5), 171\u2013178 (1985), http:\/\/www.jstor.org\/stable\/4615982"},{"key":"7_CR4","unstructured":"Bernard, O., Joye, M., Smart, N.P., Walter, M.: Drifting towards better error probabilities in fully homomorphic encryption schemes. Cryptology ePrint Archive, Report 2024\/1718 (2024), https:\/\/ia.cr\/2024\/1718"},{"issue":"1","key":"7_CR5","doi-asserted-by":"publisher","first-page":"122","DOI":"10.1090\/S0002-9947-1941-0003498-3","volume":"49","author":"AC Berry","year":"1941","unstructured":"Berry, A.C.: The accuracy of the Gaussian approximation to the sum of independent variates. Trans. Am. Math. Soc. 49(1), 122\u2013136 (1941). https:\/\/doi.org\/10.1090\/S0002-9947-1941-0003498-3","journal-title":"Trans. Am. Math. Soc."},{"key":"7_CR6","unstructured":"Billingsley, P.: Probability and Measure. Wiley Series in Probability and Mathematical Statistics, John Wiley & Sons, 3rd edn. (1995)"},{"key":"7_CR7","doi-asserted-by":"publisher","unstructured":"Bonnoron, G., Ducas, L., Fillinger, M.: Large FHE gates from tensored homomorphic accumulator. In: Joux, A., Nitaj, A., Rachidi, T. (eds.) AFRICACRYPT 18. LNCS, vol. 10831, pp. 217\u2013251. Springer, Cham (May 2018). https:\/\/doi.org\/10.1007\/978-3-319-89339-6_13","DOI":"10.1007\/978-3-319-89339-6_13"},{"key":"7_CR8","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\u00a02022, Part\u00a0II. LNCS, vol. 13792, pp. 188\u2013215. Springer, Cham (Dec 2022). https:\/\/doi.org\/10.1007\/978-3-031-22966-4_7","DOI":"10.1007\/978-3-031-22966-4_7"},{"key":"7_CR9","doi-asserted-by":"publisher","unstructured":"Brakerski, Z.: Fully homomorphic encryption without modulus switching from classical GapSVP. In: Safavi-Naini, R., Canetti, R. (eds.) CRYPTO\u00a02012. LNCS, vol.\u00a07417, pp. 868\u2013886. Springer, Berlin, Heidelberg (Aug 2012). https:\/\/doi.org\/10.1007\/978-3-642-32009-5_50","DOI":"10.1007\/978-3-642-32009-5_50"},{"key":"7_CR10","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":"7_CR11","doi-asserted-by":"publisher","unstructured":"Brakerski, Z., Vaikuntanathan, V.: Efficient fully homomorphic encryption from (standard) LWE. In: Ostrovsky, R. (ed.) 52nd FOCS. pp. 97\u2013106. IEEE Computer Society Press (Oct 2011). https:\/\/doi.org\/10.1109\/FOCS.2011.12","DOI":"10.1109\/FOCS.2011.12"},{"key":"7_CR12","doi-asserted-by":"publisher","unstructured":"Brakerski, Z., Vaikuntanathan, V.: Fully homomorphic encryption from ring-LWE and security for key dependent messages. In: Rogaway, P. (ed.) CRYPTO\u00a02011. LNCS, vol.\u00a06841, pp. 505\u2013524. Springer, Berlin, Heidelberg (Aug 2011). https:\/\/doi.org\/10.1007\/978-3-642-22792-9_29","DOI":"10.1007\/978-3-642-22792-9_29"},{"key":"7_CR13","unstructured":"Canard, S., Fontaine, C., Phan, D.H., Pointcheval, D., Renard, M., Sirdey, R.: Relations among new CCA security notions for approximate FHE. Cryptology ePrint Archive, Report 2024\/812 (2024), https:\/\/ia.cr\/2024\/812"},{"key":"7_CR14","doi-asserted-by":"publisher","unstructured":"Checri, M., Sirdey, R., Boudguiga, A., Bultel, J.P.: On the practical $$\\text{CPA}^{D}$$ security of \u201cexact\u201d and threshold FHE schemes and libraries. In: Reyzin, L., Stebila, D. (eds.) CRYPTO\u00a02024, Part\u00a0III. LNCS, vol. 14922, pp. 3\u201333. Springer, Cham (Aug 2024). https:\/\/doi.org\/10.1007\/978-3-031-68382-4_1","DOI":"10.1007\/978-3-031-68382-4_1"},{"key":"7_CR15","doi-asserted-by":"publisher","unstructured":"Chen, Z., Wang, J., Chen, L., Song, X.: A Regev-type fully homomorphic encryption scheme using modulus switching. The Scientific Journal 14 (2014). https:\/\/doi.org\/10.1155\/2014\/983862, article ID 983862","DOI":"10.1155\/2014\/983862"},{"key":"7_CR16","doi-asserted-by":"publisher","unstructured":"Cheon, J.H., Choe, H., Passel\u00e8gue, A., Stehl\u00e9, D., Suvanto, E.: Attacks against the INDCPA-D security of exact FHE schemes. In: Lie, D., Kirda, E. (eds.) ACM CCS 2024. pp. 2505\u20132519. ACM Press (Nov 2024). https:\/\/doi.org\/10.1145\/3658644.3690341","DOI":"10.1145\/3658644.3690341"},{"key":"7_CR17","doi-asserted-by":"publisher","unstructured":"Cheon, J.H., Kim, A., Kim, M., Song, Y.S.: Homomorphic encryption for arithmetic of approximate numbers. In: Takagi, T., Peyrin, T. (eds.) ASIACRYPT\u00a02017, Part\u00a0I. LNCS, vol. 10624, pp. 409\u2013437. Springer, Cham (Dec 2017). https:\/\/doi.org\/10.1007\/978-3-319-70694-8_15","DOI":"10.1007\/978-3-319-70694-8_15"},{"issue":"1","key":"7_CR18","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_CR19","doi-asserted-by":"publisher","unstructured":"Chillotti, I., Joye, M., Paillier, P.: Programmable bootstrapping enables efficient homomorphic inference of deep neural networks. In: Dolev, S., et\u00a0al. (eds.) Cyber Security Cryptography and Machine Learning (CSCML 2021). LNCS, vol. 12716, pp. 1\u201319. Springer (2021). https:\/\/doi.org\/10.1007\/978-3-030-78086-9_1","DOI":"10.1007\/978-3-030-78086-9_1"},{"key":"7_CR20","doi-asserted-by":"publisher","unstructured":"Ducas, L., Micciancio, D.: FHEW: Bootstrapping homomorphic encryption in less than a second. In: Oswald, E., Fischlin, M. (eds.) EUROCRYPT\u00a02015, Part\u00a0I. LNCS, vol.\u00a09056, pp. 617\u2013640. Springer, Berlin, Heidelberg (Apr 2015). https:\/\/doi.org\/10.1007\/978-3-662-46800-5_24","DOI":"10.1007\/978-3-662-46800-5_24"},{"key":"7_CR21","unstructured":"Fan, J., Vercauteren, F.: Somewhat practical fully homomorphic encryption. Cryptology ePrint Archive, Report 2012\/144 (2012), https:\/\/ia.cr\/2012\/144"},{"key":"7_CR22","doi-asserted-by":"publisher","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\u00a02016, Part\u00a0II. LNCS, vol.\u00a09666, pp. 528\u2013558. Springer, Berlin, Heidelberg (May 2016). https:\/\/doi.org\/10.1007\/978-3-662-49896-5_19","DOI":"10.1007\/978-3-662-49896-5_19"},{"key":"7_CR23","unstructured":"Gentry, C.: A fully homomorphic encryption scheme. Ph.D. thesis, Stanford University (2009), https:\/\/crypto.stanford.edu\/craig"},{"key":"7_CR24","doi-asserted-by":"publisher","unstructured":"Joye, M.: SoK: Fully homomorphic encryption over the [discretized] torus. IACR TCHES 2022(4), 661\u2013692 (2022). https:\/\/doi.org\/10.46586\/tches.v2022.i4.661-692","DOI":"10.46586\/tches.v2022.i4.661-692"},{"key":"7_CR25","doi-asserted-by":"publisher","unstructured":"Joye, M.: TFHE public-key encryption revisited. In: Oswald, E. (ed.) CT-RSA\u00a02024. LNCS, vol. 14643, pp. 277\u2013291. Springer, Cham (May 2024). https:\/\/doi.org\/10.1007\/978-3-031-58868-6_11","DOI":"10.1007\/978-3-031-58868-6_11"},{"issue":"4","key":"7_CR26","doi-asserted-by":"publisher","first-page":"476","DOI":"10.4236\/ajcm.2023.134026","volume":"13","author":"J Komelj","year":"2023","unstructured":"Komelj, J.: The bivariate normal integral via Owen\u2019s $$T$$ function as a modified Euler\u2019s arctangent series. American Journal of Computational Mathematics 13(4), 476\u2013504 (2023). https:\/\/doi.org\/10.4236\/ajcm.2023.134026","journal-title":"American Journal of Computational Mathematics"},{"key":"7_CR27","doi-asserted-by":"publisher","unstructured":"Lee, Y., Micciancio, D., Kim, A., Choi, R., Deryabin, M., Eom, J., Yoo, D.: Efficient FHEW bootstrapping with small evaluation keys, and applications to threshold homomorphic encryption. In: Hazay, C., Stam, M. (eds.) EUROCRYPT\u00a02023, Part\u00a0III. LNCS, vol. 14006, pp. 227\u2013256. Springer, Cham (Apr 2023). https:\/\/doi.org\/10.1007\/978-3-031-30620-4_8","DOI":"10.1007\/978-3-031-30620-4_8"},{"key":"7_CR28","doi-asserted-by":"publisher","unstructured":"Li, B., Micciancio, D.: On the security of homomorphic encryption on approximate numbers. In: Canteaut, A., Standaert, F.X. (eds.) EUROCRYPT\u00a02021, Part\u00a0I. LNCS, vol. 12696, pp. 648\u2013677. Springer, Cham (Oct 2021). https:\/\/doi.org\/10.1007\/978-3-030-77870-5_23","DOI":"10.1007\/978-3-030-77870-5_23"},{"key":"7_CR29","doi-asserted-by":"publisher","unstructured":"Li, B., Micciancio, D., Schultz, M., Sorrell, J.: Securing approximate homomorphic encryption using differential privacy. In: Dodis, Y., Shrimpton, T. (eds.) CRYPTO\u00a02022, Part\u00a0I. LNCS, vol. 13507, pp. 560\u2013589. Springer, Cham (Aug 2022). https:\/\/doi.org\/10.1007\/978-3-031-15802-5_20","DOI":"10.1007\/978-3-031-15802-5_20"},{"key":"7_CR30","doi-asserted-by":"publisher","unstructured":"L\u00f3pez-Alt, A., Tromer, E., Vaikuntanathan, V.: On-the-fly multiparty computation on the cloud via multikey fully homomorphic encryption. In: Karloff, H.J., Pitassi, T. (eds.) 44th ACM STOC. pp. 1219\u20131234. ACM Press (May 2012). https:\/\/doi.org\/10.1145\/2213977.2214086","DOI":"10.1145\/2213977.2214086"},{"issue":"1","key":"7_CR31","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1214\/aoms\/1177731647","volume":"13","author":"E Lukacs","year":"1942","unstructured":"Lukacs, E.: A characterization of the normal distribution. Ann. Math. Stat. 13(1), 91\u201393 (1942). https:\/\/doi.org\/10.1214\/aoms\/1177731647","journal-title":"Ann. Math. Stat."},{"key":"7_CR32","doi-asserted-by":"publisher","unstructured":"Manulis, M., Nguyen, J.: Fully homomorphic encryption beyond IND-CCA1 security: Integrity through verifiability. In: Joye, M., Leander, G. (eds.) EUROCRYPT\u00a02024, Part\u00a0II. LNCS, vol. 14652, pp. 63\u201393. Springer, Cham (May 2024). https:\/\/doi.org\/10.1007\/978-3-031-58723-8_3","DOI":"10.1007\/978-3-031-58723-8_3"},{"key":"7_CR33","doi-asserted-by":"crossref","unstructured":"Owen, D.B.: Tables for computing bivariate normal probabilities. The Annals of Mathematical Statistics 27(4), 1075\u20131090 (1956), http:\/\/www.jstor.org\/stable\/2237196","DOI":"10.1214\/aoms\/1177728074"},{"key":"7_CR34","doi-asserted-by":"publisher","unstructured":"Regev, O.: On lattices, learning with errors, random linear codes, and cryptography. Journal of the ACM 56(6), 34:1\u201334:40 (2009). https:\/\/doi.org\/10.1145\/1568318.1568324","DOI":"10.1145\/1568318.1568324"},{"key":"7_CR35","doi-asserted-by":"publisher","unstructured":"Rothblum, R.: Homomorphic encryption: From private-key to public-key. In: Ishai, Y. (ed.) TCC\u00a02011. LNCS, vol.\u00a06597, pp. 219\u2013234. Springer, Berlin, Heidelberg (Mar 2011). https:\/\/doi.org\/10.1007\/978-3-642-19571-6_14","DOI":"10.1007\/978-3-642-19571-6_14"},{"key":"7_CR36","unstructured":"Shoup, V.: Why chosen ciphertext security matters. Research Report RZ 3076, IBM (Nov 1998), https:\/\/shoup.net\/papers\/expo.pdf"},{"key":"7_CR37","doi-asserted-by":"publisher","unstructured":"Smart, N.P.: Practical and efficient FHE-based MPC. In: Quaglia, E.A. (ed.) 19th IMA International Conference on Cryptography and Coding. LNCS, vol. 14421, pp. 263\u2013283. Springer, Cham (Dec 2023). https:\/\/doi.org\/10.1007\/978-3-031-47818-5_14","DOI":"10.1007\/978-3-031-47818-5_14"},{"key":"7_CR38","doi-asserted-by":"publisher","unstructured":"van Dijk, M., Gentry, C., Halevi, S., Vaikuntanathan, V.: Fully homomorphic encryption over the integers. In: Gilbert, H. (ed.) EUROCRYPT\u00a02010. LNCS, vol.\u00a06110, pp. 24\u201343. Springer, Berlin, Heidelberg (May\u00a0\/\u00a0Jun 2010). https:\/\/doi.org\/10.1007\/978-3-642-13190-5_2","DOI":"10.1007\/978-3-642-13190-5_2"},{"key":"7_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 EUROCRYPT 2025"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-91101-9_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,27]],"date-time":"2025-04-27T21:14:30Z","timestamp":1745788470000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-91101-9_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9783031911002","9783031911019"],"references-count":39,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-91101-9_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"28 April 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"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":"Madrid","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Spain","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":"4 May 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 May 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"44","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"eurocrypt2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/eurocrypt.iacr.org\/2025\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}