Searchable Encryption Scheme of Genomic Data Based on Suffix Tree

被引：0
|
作者：
Qin S.-Y. [1 ]
Zhou F.-C. [2 ]
Liu L. [2 ]
机构：
[1] School of Computer Science & Engineering, Northeastern University, Shenyang
[2] School of Software, Northeastern University, Shenyang
来源：
Dongbei Daxue Xuebao/Journal of Northeastern University | 2019年 / 40卷 / 04期
关键词：
Genomic data; Modern medicine; Searchable encryption; Substring search; Suffix tree;
D O I：
10.12068/j.issn.1005-3026.2019.04.002
中图分类号：
学科分类号：
摘要：
A searchable encryption scheme that specifically supports genetic data was proposed to protect users from privacy risks. The existing searchable encryption schemes only support keywords search, they cannot be applied to genetic data without keywords. 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. © 2019, Editorial Department of Journal of Northeastern University. All right reserved.
引用
收藏
页码：461 / 466
页数：5
相关论文
共 13 条
  • [1] Erlich Y., Narayanan A., Routes for breaching and protecting genetic privacy, Nature Reviews Genetics, 15, 6, pp. 409-421, (2014)
  • [2] Cao N., Wang C., Li M., Et al., Privacy-preserving multi-keyword ranked search over encrypted cloud data, IEEE Conference on Computer Communications, pp. 829-837, (2011)
  • [3] Wang B., Yu S., Lou W., Et al., Privacy-preserving multi-keyword fuzzy search over encrypted data in the cloud, IEEE Conference on Computer Communications, pp. 2112-2120, (2014)
  • [4] Lu W., Yamada Y., Sakuma J., Efficient secure outsourcing of genome-wide association studies, 2015 IEEE Security and Privacy Workshops, pp. 3-6, (2015)
  • [5] Chase M., Shen E., Substring searchable symmetric encryption, Proceedings on Privacy Enhancing Technologies, 2015, 2, pp. 263-281, (2015)
  • [6] Ayday E., Raisaro J.L., Hengartner U., Et al., Privacy preserving processing of raw genomic data, International Workshop on Data Privacy Management and Autonomous Spontaneous Security, pp. 133-147, (2013)
  • [7] Riazi M.S., Dantu N.K.R., Gattu L.N.V., Et al., GenMatch: secure DNA compatibility testing, IEEE International Symposium on Hardware-Oriented Security and Trust(HOST), pp. 248-253, (2016)
  • [8] Simmons S., Berger B., Realizing privacy preserving genome-wide association studies, Bioinformatics, 32, 9, pp. 1293-1300, (2016)
  • [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, Bioinformatics, 33, 23, pp. 3716-3725, (2017)
  • [10] Wang B., Song W., Lou W., Et al., Privacy-preserving pattern matching over encrypted genetic data in cloud computing, IEEE Conference on Computer Communications, pp. 1-9, (2017)
12