{"id":{"repo_id":"mit","oai_identifier":"oai:dspace.mit.edu:1721.1/147439"},"canonical_url":"https://search.dev.ndltd.org/etd/mit/oai:dspace.mit.edu:1721.1/147439","repository":{"repo_id":"mit","name":"MIT","base_url":"https://dspace.mit.edu/oai/request"},"display":{"title":"SafeGENIE: Secure and federated linear mixed model association tests","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.","abstract_html":"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.","abstract_has_math":false,"creators":["Chen, Jeffrey"],"institution":"Massachusetts Institute of Technology","degree_name":"Master","degree_level":null,"degree_discipline":null,"degree_department":"Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science","school":null,"contributors":[],"advisors":["Berger, Bonnie","Cho, Hyunghoon"],"committee_chairs":[],"committee_members":[],"year":2022,"date_issued":"2022-09","date_published":"2022-09","updated_at":"2026-07-22T22:20:58Z","subjects":[],"languages":[],"rights":["In Copyright - Educational Use Permitted","Copyright MIT"],"rights_urls":["http://rightsstatements.org/page/InC-EDU/1.0/"],"identifier_entries":[]},"links":{"outbound_url":"https://hdl.handle.net/1721.1/147439","outbound_label":"Handle","outbound_source":"dc:identifier.uri"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor.advisor","label":"Advisor","values":["Berger, Bonnie","Cho, Hyunghoon"]},{"key":"dc:contributor.department","label":"Department","values":["Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science"]},{"key":"dc:creator","label":"Author","values":["Chen, Jeffrey"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date.accessioned","label":"Dc Date Accessioned","values":["2023-01-19T19:50:26Z"]},{"key":"dc:date.available","label":"Dc Date Available","values":["2023-01-19T19:50:26Z"]},{"key":"dc:date.issued","label":"Date","values":["2022-09"]},{"key":"dc:publisher","label":"Institution","values":["Massachusetts Institute of Technology"]},{"key":"dc:type","label":"Dc Type","values":["Thesis"]},{"key":"thesis:degree_name","label":"Degree Name","values":["Master","Master of Engineering in Electrical Engineering and Computer Science"]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:rights","label":"Dc Rights","values":["In Copyright - Educational Use Permitted","Copyright MIT"]},{"key":"dc:rights.uri","label":"Rights URI","values":["http://rightsstatements.org/page/InC-EDU/1.0/"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier.uri","label":"Identifier URI","values":["https://hdl.handle.net/1721.1/147439"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description.abstract","label":"Abstract","values":["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."]},{"key":"dc:description.degree","label":"Dc Description Degree","values":["M.Eng."]},{"key":"dc:title","label":"Title","values":["SafeGENIE: Secure and federated linear mixed model association tests"]}]}],"canonical_facts":{"dc:contributor.advisor":["Berger, Bonnie","Cho, Hyunghoon"],"dc:contributor.department":["Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science"],"dc:creator":["Chen, Jeffrey"],"dc:date.accessioned":["2023-01-19T19:50:26Z"],"dc:date.available":["2023-01-19T19:50:26Z"],"dc:date.issued":["2022-09"],"dc:description.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."],"dc:description.degree":["M.Eng."],"dc:identifier.uri":["https://hdl.handle.net/1721.1/147439"],"dc:publisher":["Massachusetts Institute of Technology"],"dc:rights":["In Copyright - Educational Use Permitted","Copyright MIT"],"dc:rights.uri":["http://rightsstatements.org/page/InC-EDU/1.0/"],"dc:title":["SafeGENIE: Secure and federated linear mixed model association tests"],"dc:type":["Thesis"],"thesis:degree_name":["Master","Master of Engineering in Electrical Engineering and Computer Science"]},"updated_at":"2026-07-22T22:20:58Z"}