Accurate filtering of privacy-sensitive information in raw genomic data

被引:8
作者
Decouchant, Jeremie [1 ]
Fernandes, Maria [1 ]
Volp, Marcus [1 ]
Couto, Francisco M. [2 ]
Esteves-Verissimo, Paulo [1 ]
机构
[1] Univ Luxembourg, SnT Interdisciplinary Ctr Secur Reliabil & Trust, Luxembourg, Luxembourg
[2] Univ Lisbon, Fac Ciencias, Dept Informat, LASIGE, Lisbon, Portugal
关键词
Filtering; Raw genomic data; Privacy; RECORD LINKAGE; READ ALIGNMENT; DNA-SEQUENCES; ALGORITHM; ANONYMITY; ISSUES;
D O I
10.1016/j.jbi.2018.04.006
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
Sequencing thousands of human genomes has enabled breakthroughs in many areas, among them precision medicine, the study of rare diseases, and forensics. However, mass collection of such sensitive data entails enormous risks if not protected to the highest standards. In this article, we follow the position and argue that post-alignment privacy is not enough and that data should be automatically protected as early as possible in the genomics workflow, ideally immediately after the data is produced. We show that a previous approach for filtering short reads cannot extend to long reads and present a novel filtering approach that classifies raw genomic data (i.e., whose location and content is not yet determined) into privacy-sensitive (i.e., more affected by a successful privacy attack) and non-privacy-sensitive information. Such a classification allows the fine-grained and automated adjustment of protective measures to mitigate the possible consequences of exposure, in particular when relying on public clouds. We present the first filter that can be indistinctly applied to reads of any length, i.e., making it usable with any recent or future sequencing technologies. The filter is accurate, in the sense that it detects all known sensitive nucleotides except those located in highly variable regions (less than 10 nucleotides remain undetected per genome instead of 100,000 in previous works). It has far less false positives than previously known methods (10% instead of 60%) and can detect sensitive nucleotides despite sequencing errors (86% detected instead of 56% with 2% of mutations). Finally, practical experiments demonstrate high performance, both in terms of throughput and memory consumption.
引用
收藏
页码:1 / 12
页数:12
相关论文
共 61 条
[1]   Privacy preserving processing of genomic data: A survey [J].
Akgun, Mete ;
Bayrak, A. Osman ;
Ozer, Bugra ;
Sagiroglu, M. Samil .
JOURNAL OF BIOMEDICAL INFORMATICS, 2015, 56 :103-111
[2]   Challenges for biomedical informatics and pharmacogenomics [J].
Altman, RB ;
Klein, TE .
ANNUAL REVIEW OF PHARMACOLOGY AND TOXICOLOGY, 2002, 42 :113-133
[3]   BASIC LOCAL ALIGNMENT SEARCH TOOL [J].
ALTSCHUL, SF ;
GISH, W ;
MILLER, W ;
MYERS, EW ;
LIPMAN, DJ .
JOURNAL OF MOLECULAR BIOLOGY, 1990, 215 (03) :403-410
[4]  
[Anonymous], 2003, Internet Mathematics, DOI DOI 10.1080/15427951.2004.10129096
[5]  
Appleby A., 2008, MURMURHASH 2 0
[6]  
Atallah M.J., 2003, ACM WPES 2003, P39
[7]   Privacy-Preserving Processing of Raw Genomic Data [J].
Ayday, Erman ;
Raisaro, Jean Louis ;
Hengartner, Urs ;
Molyneaux, Adam ;
Hubaux, Jean-Pierre .
DATA PRIVACY MANAGEMENT AND AUTONOMOUS SPONTANEOUS SECURITY, DPM 2013, 2014, 8247 :133-147
[8]  
Backes M., 2016, ACM CCS
[9]  
Baron J., 2012, 5PM SECURE PATTERN M, P222
[10]   SPACE/TIME TRADE/OFFS IN HASH CODING WITH ALLOWABLE ERRORS [J].
BLOOM, BH .
COMMUNICATIONS OF THE ACM, 1970, 13 (07) :422-&