基于后缀树的基因数据可搜索加密方法
详细信息    查看全文 | 推荐本文 |
  • 英文篇名:Searchable Encryption Scheme of Genomic Data Based on Suffix Tree
  • 作者:秦诗悦 ; 周福才 ; 柳璐
  • 英文作者:QIN Shi-yue;ZHOU Fu-cai;LIU Lu;School of Computer Science & Engineering,Northeastern University;School of Softw are,Northeastern University;
  • 关键词:基因数据 ; 后缀树 ; 可搜索加密 ; 子字符串搜索 ; 现代医疗
  • 英文关键词:genomic data;;suffix tree;;searchable encryption;;substring search;;modern medicine
  • 中文刊名:DBDX
  • 英文刊名:Journal of Northeastern University(Natural Science)
  • 机构:东北大学计算机科学与工程学院;东北大学软件学院;
  • 出版日期:2019-04-10
  • 出版单位:东北大学学报(自然科学版)
  • 年:2019
  • 期:v.40;No.343
  • 基金:国家自然科学基金资助项目(61772127,61872069);; 中央高校基本科研业务费专项资金资助项目(N151704002)
  • 语种:中文;
  • 页:DBDX201904002
  • 页数:6
  • CN:04
  • ISSN:21-1344/T
  • 分类号:8-13
摘要
为保障用户免遭侵犯隐私的风险,提出了一种特别支持基因数据的可搜索加密方法.针对目前密文搜索方案大多数仅支持通过关键字进行搜索,而无法用于不含关键字的基因数据的问题,利用后缀树和伪随机函数等密码学原语构建安全索引,实现对密文基因数据的任意子字符串搜索.安全性证明该方法满足动态自适应安全,利用理论分析和真实数据对效率进行测评.该方法可以对基因数据进行高效安全的任意子字符串搜索,保护数据完整性和隐私性,在个性化医疗大众化的环境下具备广阔的应用前景.
        A searchable encryption scheme that specifically supports genetic data was proposed to protect users from privacy risks. The existing searchable encryption schemes only support keyw ords search,they cannot be applied to genetic data w ithout keyw ords. So,a security index using cryptographic primitives such as suffix trees and pseudo-random functions was constructed to implement arbitrary substring searches for ciphertext genomic data. The safety proof indicated that the method satisfies the dynamic adaptive security,and the efficiency is evaluated by both theoretical analysis and real data. This scheme can perform efficient and safe arbitrary substring search on genomic data,protect data integrity and privacy and has broad application prospects in the environment of personalized medical popularization.
引文
[1]Erlich Y,Narayanan A. Routes for breaching and protecting genetic privacy[J]. Nature Reviews Genetics,2014,15(6):409-421.
    [2]Cao N,Wang C,Li M,et al. Privacy-preserving multi-keyword ranked search over encrypted cloud data[C]//IEEE Conference on Computer Communications. Piscataway:IEEE,2011:829-837.
    [3]Wang B,Yu S,Lou W,et al. Privacy-preserving multi-keyword fuzzy search over encrypted data in the cloud[C]//IEEE Conference on Computer Communications. Piscataway:IEEE,2014:2112-2120.
    [4]Lu W,Yamada Y,Sakuma J. Efficient secure outsourcing of genome-wide association studies[C]//2015 IEEE Security and Privacy Workshops. Los Alamitos:IEEE,2015:3-6.
    [5]Chase M,Shen E. Substring searchable symmetric encryption[J]. Proceedings on Privacy Enhancing Technologies,2015,2015(2):263-281.
    [6]Ayday E,Raisaro J L,Hengartner U,et al. Privacy preserving processing of raw genomic data[C]//International Workshop on Data Privacy Management and Autonomous Spontaneous Security. New York:Springer-Verlag,2013:133-147.
    [7]Riazi M S,Dantu N K R,Gattu L N V,et al. Gen Match:secure DNA compatibility testing[C]//IEEE International Symposium on Hardware-Oriented Security and Trust(HOST). Piscataway:IEEE,2016:248-253.
    [8]Simmons S,Berger B. Realizing privacy preserving genomewide association studies[J]. Bioinformatics,2016,32(9):1293-1300.
    [9]Wang M,Ji Z,Wang S,et al. Mechanisms to protect the privacy of families when using the transmission disequilibrium test in genome-wide association studies[J]. Bioinformatics,2017,33(23):3716-3725.
    [10]Wang B,Song W,Lou W,et al. Privacy-preserving pattern matching over encrypted genetic data in cloud computing[C]//IEEE Conference on Computer Communications.Piscataway:IEEE,2017:1-9.
    [11]Weiner P. Linear pattern matching algorithms[C]//14th Annual Symposium on Switching Automata Theory. New York:IEEE,1973:1-11.
    [12]Mc Creight E M. A space-economical suffix tree construction algorithm[J]. Journal of the ACM,1976,23(2):262-272.
    [13]U. S. National Library of Medicine. National center for biotechnology information(NCBI):Gen Bank flat file release229. 0[DB/OL].[2018-11-15]. https://www. ncbi. nlm.nih. gov/genbank/.

© 2004-2018 中国地质图书馆版权所有 京ICP备05064691号 京公网安备11010802017129号

地址:北京市海淀区学院路29号 邮编:100083

电话:办公室:(+86 10)66554848;文献借阅、咨询服务、科技查新:66554700