| 基于多关键字的Top-k布尔可搜索加密方案 |
| |
| 引用本文： | 郭斯栩, 何申, 粟栗, 张星, 周福才, 张鑫月. 基于多关键字的Top-k布尔可搜索加密方案[J]. 计算机研究与发展, 2022, 59(8): 1841-1852. DOI: 10.7544/issn1000-1239.20200605 |
| |
| 作者姓名： | 郭斯栩 何申 粟栗 张星 周福才 张鑫月 |
| |
| 作者单位： | 1.1(中国移动通信有限公司研究院安全技术研究所 北京 100053);2.2(东北大学软件学院 沈阳 110819) (guosixu@chinamobile.com) |
| |
| 基金项目： | 辽宁省科技攻关项目(2013217004)；;中央高校基本科研业务费专项资金(N71704005)；;国家科技重大专项基金项目(2013ZX03002006)~~； |
| |
| 摘 要： | 针对在云存储服务中可搜索加密技术的研究，解决了现存3个问题：1)传统可搜索加密方法大多数只支持单关键字搜索，并且在安全索引过大时，搜索时间代价过大；2)现有方案大多使用倒排索引进行快速搜索，然而倒排索引并不支持动态关键字更新；3)现有方案大多数无法针对某些按需用户，根据关键字的重要性对搜索文件进行安全高效的top-k排序.提出了一种基于多关键字的top-k布尔可搜索加密方案(top-k boolean searchable encryption scheme based on multiple keywords, TBSE).该方案利用Goldwasser-Micalli与2DNF这2种加密算法构建了一种支持动态更新的安全索引；利用集合论与布尔搜索的相关知识构建了关键字交集索引与交集搜索令牌，以实现对多关键字的布尔搜索；利用TF-IDF加权技术与安全协处理器构造分数索引，进而能够对文件进行top-k排序.安全性分析表明：该方案保证了在已知密文模型与已知背景模型下的安全性.通过实验证明：该方案提升了对多关键字布尔搜索的效率以及索引存储的效率.
|
| 关 键 词： | 布尔搜索 多关键字 top-k 可搜索加密 动态更新 |
Top-k Boolean Searchable Encryption Scheme Based on Multiple Keywords |
| |
| Guo Sixu, He Shen, Su Li, Zhang Xing, Zhou Fucai, Zhang Xinyue. Top-k Boolean Searchable Encryption Scheme Based on Multiple Keywords[J]. Journal of Computer Research and Development, 2022, 59(8): 1841-1852. DOI: 10.7544/issn1000-1239.20200605 |
| |
| Authors: | Guo Sixu He Shen Su Li Zhang Xing Zhou Fucai Zhang Xinyue |
| |
| Affiliation: | 1.1(Institute of Security Technology, Research Institute of China Mobile Communications Co., Ltd, Beijing 100053);2.2(Software College, Northeastern University, Shenyang 110819) |
| |
| Abstract: | 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. |
| |
| Keywords: | boolean search multi keywords top-k searchable encryption dynamic update |
|
| 点击此处可从《计算机研究与发展》浏览原始摘要信息 |
|
点击此处可从《计算机研究与发展》下载全文 |
|
