计算机应用 ›› 2019, Vol. 39 ›› Issue (4): 1059-1065.DOI: 10.11772/j.issn.1001-9081.2018091865

• 网络空间安全 • 上一篇    下一篇

支持语义扩展的动态多关键词密文排序检索

庞晓琼1, 严小龙1, 陈文俊1, 余本国2, 聂梦飞1   

  1. 1. 中北大学 大数据学院, 太原 030051;
    2. 中北大学 软件学院, 太原 030051
  • 收稿日期:2018-09-07 修回日期:2018-11-25 发布日期:2019-04-10 出版日期:2019-04-10
  • 通讯作者: 庞晓琼
  • 作者简介:庞晓琼(1982-),女,山西太原人,讲师,博士,CCF会员,主要研究方向:信息安全、密码学、复杂系统;严小龙(1991-),男,山西吕梁人,硕士,主要研究方向:信息安全、密码学;陈文俊(1980-),男,江西南昌人,博士研究生,主要研究方向:金融信息安全;余本国(1976-),男,安徽安庆人,讲师,博士,主要研究方向:云计算、大数据;聂梦飞(1994-),女,山西临汾人,硕士研究生,主要研究方向:信息安全、密码学。
  • 基金资助:
    山西省青年自然科学基金资助项目(201601D021075);山西省回国留学人员科研项目(2015-083);山西省研究生教育改革研究项目(2018JG62)。

Dynamic multi-keyword ranked search over encrypted data supporting semantic extension

PANG Xiaoqiong1, YAN Xiaolong1, CHEN Wenjun1, YU Benguo2, NIE Mengfei1   

  1. 1. School of Data Science and Technology, North University of China, Taiyuan Shanxi 030051, China;
    2. Software School, North University of China, Taiyuan Shanxi 030051, China
  • Received:2018-09-07 Revised:2018-11-25 Online:2019-04-10 Published:2019-04-10
  • Supported by:
    This work is partially supported by the Young Natural Science Foundation of Shanxi Province (201601D021075), the Research Project Supported by Shanxi Scholarship Council of China (2015-083), the Educational Reform Research Project for Graduate Students of Shanxi Province (2018JG62)

摘要: 针对云存储环境下已有的动态多关键词密文排序检索方案不支持关键词语义扩展、不具备前向安全和后向安全的问题,提出一种支持语义检索且具备前向安全和后向安全的动态多关键词密文排序检索方案。该方案通过构建语义关系图实现查询关键词的语义扩展;使用树索引结构实现数据的检索和动态更新;利用向量空间模型实现多关键词排序搜索;基于安全K近邻算法对维度扩展后的索引和查询向量进行加密。安全性分析表明,该方案在已知密文模型下是安全的且具有动态更新时的前向安全和后向安全。效率分析及仿真实验结果表明,该方案在服务器检索效率方面优于目前同类型具有相同安全性或相同功能的方案。

关键词: 对称可搜索加密, 多关键词排序检索, 动态更新, 语义扩展

Abstract: Since existing dynamic multi-keyword ranked search schemes over encrypted data in cloud storage can not support semantic extension and do not have forward and backward security, a multi-keyword ranked search scheme over encrypted cloud data was proposed, which supported semantic search and achieved forward and backward security. The semantic extension of query keywords was achieved by constructing semantic relationship graph, the retrieval and dynamic update of data were achieved by use of tree-based index structure, the multi-keyword ranked search was achieved based on vector space model, and the extended index and query vectors were encrypted by using secure K-nearest neighbor algorithm. Security analysis indicates that the proposed scheme is secure under the known ciphertext model and achieves forward and backward security during dynamic update. Efficiency analysis and simulation experiments show that this scheme is superior to the same type schemes with the same security or function in server retrieval efficiency.

Key words: symmetric searchable encryption, multi-keyword ranked search, dynamic update, semantic extension

中图分类号: