A Flexible Accuracy-Controllable Searchable Symmetric Encryption Scheme

被引:0
作者
Li X. [1 ]
Tao R. [1 ]
Su C. [1 ]
Huang Q. [1 ]
Huang X. [2 ]
机构
[1] College of Mathematics & Informatics, South China Agricultural University, Guangzhou
[2] College of Mathematics & Informatics, Fujian Normal University, Fuzhou
来源
Huang, Qiong (qhuang@scau.edu.cn) | 1600年 / Science Press卷 / 57期
基金
中国国家自然科学基金;
关键词
Burrows Wheeler transform (BWT); FM-index; LF mapping; Searchable symmetric encryption (SSE); SubLF mapping; Suffix array (SA);
D O I
10.7544/issn1000-1239.2020.20190233
中图分类号
学科分类号
摘要
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. © 2020, Science Press. All right reserved.
引用
收藏
页码:3 / 16
页数:13
相关论文
共 16 条
[1]  
Popa R.A., Redfield C.M.S., Zeldovich N., Et al., CryptDB: Protecting confidentiality with encrypted query processing, Proc of the 23rd ACM Symp on Operating Systems Principles(SOSP), pp. 85-100, (2011)
[2]  
Chen P., Zhang T., Zhao M., Et al., Database as service system for business database application hosting and its privacy preservation mechanism, Computer Science, 40, 11, (2013)
[3]  
Wang H., Yang G., Liu G., Et al., Design and implementation of searchable database encryption system, Computer Technology and Development, 27, 8, pp. 130-134, (2017)
[4]  
Cash D., Jaeger J., Jarecki S., Et al., Dynamic searchable encryption in very-large databases: Data structures and implementation, Proc of 2014 Network and Distributed System Security Symp, (2014)
[5]  
Faber S., Jarecki S., Krawczyk H., Et al., Rich queries on encrypted data: Beyond exact matches, Proc of the 20th European Symp on Research in Computer Security, pp. 123-145, (2015)
[6]  
Chase M., Shen E., Substring-searchable symmetric encryption, Proc of the 15th Privacy Enhancing Technologies Symp, pp. 263-281, (2015)
[7]  
Hu C., Han L., Efficient wildcard search over encrypted data, International Journal of Information Security, 15, 5, pp. 539-547, (2016)
[8]  
Zhou W., Liu L., Jing H., Et al., K-Gram based fuzzy keyword search over encrypted loud computing, Journal of Software Engineering and Applications, 6, 1, pp. 29-32, (2013)
[9]  
Zhang Z., Marios H., Beng C.O., Et al., Bed-Tree: An all-purpose index structure for string similarity search based on edit distance, Proc of the ACM Special Interest Group on Management of Data, pp. 915-926, (2010)
[10]  
Leontiadis I., Li M., Storage efficient substring searchable symmetric encryption, Proc of the 39th Annual IACR Scientific Conf, (2017)