The DOI matches its Crossref record; 3 of the 3 references it cites were found in a registry or an index.
Better Bootstrapping for Approximate Homomorphic Encryption
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Fully homomorphic encryption using ideal lattices
Gentry, C. (2009) · Proceedings of the forty-first annual ACM symposium on Theory of computing · doi:10.1145/1536414.1536440 · Cited by 6,806 · cited 1×
“After the Gentry’s first blueprint for a fully homomorphic encryption scheme [9], homomorphic encryption is regarded as one of the most important tools for privacy-preserving.”
BackgroundHomomorphic Encryption for Arithmetic of Approximate Numbers
Cheon, J. H., Kim, A., Kim, M., & Song, Y. (2017) · Lecture Notes in Computer Science · doi:10.1007/978-3-319-70694-8_15 · Cited by 2,522
Secure Logistic Regression Based on Homomorphic Encryption: Design and Evaluation
Kim, M., Song, Y., Wang, S., Xia, Y., & Jiang, X. (2018) · JMIR Medical Informatics · doi:10.2196/medinform.8805 · Cited by 257
Cited by
Privacy-Preserving Machine Learning With Fully Homomorphic Encryption for Deep Neural Network
Lee, J.-W., Kang, H., Lee, Y., Choi, W., Eom, J., Deryabin, M., Lee, E., Lee, J., Yoo, D., Kim, Y.-S., et al. (2022) · IEEE Access · doi:10.1109/access.2022.3159694 · Cited by 414
Survey on Fully Homomorphic Encryption, Theory, and Applications
Marcolla, C., Sucasas, V., Manzano, M., Bassoli, R., Fitzek, F. H. P., & Aaraj, N. (2022) · Proceedings of the IEEE · doi:10.1109/jproc.2022.3205665 · Cited by 323
“Also, the bootstrapping version [128] of CKKS was enhanced by Chen et al. [133], whereas Han and Ki [134] discussed and improved the bootstrapping version of [129].”
MethodApproximate Homomorphic Encryption with Reduced Approximation Error
Kim, A., Papadimitriou, A., & Polyakov, Y. (2022) · Lecture Notes in Computer Science · doi:10.1007/978-3-030-95312-6_6 · Cited by 71
“The hybrid key switching [22] is selected because it is more efficient than the GHS approach used in the original CKKS scheme [11,14] and incurs a smaller approximation error than the digit decomposition approach [9] for relatively large digits, which are often required for the efficient instantiation of this key swit…”
MethodInfluential
Metadata
- Authors
- Han, K., & Ki, D.
- Venue
- Lecture Notes in Computer Science
- Publisher
- Springer International Publishing
- Published
- 2020
- Volume
- 2019
- Pages
- 364-390
- ISSN
- 0302-9743 (ISSN-L)
- 1611-3349
- OpenAlex
- W2955685807
- Cited by
- 193
- References
- 3
- FWCI
- 7.96
- Type
- conference paper
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.