Secure genome-wide association analysis using multiparty computation
Open accessThe DOI matches its Crossref record; 10 of the 10 references it cites were found in a registry or an index.
Abstract
Most sequenced genomes are currently stored in strict access-controlled repositories. Free access to these data could improve the power of genome-wide association studies (GWAS) to identify disease-causing genetic variants and aid the discovery of new drug targets. However, concerns over genetic data privacy may deter individuals from contributing their genomes to scientific studies and could prevent researchers from sharing data with the scientific community. Although cryptographic techniques for secure data analysis exist, none scales to computationally intensive analyses, such as GWAS. Here we describe a protocol for large-scale genome-wide analysis that facilitates quality control and population stratification correction in 9K, 13K, and 23K individuals while maintaining the confidentiality of underlying genotypes and phenotypes. We show the protocol could feasibly scale to a million individuals. This approach may help to make currently restricted data available to the scientific community and could potentially enable secure genome crowdsourcing, allowing individuals to contribute their genomes to a study without compromising their privacy.
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
Sudlow, C., Gallacher, J., Allen, N., Beral, V., Burton, P., Danesh, J., Downey, P., Elliott, P., Green, J., Landray, M., et al. (2015) · PLOS Medicine · doi:10.1371/journal.pmed.1001779 · Cited by 12,728 · cited 2×
“A complete protocol description is provided in Supplementary Notes 1–9.”
Principal components analysis corrects for stratification in genome-wide association studies
Price, A. L., Patterson, N. J., Plenge, R. M., Weinblatt, M. E., Shadick, N. A., & Reich, D. (2006) · Nature Genetics · doi:10.1038/ng1847 · Cited by 10,248 · cited 2×
“A widely used procedure for accounting for such confounding is to use principal component analysis (PCA) to capture broad patterns of genetic variation in the data 24 .”
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×
“Alternative cryptographic frameworks for secure computation, such as homomorphic encryption 13 or garbled circuits 14 , currently impose an overwhelming computational burden —many years of computation or petabytes of communication at the scale of a million genomes (Supplementary Note 11)—and are…”
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
Multiparty Computation from Somewhat Homomorphic Encryption
Damgård, I., Pastro, V., Smart, N., & Zakarias, S. (2012) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-32009-5_38 · Cited by 1,331 · cited 1×
“Next, if we require security against malicious parties (who may deviate from the protocol description) during the online computation, we can take the approach by SPDZ 27 and include a message authentication code (MAC) with each message.”
Million Veteran Program: A mega-biobank to study genetic influences on health and disease
Gaziano, J. M., Concato, J., Brophy, M., Fiore, L., Pyarajan, S., Breeling, J., Whitbourne, S., Deen, J., Shannon, C., Humphries, D., et al. (2016) · Journal of Clinical Epidemiology · doi:10.1016/j.jclinepi.2015.09.016 · Cited by 1,055
Chen, Z., Chen, J., Collins, R., Guo, Y., Peto, R., Wu, F., Li, L., & on behalf of the China Kadoorie Biobank (CKB) collaborative group (2011) · International Journal of Epidemiology · doi:10.1093/ije/dyr120 · Cited by 1,034 · cited 2×
“First, we generalize a core MPC technique known as ‘Beaver multiplication triples’, which was initially developed for secure multiplication, to efficiently evaluate arithmetic circuits (Supplementary Note 3).”
Secure Multiparty Computation and Secret Sharing
Cramer, R., Damgård, I. B., & Nielsen, J. B. (2015) · doi:10.1017/cbo9781107337756 · Cited by 595
Privacy risks from genomic data-sharing beacons
Shringarpure, S. S., & Bustamante, C. D. (2015) · The American Journal of Human Genetics · doi:10.1016/j.ajhg.2015.09.010 · Cited by 211
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 1×
“For example, recent work by Jagadeesh et al. 22 , which introduces privacy-preserving rare variant analysis based on a type of MPC technique known as garbled circuits 14 , is limited to simple Boolean operations and is not applicable to large-scale GWAS, as noted in their work.”
Self-citation
Cited by
Estimating the success of re-identifications in incomplete datasets using generative models
Rocher, L., Hendrickx, J. M., & de Montjoye, Y.-A. (2019) · Nature Communications · doi:10.1038/s41467-019-10933-3 · Cited by 816
“…risk of re-identi fi cation and the lack of plausible deniability — even if the dataset is incomplete — , as well as legally recognize the broad range of provable privacy-enhancing systems and security measures that would allow data to be used while effectively preserving people ’ s privacy 54,55 .”
BackgroundPrivacy challenges and research opportunities for genomic data sharing
Bonomi, L., Huang, Y., & Ohno-Machado, L. (2020) · Nature Genetics · doi:10.1038/s41588-020-0651-0 · Cited by 285
Data Integration Challenges for Machine Learning in Precision Medicine
Martínez-García, M., & Hernández-Lemus, E. (2022) · Frontiers in Medicine · doi:10.3389/fmed.2021.784455 · Cited by 185
POSEIDON: Privacy-Preserving Federated Neural Network Learning
Sav, S., Pyrgelis, A., Troncoso-Pastoriza, J. R., Froelicher, D., Bossuat, J.-P., Sousa, J. S., & Hubaux, J.-P. (2021) · Proceedings 2021 Network and Distributed System Security Symposium · doi:10.14722/ndss.2021.24119 · Cited by 162
Realizing private and practical pharmacological collaboration
Hie, B., Cho, H., & Berger, B. (2018) · Science · doi:10.1126/science.aat4807 · Cited by 76
Self-citation
Metadata
- Authors
- Cho, H., Wu, D. J., & Berger, B.
- Venue
- Nature Biotechnology
- Published
- 2018-05-07
- Volume
- 36
- Issue
- 6
- Pages
- 547-551
- ISSN
- 0733-222X (ISSN-L)
- 1087-0156
- 1546-1696
- OpenAlex
- W2800679800
- Cited by
- 207
- References
- 10
- FWCI
- 11.60
- 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
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.