ISSN 1000-1239 CN 11-1777/TP

Journal of Computer Research and Development ›› 2020, Vol. 57 ›› Issue (1): 3-16.doi: 10.7544/issn1000-1239.2020.20190233

Special Issue: 2020优青专题

Previous Articles     Next Articles

A Flexible Accuracy-Controllable Searchable Symmetric Encryption Scheme

Li Ximing1, Tao Ruyu1, Su Chen1, Huang Qiong1, Huang Xinyi2   

  1. 1(College of Mathematics & Informatics, South China Agricultural University, Guangzhou 510642);2(College of Mathematics & Informatics, Fujian Normal University, Fuzhou 350117)
  • Online:2020-01-01
  • Supported by: 
    This work was supported by the National Natural Science Foundation of China for Excellent Young Scientists (61822202), the National Natural Science Foundation of China (61872152, 61872409), the Guangdong Natural Science Funds for Distinguished Young Scholar (2014A030306021), the Guangdong Program for Special Support of Top-notch Young Professionals (2015TQ01X796), and the Major Program of Guangdong Basic and Applied Research (2019B030302008).

Abstract: In the traditional keyword-based searchable symmetric encryption technology, the keyword set is usually generated by the keyword extraction algorithm, so that the content and quantity of the keywords are limited by the keyword extraction algorithm. Therefore, in the keyword-based encryption search system, in addition to the keyword set generated by the system at the time of initial construction, the user cannot search for other related contents, thereby limiting the application of the encryption search technology. In view of the above problems, this paper proposes a flexible accuracy-controllable searchable symmetric encryption (FASSE) that supports flexible and precise control. By flexibly generating keywords and indexes generated by document summary during system operation, the dependence of the keyword collection effectively improves the flexibility of the encryption search technology. FASSE provides three basic searches, namely one-shot search reinforcement search and filter search, which respectively correspond to the user finding the keyword record in the dictionary only once, not finding the keyword record in the dictionary and only using it once. The search finds records or three search cases where keyword records are found in the dictionary and abstract multiple times. At the same time, the system also combines three kinds of search to design a fuzzy reinforcement search to further enhance the practicability of the system. The specific implementation language of the FASSE program is the Java programming development language and the final experiment shows that FASSE averages 114.26 ms in searching each paper in the https://eprint.iacr.org/complete/ paper dataset.

Key words: searchable symmetric encryption (SSE), suffix array (SA), LF mapping, SubLF mapping, FM-index, Burrows Wheeler transform (BWT)

CLC Number: