4.7 Article

Identifying genetic relatives without compromising privacy

Journal

GENOME RESEARCH
Volume 24, Issue 4, Pages 664-672

Publisher

COLD SPRING HARBOR LAB PRESS, PUBLICATIONS DEPT
DOI: 10.1101/gr.153346.112

Keywords

-

Funding

  1. National Science Foundation (NSF) grants [0513612, 0731455, 0729049, 0916676, 1320589]
  2. National Institutes of Health (NIH) [K25-HL080079, U01-DA024417, P01-HL30568, PO1-HL28481]
  3. NIH [2T32NS048004-06A1]
  4. NSF [1065276, 1136174, 0916574, 0830803]
  5. Xerox faculty research award
  6. DARPA/ONR PROCEED award
  7. NINDS Informatics Center for Neurogenetics and Neurogenomics [P30 NS062691]
  8. Defense Advanced Research Projects Agency through the U.S. Office of Naval Research [N00014-11-10389]
  9. Direct For Computer & Info Scie & Enginr [1320589, 1065276] Funding Source: National Science Foundation
  10. Direct For Computer & Info Scie & Enginr
  11. Div Of Information & Intelligent Systems [0916676, 0731455, 0513612] Funding Source: National Science Foundation
  12. Div Of Information & Intelligent Systems [1065276, 1320589] Funding Source: National Science Foundation

Ask authors/readers for more resources

The development of high-throughput genomic technologies has impacted many areas of genetic research. While many applications of these technologies focus on the discovery of genes involved in disease from population samples, applications of genomic technologies to an individual's genome or personal genomics have recently gained much interest. One such application is the identification of relatives from genetic data. In this application, genetic information from a set of individuals is collected in a database, and each pair of individuals is compared in order to identify genetic relatives. An inherent issue that arises in the identification of relatives is privacy. In this article, we propose a method for identifying genetic relatives without compromising privacy by taking advantage of novel cryptographic techniques customized for secure and private comparison of genetic information. We demonstrate the utility of these techniques by allowing a pair of individuals to discover whether or not they are related without compromising their genetic information or revealing it to a third party. The idea is that individuals only share enough special-purpose cryptographically protected information with each other to identify whether or not they are relatives, but not enough to expose any information about their genomes. We show in HapMap and 1000 Genomes data that our method can recover first-and second-order genetic relationships and, through simulations, show that our method can identify relationships as distant as third cousins while preserving privacy.

Authors

I am an author on this paper
Click your name to claim this paper and add it to your profile.

Reviews

Primary Rating

4.7
Not enough ratings

Secondary Ratings

Novelty
-
Significance
-
Scientific rigor
-
Rate this paper

Recommended

No Data Available
No Data Available