Secure large-scale genome-wide association studies using homomorphic encryption
Open accessThe DOI matches its Crossref record; 4 of the 4 references it cites were found in a registry or an index.
Abstract
Genome-wide association studies (GWASs) seek to identify genetic variants associated with a trait, and have been a powerful approach for understanding complex diseases. A critical challenge for GWASs has been the dependence on individual-level data that typically have strict privacy requirements, creating an urgent need for methods that preserve the individual-level privacy of participants. Here, we present a privacy-preserving framework based on several advances in homomorphic encryption and demonstrate that it can perform an accurate GWAS analysis for a real dataset of more than 25,000 individuals, keeping all individual data encrypted and requiring no user interactions. Our extrapolations show that it can evaluate GWASs of 100,000 individuals and 500,000 single-nucleotide polymorphisms (SNPs) in 5.6 h on a single server node (or in 11 min on 31 server nodes running in parallel). Our performance results are more than one order of magnitude faster than prior state-of-the-art results using secure multiparty computation, which requires continuous user interactions, with the accuracy of both solutions being similar. Our homomorphic encryption advances can also be applied to other domains where large-scale statistical analyses over encrypted data are needed.
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 3×
“Z. Brakerski, C. Gentry, V. Vaikuntanathan, “(leveled) fully homomorphic encryption without bootstrapping” in Proceedings of the 3rd Innovations in Theoretical Computer Science Conference, ITCS ’12 ( Association for Computing Machinery, New York, NY, 2012), pp. 309–325.”
MethodInfluentialHomomorphic 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
Fritsche, L. G., Igl, W., Bailey, J. N. C., Grassmann, F., Sengupta, S., Bragg-Gresham, J. L., Burdon, K. P., Hebbring, S. J., Wen, C., Gorski, M., et al. (2016) · Nature Genetics · doi:10.1038/ng.3448 · Cited by 1,544
Deriving genomic diagnoses without revealing patient genomes
Jagadeesh, K. A., Wu, D. J., Birgmeier, J. A., Boneh, D., & Bejerano, G. (2017) · Science · doi:10.1126/science.aam9710 · Cited by 134
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
“Blat et al. [212] propose a toolbox of optimized statistical techniques that leverage FHE in order to perform studies on reformulated genomic data and prove the viability of using homomorphic encryption on large-scale data.”
MethodF1: A Fast and Programmable Accelerator for Fully Homomorphic Encryption
Samardzic, N., Feldmann, A., Krastev, A., Devadas, S., Dreslinski, R., Peikert, C., & Sanchez, D. (2021) · MICRO-54: 54th Annual IEEE/ACM International Symposium on Microarchitecture · doi:10.1145/3466752.3480070 · Cited by 294
Approximate 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
“, in machine learning for genomics [5, 6, 23, 24].”
Self-citationCOLLAGENE enables privacy-aware federated and collaborative genomic data analysis
Li, W., Kim, M., Zhang, K., Chen, H., Jiang, X., & Harmanci, A. (2023) · Genome Biology · doi:10.1186/s13059-023-03039-z · Cited by 16
“Lattigo [55], Palisade [56, 57], and MK-TFHE [58] are libraries that provide the programming interfaces to use threshold and multi-key-based collaborative tool development.”
Background
Metadata
- Authors
- Blatt, M., Gusev, A., Polyakov, Y., & Goldwasser, S.
- Venue
- Proceedings of the National Academy of Sciences
- Published
- 2020-05-12
- Volume
- 117
- Issue
- 21
- Pages
- 11608-11613
- ISSN
- 0027-8424 (ISSN-L)
- 1091-6490
- OpenAlex
- W3024430195
- Cited by
- 126
- References
- 4
- FWCI
- 6.35
- Type
- journal article
- Language
- en
- Open access
- green
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: Secure large-scale genome-wide association studies using homomorphic encryption. https://app.cochat.ai/papers/10.1073/pnas.1918257117
- The paper
- Blatt, M., Gusev, A., Polyakov, Y., & Goldwasser, S. (2020). Secure large-scale genome-wide association studies using homomorphic encryption. Proceedings of the National Academy of Sciences. https://doi.org/10.1073/pnas.1918257117
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.