SafeGENIE: Secure and federated linear mixed model association tests
Name
Chen-ceff-meng-eecs-2022-thesis.pdf
Description
Thesis PDF
Size
1.4 MB
Format
Adobe PDF
Checksum (MD5)
07a995c5fec033096b5ecbd831e1f228
Author(s)
Chen, Jeffrey
Advisor(s)
Berger, Bonnie
Cho, Hyunghoon
Date Issued
September 2022
Publisher
Massachusetts Institute of Technology
Abstract
Privacy-preserving algorithms for genome-wide association studies (GWAS) promise to facilitate data sharing across silos to accelerate new discoveries. However, existing approaches do not support an important, prevalent class of methods known as linear mixed model (LMM) association tests or would provide limited privacy protection, due to the high computational burden of LMMs under existing secure computation frameworks. Here we introduce SafeGENIE, an efficient and provably secure algorithm for LMM-based association studies, which allows multiple entities to securely share their data to jointly compute association statistics without leaking any intermediary results. We overcome the computational burden of LMMs by leveraging recent advances in LMMs and secure computation, as well as a novel scalable dimensionality reduction technique. Our results show that SafeGENIE obtains accurate association test results comparable to a state-of-the-art centralized algorithm (REGENIE), and achieves practical runtimes even for large datasets of up to 100K individuals. Our work unlocks the promise of secure and distributed algorithms for collaborative genomic studies.
MIT Department
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Terms of Use
In Copyright - Educational Use Permitted
Copyright MIT
Persistent DSpace Link
