Private genome analysis through homomorphic encryption
Open accessThe DOI matches its Crossref record; 3 of the 3 references it cites were found in a registry or an index.
Abstract
BACKGROUND: The rapid development of genome sequencing technology allows researchers to access large genome datasets. However, outsourcing the data processing o the cloud poses high risks for personal privacy. The aim of this paper is to give a practical solution for this problem using homomorphic encryption. In our approach, all the computations can be performed in an untrusted cloud without requiring the decryption key or any interaction with the data owner, which preserves the privacy of genome data. METHODS: We present evaluation algorithms for secure computation of the minor allele frequencies and χ2 statistic in a genome-wide association studies setting. We also describe how to privately compute the Hamming distance and approximate Edit distance between encrypted DNA sequences. Finally, we compare performance details of using two practical homomorphic encryption schemes--the BGV scheme by Gentry, Halevi and Smart and the YASHE scheme by Bos, Lauter, Loftus and Naehrig. RESULTS: The approach with the YASHE scheme analyzes data from 400 people within about 2 seconds and picks a variant associated with disease from 311 spots. For another task, using the BGV scheme, it took about 65 seconds to securely compute the approximate Edit distance for DNA sequences of size 5K and figure out the differences between them. CONCLUSIONS: The performance numbers for BGV are better than YASHE when homomorphically evaluating deep circuits (like the Hamming distance algorithm or approximate Edit distance algorithm). On the other hand, it is more efficient to use the YASHE scheme for a low-degree computation, such as minor allele frequencies or χ2 test statistic in a case-control study.
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×
“, [9-11]) permits encrypted data to be computed on without decryption, so it allows us to evaluate arbitrary arithmetic circuits over encrypted data.”
BackgroundPrivate predictive analysis on encrypted medical data
Bos, J. W., Lauter, K., & Naehrig, M. (2014) · Journal of Biomedical Informatics · doi:10.1016/j.jbi.2014.04.003 · Cited by 283 · cited 1×
“[15] applied HE to machine learning, and described how to privately conduct predictive analysis based on an encrypted learned model.”
MethodNaveed, M., Ayday, E., Clayton, E. W., Fellay, J., Gunter, C. A., Hubaux, J.-P., Malin, B. A., & Wang, X. (2015) · ACM Computing Surveys · doi:10.1145/2767007 · Cited by 261
Cited by
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, Kim and Lauter [110] proved that YASHE is better than BGV for a low-degree computation, but BGV is more efficient than YASHE for high circuit depths.”
BackgroundSecure Outsourced Matrix Computation and Application to Neural Networks
Jiang, X., Kim, M., Lauter, K., & Song, Y. (2018) · Proceedings of the 2018 ACM SIGSAC Conference on Computer and Communications Security · doi:10.1145/3243734.3243837 · Cited by 313
Self-citationA Systematic Review of Homomorphic Encryption and Its Contributions in Healthcare Industry
Munjal, K., & Bhatia, R. (2023) · Complex & Intelligent Systems · doi:10.1007/s40747-022-00756-z · Cited by 269
Machine learning and genomics: precision medicine versus patient privacy
Azencott, C.-A. (2018) · Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences · doi:10.1098/rsta.2017.0350 · Cited by 89
Wang, S., Jiang, X., Singh, S., Marmor, R., Bonomi, L., Fox, D., Dow, M., & Ohno‐Machado, L. (2017) · Annals of the New York Academy of Sciences · doi:10.1111/nyas.13259 · Cited by 78
Metadata
- Authors
- Kim, M., & Lauter, K.
- Venue
- BMC Medical Informatics and Decision Making
- Published
- 2015-12
- Volume
- 15
- Issue
- S5
- Pages
- S3-S3
- ISSN
- 1472-6947 (ISSN-L)
- OpenAlex
- W2201294065
- Cited by
- 136
- References
- 3
- FWCI
- 12.83
- Type
- journal article
- Language
- en
- Open access
- gold
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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Private genome analysis through homomorphic encryption. https://app.cochat.ai/papers/10.1186/1472-6947-15-s5-s3
- The paper
- Kim, M., & Lauter, K. (2015). Private genome analysis through homomorphic encryption. BMC Medical Informatics and Decision Making. https://doi.org/10.1186/1472-6947-15-s5-s3
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.