Balancing Security and Privacy in Genomic Range Queries

Balancing Security and Privacy in Genomic Range Queries
复制标题

DOI:
10.1145/3575796
复制
发表时间:
2022-12
影响因子:
2.3
通讯作者:
Seoyeon Hwang;Ercan Ozturk;G. Tsudik
Seoyeon Hwang;Ercan Ozturk;G. Tsudik
中科院分区:
计算机科学4区
文献类型:
--
作者:
Seoyeon Hwang;Ercan Ozturk;G. Tsudik

文献摘要

相似文献

基因组测序方面令人兴奋的最新进展,加上存储和计算成本的大幅降低,使得基因组测试越来越容易为个人所接受。如今,一个人的数字化 DNA 可以很容易地从测序实验室获得,然后通过与测试设施合作来进行大量测试。由于遗传物质固有的敏感性以及基因组测试通常的专有性质,隐私是一个自然且至关重要的问题。虽然基因组隐私受到研究界内外的广泛关注,但基因组安全性尚未得到充分研究。这是令人惊讶的,因为使用虚假或改变的基因组可能会产生严重后果,例如错误的药物处方和基因测试结果。不幸的是,在基因组领域,隐私和安全(经常发生)是相互矛盾的。在本文中,我们尝试通过设计一种新技术,在基因组测试设施和个人用户之间建立安全且私密的基因组范围查询协议,从而协调基因组测试中的安全性和隐私性。所提出的技术确保用户提供的基因组材料的真实性和完整性,同时通过仅发布最少的内容来维护其隐私。为了确认其广泛的可用性,我们展示了如何将所提出的技术应用于先前提出的基因组私有子串匹配协议。实验表明,所提出的技术具有良好的性能并且非常实用。此外,我们将基因组范围查询问题推广到稀疏整数集并讨论潜在的用例。
Exciting recent advances in genome sequencing, coupled with greatly reduced storage and computation costs, make genomic testing increasingly accessible to individuals. Already today, one’s digitized DNA can be easily obtained from a sequencing lab and later used to conduct numerous tests by engaging with a testing facility. Due to the inherent sensitivity of genetic material and the often-proprietary nature of genomic tests, privacy is a natural and crucial issue. While genomic privacy received a great deal of attention within and outside the research community, genomic security has not been sufficiently studied. This is surprising since the usage of fake or altered genomes can have grave consequences, such as erroneous drug prescriptions and genetic test outcomes. Unfortunately, in the genomic domain, privacy and security (as often happens) are at odds with each other. In this article, we attempt to reconcile security with privacy in genomic testing by designing a novel technique for a secure and private genomic range query protocol between a genomic testing facility and an individual user. The proposed technique ensures authenticity and completeness of user-supplied genomic material while maintaining its privacy by releasing only the minimum thereof. To confirm its broad usability, we show how to apply the proposed technique to a previously proposed genomic private substring matching protocol. Experiments show that the proposed technique offers good performance and is quite practical. Furthermore, we generalize the genomic range query problem to sparse integer sets and discuss potential use cases.