首页> 外文会议> >Secure Sequence Similarity Search on Encrypted Genomic Data
【24h】

Secure Sequence Similarity Search on Encrypted Genomic Data

机译:加密基因组数据的安全序列相似性搜索

获取原文
获取原文并翻译 | 示例

摘要

Genomic data is being produced rapidly by both individuals and enterprises and needs to be outsourced from local machines to a cloud for better flexibility. Outsourcing also eliminates the local storage management problem for data owners. However, sensitive data must be encrypted by data owners before outsourcing to protect data privacy and security in the cloud. As genome data is huge in volume, it is challenging to execute researchers' query securely and efficiently. In this paper, we present a prefix tree based indexing algorithm for supporting similar sequence search query. We support Hamming distance as similarity measure. The proposed method adopts semi-honest adversary model for the cloud server. The security of the shared data is guaranteed through encryption while making the overall computation fast and scalable enough for real-life biomedical applications. We evaluated the efficiency of our proposed model on a database of Single-Nucleotide Polymorphism (SNP) sequences and experimental results demonstrate that a query of hamming distance k = 2 in a database of 10000 records, where each record contains 500 nucleotides, takes approximately 4 minutes.
机译:个人和企业都在快速生成基因组数据,需要将其从本地计算机外包到云中以提高灵活性。外包还消除了数据所有者的本地存储管理问题。但是,敏感数据必须在外包之前由数据所有者加密,以保护云中的数据隐私和安全性。由于基因组数据量巨大,因此安全有效地执行研究人员的查询具有挑战性。在本文中,我们提出了一种基于前缀树的索引算法,以支持类似的序列搜索查询。我们支持汉明距离作为相似性度量。所提出的方法对云服务器采用半诚实的对手模型。共享数据的安全性通过加密得到保证,同时使整个计算速度和可伸缩性足以满足现实生活中的生物医学应用。我们在单核苷酸多态性(SNP)序列数据库上评估了我们提出的模型的效率,实验结果表明,在10000条记录的数据库中查询汉明距离k = 2的查询,其中每条记录包含500个核苷酸,大约需要4个核苷酸分钟。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号