{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,5]],"date-time":"2026-05-05T07:00:42Z","timestamp":1777964442021,"version":"3.51.4"},"publisher-location":"Cham","reference-count":28,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030953119","type":"print"},{"value":"9783030953126","type":"electronic"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-030-95312-6_6","type":"book-chapter","created":{"date-parts":[[2022,1,29]],"date-time":"2022-01-29T17:08:51Z","timestamp":1643476131000},"page":"120-144","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":44,"title":["Approximate Homomorphic Encryption with Reduced Approximation Error"],"prefix":"10.1007","author":[{"given":"Andrey","family":"Kim","sequence":"first","affiliation":[]},{"given":"Antonis","family":"Papadimitriou","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5566-3763","authenticated-orcid":false,"given":"Yuriy","family":"Polyakov","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,1,29]]},"reference":[{"key":"6_CR1","unstructured":"PALISADE Lattice Cryptography Library (release 1.10.3) (2020). https:\/\/palisade-crypto.org\/"},{"key":"6_CR2","unstructured":"Albrecht, M., Chase, M., Chen, H., et al.: Homomorphic encryption security standard. Tech. rep., HomomorphicEncryption.org, Toronto, Canada, November 2018"},{"key":"6_CR3","doi-asserted-by":"crossref","unstructured":"Bajard, J.C., Eynard, J., Hasan, M.A., Zucca, V.: A full RNS variant of FV like somewhat homomorphic encryption schemes. In: SAC 2016, pp. 423\u2013442 (2016)","DOI":"10.1007\/978-3-319-69453-5_23"},{"key":"6_CR4","doi-asserted-by":"crossref","unstructured":"Bergamaschi, F., Halevi, S., Halevi, T.T., Hunt, H.: Homomorphic training of 30, 000 logistic regression models. In: ACNS 2019, pp. 592\u2013611 (2019)","DOI":"10.1007\/978-3-030-21568-2_29"},{"issue":"21","key":"6_CR5","doi-asserted-by":"publisher","first-page":"11608","DOI":"10.1073\/pnas.1918257117","volume":"117","author":"M Blatt","year":"2020","unstructured":"Blatt, M., Gusev, A., Polyakov, Y., Goldwasser, S.: Secure large-scale genome-wide association studies using homomorphic encryption. Proc. Natl. Acad. Sci. 117(21), 11608\u201311613 (2020)","journal-title":"Proc. Natl. Acad. Sci."},{"issue":"7","key":"6_CR6","first-page":"1","volume":"13","author":"M Blatt","year":"2020","unstructured":"Blatt, M., Gusev, A., Polyakov, Y., Rohloff, K., Vaikuntanathan, V.: Optimized homomorphic encryption solution for secure genome-wide association studies. BMC Med. Genomics 13(7), 1\u201313 (2020)","journal-title":"BMC Med. Genomics"},{"key":"6_CR7","doi-asserted-by":"crossref","unstructured":"Bossuat, J.P., Mouchet, C., Troncoso-Pastoriza, J., Hubaux, J.P.: Efficient bootstrapping for approximate homomorphic encryption with non-sparse keys. Cryptology ePrint Archive, Report 2020\/1203 (2020)","DOI":"10.1007\/978-3-030-77870-5_21"},{"key":"6_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"},{"issue":"3","key":"6_CR9","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2633600","volume":"6","author":"Z Brakerski","year":"2014","unstructured":"Brakerski, Z., Gentry, C., Vaikuntanathan, V.: (Leveled) fully homomorphic encryption without bootstrapping. ACM Trans. Comput. Theor. (TOCT) 6(3), 1\u201336 (2014)","journal-title":"ACM Trans. Comput. Theor. (TOCT)"},{"key":"6_CR10","doi-asserted-by":"crossref","unstructured":"Brakerski, Z., Vaikuntanathan, V.: Fully homomorphic encryption from ring-LWE and security for key dependent messages. In: CRYPTO 2011, pp. 505\u2013524 (2011)","DOI":"10.1007\/978-3-642-22792-9_29"},{"key":"6_CR11","doi-asserted-by":"crossref","unstructured":"Cheon, J.H., Han, K., Kim, A., Kim, M., Song, Y.: A full RNS variant of approximate homomorphic encryption. In: SAC 2018, pp. 347\u2013368 (2018)","DOI":"10.1007\/978-3-030-10970-7_16"},{"key":"6_CR12","unstructured":"Cheon, J.H., Han, K., Kim, A., Kim, M., Song, Y.: RNSHEAAN (2018). https:\/\/github.com\/KyoohyungHan\/FullRNS-HEAAN"},{"key":"6_CR13","unstructured":"Cheon, J.H., Kim, A., Kim, M., Song, Y.: HEAAN (2016). https:\/\/github.com\/snucrypto\/HEAAN"},{"key":"6_CR14","doi-asserted-by":"crossref","unstructured":"Cheon, J.H., Kim, A., Kim, M., Song, Y.: Homomorphic encryption for arithmetic of approximate numbers. In: ASIACRYPT 2017, pp. 409\u2013437 (2017)","DOI":"10.1007\/978-3-319-70694-8_15"},{"key":"6_CR15","unstructured":"Cohen, R., Frankle, J., Goldwasser, S., Shaul, H., Vaikuntanathan, V.: How to trade efficiency and accuracy using fault-tolerant computations over the reals (2019). https:\/\/crypto.iacr.org\/2019\/affevents\/ppml\/page.html"},{"key":"6_CR16","doi-asserted-by":"crossref","unstructured":"Curtis, B.R., Player, R.: On the feasibility and impact of standardising sparse-secret LWE parameter sets for homomorphic encryption. In: WAHC 2019, pp. 1\u201310 (2019)","DOI":"10.1145\/3338469.3358940"},{"key":"6_CR17","first-page":"144","volume":"2012","author":"J Fan","year":"2012","unstructured":"Fan, J., Vercauteren, F.: Somewhat practical fully homomorphic encryption. IACR Cryptol. ePrint Arch. 2012, 144 (2012)","journal-title":"IACR Cryptol. ePrint Arch."},{"key":"6_CR18","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":"6_CR19","doi-asserted-by":"crossref","unstructured":"Halevi, S., Polyakov, Y., Shoup, V.: An improved RNS variant of the BFV homomorphic encryption scheme. In: CT-RSA 2019, pp. 83\u2013105 (2019)","DOI":"10.1007\/978-3-030-12612-4_5"},{"key":"6_CR20","unstructured":"Halevi, S., Shoup, V.: HElib (2014). https:\/\/github.com\/homenc\/HElib"},{"key":"6_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"364","DOI":"10.1007\/978-3-030-40186-3_16","volume-title":"Topics in Cryptology \u2013 CT-RSA 2020","author":"K Han","year":"2020","unstructured":"Han, K., Ki, D.: Better bootstrapping for approximate homomorphic encryption. In: Jarecki, S. (ed.) CT-RSA 2020. LNCS, vol. 12006, pp. 364\u2013390. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-40186-3_16"},{"issue":"4","key":"6_CR22","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. Genomics 11(4), 83 (2018)","journal-title":"BMC Med. Genomics"},{"issue":"7","key":"6_CR23","first-page":"1","volume":"13","author":"M Kim","year":"2020","unstructured":"Kim, M., Song, Y., Li, B., Micciancio, D.: Semi-parallel logistic regression for GWAS on encrypted data. BMC Med. Genomics 13(7), 1\u201313 (2020)","journal-title":"BMC Med. Genomics"},{"key":"6_CR24","doi-asserted-by":"crossref","unstructured":"Lee, J.W., Lee, E., Lee, Y., Kim, Y.S., No, J.S.: High-precision bootstrapping of rns-ckks homomorphic encryption using optimal minimax polynomial approximation and inverse sine function. In: EUROCRYPT 2021, pp. 618\u2013647 (2021)","DOI":"10.1007\/978-3-030-77870-5_22"},{"key":"6_CR25","unstructured":"Li, B., Micciancio, D.: On the security of homomorphic encryption on approximate numbers. Cryptology ePrint Archive, Report 2020\/1533 (2020)"},{"key":"6_CR26","unstructured":"Microsoft SEAL (2020). https:\/\/github.com\/Microsoft\/SEAL"},{"key":"6_CR27","doi-asserted-by":"crossref","unstructured":"Son, Y., Cheon, J.H.: Revisiting the hybrid attack on sparse secret LWE and application to HE parameters. In: WAHC 2019, pp. 11\u201320 (2019)","DOI":"10.1145\/3338469.3358941"},{"key":"6_CR28","unstructured":"Song, Y.: The CKKS (a.k.a. HEAAN) FHE scheme (2020). https:\/\/simons.berkeley.edu\/talks\/heaan-fhe"}],"container-title":["Lecture Notes in Computer Science","Topics in Cryptology \u2013 CT-RSA 2022"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-95312-6_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,13]],"date-time":"2024-03-13T11:24:30Z","timestamp":1710329070000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-95312-6_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783030953119","9783030953126"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-95312-6_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"29 January 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CT-RSA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Cryptographers\u2019 Track at the RSA Conference","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"San Francisco, 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":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7 February 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 February 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ctrsa2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/ct-rsa-2022.auckland.ac.nz\/","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":"87","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":"24","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":"28% - 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","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":"6","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)"}}]}}