High-Precision Bootstrapping for Approximate Homomorphic Encryption by Error Variance Minimization
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Lee, Y. | - |
dc.contributor.author | Lee, J.-W. | - |
dc.contributor.author | Kim, Y.-S. | - |
dc.contributor.author | Kim, Y. | - |
dc.contributor.author | No, J.-S. | - |
dc.contributor.author | Kang, H.C. | - |
dc.date.accessioned | 2023-03-08T06:57:27Z | - |
dc.date.available | 2023-03-08T06:57:27Z | - |
dc.date.issued | 2022-05 | - |
dc.identifier.issn | 0302-9743 | - |
dc.identifier.issn | 1611-3349 | - |
dc.identifier.uri | https://scholarworks.bwise.kr/cau/handle/2019.sw.cau/61329 | - |
dc.description.abstract | The Cheon-Kim-Kim-Song (CKKS) scheme (Asiacrypt’17) is one of the most promising homomorphic encryption (HE) schemes as it enables privacy-preserving computing over real (or complex) numbers. It is known that bootstrapping is the most challenging part of the CKKS scheme. Further, homomorphic evaluation of modular reduction is the core of the CKKS bootstrapping. As modular reduction is not represented by the addition and multiplication of complex numbers, approximate polynomials for modular reduction should be used. The best-known techniques (Eurocrypt’21) use a polynomial approximation for trigonometric functions and their composition. However, all the previous methods are based on an indirect approximation, and thus it requires lots of multiplicative depth to achieve high accuracy. This paper proposes a direct polynomial approximation of modular reduction for CKKS bootstrapping, which is optimal in error variance and depth. Further, we propose an efficient algorithm, namely the lazy baby-step giant-step (BSGS) algorithm, to homomorphically evaluate the approximate polynomial, utilizing the lazy relinearization/rescaling technique. The lazy-BSGS reduces the computational complexity by half compared to the ordinary BSGS algorithm. The performance improvement for the CKKS scheme by the proposed algorithm is verified by implementation using HE libraries. The implementation results show that the proposed method has a multiplicative depth of 10 for modular reduction to achieve the state-of-the-art accuracy, while the previous methods have depths of 11 to 12. Moreover, we achieve higher accuracy within a small multiplicative depth, for example, 93-bit within multiplicative depth 11. | - |
dc.format.extent | 30 | - |
dc.language | 영어 | - |
dc.language.iso | ENG | - |
dc.publisher | Springer Science and Business Media Deutschland GmbH | - |
dc.title | High-Precision Bootstrapping for Approximate Homomorphic Encryption by Error Variance Minimization | - |
dc.type | Article | - |
dc.identifier.doi | 10.1007/978-3-031-06944-4_19 | - |
dc.identifier.bibliographicCitation | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), v.13275 LNCS, pp 551 - 580 | - |
dc.description.isOpenAccess | N | - |
dc.identifier.wosid | 000810488300019 | - |
dc.identifier.scopusid | 2-s2.0-85131911526 | - |
dc.citation.endPage | 580 | - |
dc.citation.startPage | 551 | - |
dc.citation.title | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) | - |
dc.citation.volume | 13275 LNCS | - |
dc.type.docType | Proceedings Paper | - |
dc.publisher.location | 미국 | - |
dc.subject.keywordAuthor | Bootstrapping | - |
dc.subject.keywordAuthor | Cheon-Kim-Kim-Song (CKKS) scheme | - |
dc.subject.keywordAuthor | Fully homomorphic encryption (FHE) | - |
dc.subject.keywordAuthor | Privacy-preserving machine learning (PPML) | - |
dc.subject.keywordAuthor | Signal-to-noise ratio (SNR) | - |
dc.relation.journalResearchArea | Computer Science | - |
dc.relation.journalResearchArea | Mathematics | - |
dc.relation.journalWebOfScienceCategory | Computer Science, Information Systems | - |
dc.relation.journalWebOfScienceCategory | Computer Science, Theory & Methods | - |
dc.relation.journalWebOfScienceCategory | Mathematics, Applied | - |
dc.description.journalRegisteredClass | scopus | - |
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.
84, Heukseok-ro, Dongjak-gu, Seoul, Republic of Korea (06974)02-820-6194
COPYRIGHT 2019 Chung-Ang University All Rights Reserved.
Certain data included herein are derived from the © Web of Science of Clarivate Analytics. All rights reserved.
You may not copy or re-distribute this material in whole or in part without the prior written consent of Clarivate Analytics.