{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T18:04:15Z","timestamp":1775066655875,"version":"3.50.1"},"publisher-location":"Cham","reference-count":40,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031533679","type":"print"},{"value":"9783031533686","type":"electronic"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"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":[[2024]]},"DOI":"10.1007\/978-3-031-53368-6_16","type":"book-chapter","created":{"date-parts":[[2024,2,18]],"date-time":"2024-02-18T19:02:15Z","timestamp":1708282935000},"page":"325-345","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":19,"title":["On the\u00a0Precision Loss in\u00a0Approximate Homomorphic Encryption"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-8793-6116","authenticated-orcid":false,"given":"Anamaria","family":"Costache","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0009-0005-6377-0234","authenticated-orcid":false,"given":"Benjamin R.","family":"Curtis","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9551-7912","authenticated-orcid":false,"given":"Erin","family":"Hales","sequence":"additional","affiliation":[]},{"given":"Sean","family":"Murphy","sequence":"additional","affiliation":[]},{"given":"Tabitha","family":"Ogilvie","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7292-4702","authenticated-orcid":false,"given":"Rachel","family":"Player","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,2,19]]},"reference":[{"key":"16_CR1","unstructured":"Albrecht, M., et al.: Homomorphic encryption security standard. HomomorphicEncryption.org, Technical report (2018)"},{"key":"16_CR2","doi-asserted-by":"crossref","unstructured":"Al Badawi, A., et al.: Openfhe: open-source fully homomorphic encryption library. Cryptology ePrint Archive, Paper 2022\/915 (2022). https:\/\/eprint.iacr.org\/2022\/915","DOI":"10.1145\/3560827.3563379"},{"key":"16_CR3","unstructured":"Biasioli, B., Marcolla, C., Calderini, M., Mono, J.: Improving and automating BFV parameters selection: an average-case approach. Cryptology ePrint Archive, Paper 2023\/600 (2023). https:\/\/eprint.iacr.org\/2023\/600"},{"key":"16_CR4","doi-asserted-by":"crossref","unstructured":"Boemer, F., Costache, A., Cammarota, R., Wierzynski, C.: ngraph-he2: a high-throughput framework for neural network inference on encrypted data. In: Brenner, M., Lepoint, T., Rohloff, K. (eds.) Proceedings of the 7th ACM Workshop on Encrypted Computing & Applied Homomorphic Cryptography, WAHC@CCS 2019, London, UK, 11\u201315 November 2019, pp. 45\u201356. ACM (2019)","DOI":"10.1145\/3338469.3358944"},{"key":"16_CR5","doi-asserted-by":"crossref","unstructured":"Brakerski, Z., Gentry, C., Vaikuntanathan, V.: (Leveled) fully homomorphic encryption without bootstrapping. In: Goldwasser, S. (ed.) ITCS 2012, pp. 309\u2013325. ACM (2012)","DOI":"10.1145\/2090236.2090262"},{"issue":"2","key":"16_CR6","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3368619","volume":"46","author":"N Brisebarre","year":"2020","unstructured":"Brisebarre, N., Jolde\u015f, M., Muller, J.-M., Nane\u015f, A.-M., Picot, J.: Error analysis of some operations involved in the cooley-tukey fast fourier transform. ACM Trans. Math. Softw. (TOMS) 46(2), 1\u201327 (2020)","journal-title":"ACM Trans. Math. Softw. (TOMS)"},{"key":"16_CR7","doi-asserted-by":"crossref","unstructured":"Chen, H., Dai, W., Kim, M., Song, Y.: Efficient multi-key homomorphic encryption with packed ciphertexts with application to oblivious neural network inference. In: Cavallaro, L., Kinder, J., Wang, X.F., Katz, J. (eds.) ACM CCS 2019, pp. 395\u2013412. ACM Press (2019)","DOI":"10.1145\/3319535.3363207"},{"key":"16_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"360","DOI":"10.1007\/978-3-319-78381-9_14","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2018","author":"JH Cheon","year":"2018","unstructured":"Cheon, J.H., Han, K., Kim, A., Kim, M., Song, Y.: Bootstrapping for approximate homomorphic encryption. In: Nielsen, J.B., Rijmen, V. (eds.) EUROCRYPT 2018. LNCS, vol. 10820, pp. 360\u2013384. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-78381-9_14"},{"key":"16_CR9","doi-asserted-by":"publisher","unstructured":"Cheon, J.H., Han, K., Kim, A., Kim, M., Song, Y.: A full RNS variant of approximate homomorphic encryption. In: Cid, C., Jacobson Jr, M.J. (eds.) SAC 2018, vol. 11349 of LNCS, pp. 347\u2013368. Springer, Heidelberg (2019). https:\/\/doi.org\/10.1007\/978-3-030-10970-7_16","DOI":"10.1007\/978-3-030-10970-7_16"},{"key":"16_CR10","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":"16_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-662-53887-6_1","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2016","author":"I Chillotti","year":"2016","unstructured":"Chillotti, I., Gama, N., Georgieva, M., Izabach\u00e8ne, M.: Faster fully homomorphic encryption: bootstrapping in less than 0.1 seconds. In: Cheon, J.H., Takagi, T. (eds.) ASIACRYPT 2016. LNCS, vol. 10031, pp. 3\u201333. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-53887-6_1"},{"issue":"1","key":"16_CR12","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. Cryptology 33(1), 34\u201391 (2020)","journal-title":"J. Cryptology"},{"key":"16_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1007\/978-3-319-29485-8_19","volume-title":"Topics in Cryptology - CT-RSA 2016","author":"A Costache","year":"2016","unstructured":"Costache, A., Smart, N.P.: Which ring based somewhat homomorphic encryption scheme is best? In: Sako, K. (ed.) CT-RSA 2016. LNCS, vol. 9610, pp. 325\u2013340. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-29485-8_19"},{"key":"16_CR14","unstructured":"Costache, A., Curtis, B.R., Hales, E., Murphy, S., Ogilvie, T., Player, R.: On the precision loss in approximate homomorphic encryption. Cryptology ePrint Archive, Paper 2022\/162 (2022). https:\/\/eprint.iacr.org\/2022\/162"},{"key":"16_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"546","DOI":"10.1007\/978-3-030-59013-0_27","volume-title":"Computer Security \u2013 ESORICS 2020","author":"A Costache","year":"2020","unstructured":"Costache, A., Laine, K., Player, R.: Evaluating the effectiveness of heuristic worst-case noise analysis in FHE. In: Chen, L., Li, N., Liang, K., Schneider, S. (eds.) ESORICS 2020. LNCS, vol. 12309, pp. 546\u2013565. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-59013-0_27"},{"key":"16_CR16","doi-asserted-by":"publisher","unstructured":"Costache, A., N\u00fcrnberger, L., Player, R.: Optimisations and tradeoffs for helib. In: Topics in Cryptology-CT-RSA 2023: Cryptographers\u2019 Track at the RSA Conference 2023, San Francisco, CA, USA, 24\u201327 April 2023, Proceedings, pp. 29\u201353. Springer, Heidelberg (2023). https:\/\/doi.org\/10.1007\/978-3-031-30872-7_2","DOI":"10.1007\/978-3-031-30872-7_2"},{"key":"16_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"643","DOI":"10.1007\/978-3-642-32009-5_38","volume-title":"Advances in Cryptology \u2013 CRYPTO 2012","author":"I Damg\u00e5rd","year":"2012","unstructured":"Damg\u00e5rd, I., Pastro, V., Smart, N., Zakarias, S.: Multiparty computation from somewhat homomorphic encryption. In: Safavi-Naini, R., Canetti, R. (eds.) CRYPTO 2012. LNCS, vol. 7417, pp. 643\u2013662. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-32009-5_38"},{"key":"16_CR18","unstructured":"Fan, J., Vercauteren, F.: Somewhat practical fully homomorphic encryption. Cryptology ePrint Archive, Report 2012\/144 (2012). http:\/\/eprint.iacr.org\/2012\/144"},{"key":"16_CR19","doi-asserted-by":"crossref","unstructured":"Gentry, C.: Fully homomorphic encryption using ideal lattices. In: Mitzenmacher, M. (ed.) 41st ACM STOC, pp. 169\u2013178. ACM Press (2009)","DOI":"10.1145\/1536414.1536440"},{"key":"16_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"850","DOI":"10.1007\/978-3-642-32009-5_49","volume-title":"Advances in Cryptology \u2013 CRYPTO 2012","author":"C Gentry","year":"2012","unstructured":"Gentry, C., Halevi, S., Smart, N.P.: Homomorphic evaluation of the AES circuit. In: Safavi-Naini, R., Canetti, R. (eds.) CRYPTO 2012. LNCS, vol. 7417, pp. 850\u2013867. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-32009-5_49"},{"key":"16_CR21","unstructured":"Halevi, S., Shoup, V.: Design and implementation of HElib: a homomorphic encryption library. Cryptology ePrint Archive, Report 2020\/1481 (2020). https:\/\/eprint.iacr.org\/2020\/1481"},{"key":"16_CR22","unstructured":"Fullrns-heaan. https:\/\/github.com\/KyoohyungHan\/FullRNS-HEAAN. Version as at October 2018"},{"key":"16_CR23","unstructured":"Heaan v2.1. https:\/\/github.com\/snucrypto\/HEAAN. Version as at September 2021"},{"key":"16_CR24","unstructured":"Heaan v1.0. https:\/\/github.com\/snucrypto\/HEAAN\/releases\/tag\/1.0. Version as at September 2018"},{"key":"16_CR25","unstructured":"HElib. https:\/\/github.com\/shaih\/HElib. Version as at January 2019"},{"key":"16_CR26","unstructured":"Iliashenko, I.: Optimisations of fully homomorphic encryption. PhD thesis, KU Leuven (2019)"},{"issue":"4","key":"16_CR27","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1186\/s12920-018-0401-7","volume":"11","author":"A Kim","year":"2018","unstructured":"Kim, A., Song, Y., Kim, M., Lee, K., Cheon, J.H.: Logistic regression model training based on the approximate homomorphic encryption. BMC Med. Genom. 11(4), 83 (2018)","journal-title":"BMC Med. Genom."},{"key":"16_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1007\/978-3-030-95312-6_6","volume-title":"Topics in Cryptology \u2013 CT-RSA 2022","author":"A Kim","year":"2022","unstructured":"Kim, A., Papadimitriou, A., Polyakov, Y.: Approximate homomorphic encryption with reduced approximation error. In: Galbraith, S.D. (ed.) CT-RSA 2022. LNCS, vol. 13161, pp. 120\u2013144. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-030-95312-6_6"},{"key":"16_CR29","doi-asserted-by":"publisher","unstructured":"Kim, A., Polyakov, Y., Zucca, V.: Revisiting homomorphic encryption schemes for finite fields. In: Tibouchi, M., Wang, H. (eds.) ASIACRYPT 2021. LNCS, vol. 13092, pp. 608\u2013639. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-92078-4_21","DOI":"10.1007\/978-3-030-92078-4_21"},{"key":"16_CR30","unstructured":"Lattigo v2.2.0. http:\/\/github.com\/ldsec\/lattigo. Version as at July 2021. EPFL-LDS"},{"key":"16_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"318","DOI":"10.1007\/978-3-319-06734-6_20","volume-title":"Progress in Cryptology \u2013 AFRICACRYPT 2014","author":"T Lepoint","year":"2014","unstructured":"Lepoint, T., Naehrig, M.: A comparison of the homomorphic encryption schemes FV and YASHE. In: Pointcheval, D., Vergnaud, D. (eds.) AFRICACRYPT 2014. LNCS, vol. 8469, pp. 318\u2013335. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-06734-6_20"},{"key":"16_CR32","doi-asserted-by":"publisher","unstructured":"Lee, Y., Lee, J.W., Kim, Y.S., Kim, Y., No, J.S., Kang, H.: High-Precision Bootstrapping for Approximate Homomorphic Encryption by Error Variance Minimization. In: Dunkelman, O., Dziembowski, S. (eds.) EUROCRYPT 2022. LNCS, vol. 13275, pp. 551\u2013580. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-06944-4_19","DOI":"10.1007\/978-3-031-06944-4_19"},{"key":"16_CR33","doi-asserted-by":"publisher","unstructured":"Li, B., Micciancio, D., Schultz, M., Sorrell, J.: Securing approximate homomorphic encryption using differential privacy. In: Annual International Cryptology Conference, pp. 560\u2013589. Springer, Heidelberg (2022). https:\/\/doi.org\/10.1007\/978-3-031-15802-5_20","DOI":"10.1007\/978-3-031-15802-5_20"},{"key":"16_CR34","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 2021. LNCS, vol. 12696, pp. 648\u2013677. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-77870-5_23","DOI":"10.1007\/978-3-030-77870-5_23"},{"key":"16_CR35","unstructured":"Murphy, S., Player, R.: A central limit framework for ring-lwe decryption. Cryptology ePrint Archive, Report 2019\/452 (2019). https:\/\/eprint.iacr.org\/2019\/452"},{"issue":"1","key":"16_CR36","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1515\/jmc-2020-0073","volume":"15","author":"S Murphy","year":"2021","unstructured":"Murphy, S., Player, R.: Discretisation and product distributions in Ring-LWE. J. Math. Cryptol. 15(1), 45\u201359 (2021)","journal-title":"J. Math. Cryptol."},{"key":"16_CR37","unstructured":"Ogilvie, T., Player, R., Rowell, J.: Improved privacy-preserving training using fixed-hessian minimisation. In: Brenner, M., Lepoint, T. (eds.) Proceedings of the 8th Workshop on Encrypted Computing and Applied Homomorphic Cryptography (WAHC 2020) (2020). https:\/\/doi.org\/10.25835\/0072999"},{"key":"16_CR38","unstructured":"PALISADE Lattice Cryptography Library (release 1.11.5). https:\/\/palisade-crypto.org\/. Accessed Sept 2021"},{"issue":"6","key":"16_CR39","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":"16_CR40","unstructured":"Microsoft SEAL (release 3.6). Microsoft Research, Redmond, WA. https:\/\/github.com\/Microsoft\/SEAL. Version as at November 2020"}],"container-title":["Lecture Notes in Computer Science","Selected Areas in Cryptography \u2013 SAC 2023"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-53368-6_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,2,18]],"date-time":"2024-02-18T19:03:41Z","timestamp":1708283021000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-53368-6_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031533679","9783031533686"],"references-count":40,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-53368-6_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"19 February 2024","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":"Fredericton, NB","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":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 August 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 August 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sacrypt2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/sac-workshop.github.io\/sac-2023\/index.html","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"45","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"21","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"47% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.09","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.56","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}