Top-k Boolean Searchable Encryption Scheme Based on Multiple Keywords

被引：0
|
作者：
Guo S. [1 ,2 ]
He S. [1 ]
Su L. [1 ]
Zhang X. [1 ]
Zhou F. [2 ]
Zhang X. [1 ]
机构：
[1] Institute of Security Technology, Research Institute of China Mobile Communications Co., Ltd, Beijing
[2] Software College, Northeastern University, Shenyang
来源：
Jisuanji Yanjiu yu Fazhan/Computer Research and Development | 2022年 / 59卷 / 08期
关键词：
Boolean search; Dynamic update; Multi keywords; Searchable encryption; Top-k;
D O I：
10.7544/issn1000-1239.20200605
中图分类号：
学科分类号：
摘要：
In view of the searchable encryption technology in cloud storage services, this paper solves the following three problems:Firstly, most of the traditional searchable encryption methods only support single keyword search, and when the security index is too large, the search time cost is too high; Secondly, most of the existing schemes use inverted index for quick search, but inverted index does not support dynamic keyword update; Thirdly, most of the existing schemes can't sort the search files efficiently according to the importance of keywords for some on-demand users. In this paper, a top-k boolean searchable encryption scheme based on multiple keywords (TBSE) is proposed. In the scheme, Goldwasser-Micalli and 2DNF encryption algorithms are used to construct a secure, index supporting dynamic update. Based on the set theory and boolean search, keyword intersection index and intersection search token are constructed to realize boolean search for multiple keywords. The top-k sorting is realized by fractional index constructed by using TF-IDF weighting technology and security coprocessor. The security analysis shows that the scheme can fully guarantee the security of the given ciphertext model and the known background model. The experiments prove that the scheme improves the efficiency of multi keywords Boolean search and index storage. © 2022, Science Press. All right reserved.
引用
收藏
页码：1841 / 1852
页数：11
相关论文
共 22 条
  • [1] Goldreich O, Ostrovsky R., Software protection and simulation on oblivious RAMs, Journal of the ACM, 43, 3, pp. 431-473, (1996)
  • [2] Boneh D, Crescenzo G D, Ostrovsky R, Et al., Public key encryption with keyword search, Proc of Int Conf on the Theory and Applications of Cryptographic Techniques, pp. 506-522, (2004)
  • [3] Song Xiaodong, Wagner D, Perrig A., Practical techniques for searches on encrypted data, Proc of IEEE Symp on Security & Privacy, pp. 44-55, (2000)
  • [4] Park H A, Byun J W, Lee D H., Secure index search for groups, Proc of the 2nd Int Conf on Trust, Privacy & Security in Digital Business, pp. 128-140, (2005)
  • [5] Chang Yancheng, Mitzenmacher M., Privacy preserving keyword searches on remote encrypted data, Proc of Applied Cryptography and Network Security, pp. 442-455, (2005)
  • [6] Yang Lei, Zheng Qingji, Fan Xinxin, RSPP: A reliable, searchable and privacy-preserving e-healthcare system for cloud-assisted body area networks, Proc of IEEE INFOCOM 2017-IEEE Conf on Computer Communications, pp. 1-9, (2017)
  • [7] Hu Wen, Shafagh H, Hithnawi A., Talos: Encrypted query processing for the internet of things, Proc of ACM Conf on Embedded Networked Sensor Systems, pp. 197-210, (2015)
  • [8] Li Huige, Tian Hua, Zhang Feng, Et al., Blockchain-based searchable symmetric encryption scheme, Computers & Electrical Engineering, 73, 1, pp. 32-45, (2019)
  • [9] Kim M, Lauter K., Private genome analysis through homomorphic encryption, BMC Medical Informatics & Decision Making, 15, 5, pp. 1-12, (2015)
  • [10] Fagin R., Combining fuzzy information from multiple systems, Journal of Computer & System Sciences, 58, 1, pp. 777-780, (1996)
123