Journal of Northeastern University Natural Science ›› 2019, Vol. 40 ›› Issue (4): 461-466.DOI: 10.12068/j.issn.1005-3026.2019.04.002

• Information & Control • Previous Articles     Next Articles

Searchable Encryption Scheme of Genomic Data Based on Suffix Tree

QIN Shi-yue1, ZHOU Fu-cai2, LIU Lu2   

  1. 1. School of Computer Science & Engineering, Northeastern University, Shenyang 110169, China; 2. School of Software, Northeastern University, Shenyang 110169, China.
  • Received:2018-02-28 Revised:2018-02-28 Online:2019-04-15 Published:2019-04-26
  • Contact: ZHOU Fu-cai
  • About author:-
  • Supported by:
    -

Abstract: 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.

Key words: genomic data, suffix tree, searchable encryption, substring search, modern medicine

CLC Number: