首页 | 本学科首页   官方微博 | 高级检索  
     

基于语义分组的动态可搜索加密方案
引用本文:王泽贤,汪学明.基于语义分组的动态可搜索加密方案[J].计算机系统应用,2021,30(10):287-294.
作者姓名:王泽贤  汪学明
作者单位:贵州大学计算机科学与技术学院,贵阳550025
摘    要:为满足用户对云端文档动态更新的需求,支持动态更新的可搜索加密方案成为了研究热点.但目前已知方案对于索引结构的更新多采用尾部直接插入的方法,造成了新添加关键字和文档之间关联性的泄露.为此本文提出一种基于语义分组的动态可搜索加密方案.首先构建分组平衡二叉树作为索引结构,通过语义分组减少搜索时访问的节点数,提高搜索效率.然后结合分区矩阵的思想,在矩阵中添加虚拟关键字保证更新时的安全性.最后通过形式化的证明分析了本文方案的安全性.

关 键 词:可搜索加密  多关键词排序搜索  动态更新  分组平衡二叉树
收稿时间:2021/1/5 0:00:00
修稿时间:2021/2/3 0:00:00

Dynamic Searchable Encryption Scheme Based on Semantic Grouping
WANG Ze-Xian,WANG Xue-Ming.Dynamic Searchable Encryption Scheme Based on Semantic Grouping[J].Computer Systems& Applications,2021,30(10):287-294.
Authors:WANG Ze-Xian  WANG Xue-Ming
Affiliation:College of Computer Science and Technology, Guizhou University, Guiyang 550025, China
Abstract:Searchable encryption scheme supporting dynamic update has become a research hotspot to meet the needs of users for dynamic update of cloud documents. However, most of the known schemes update the index structure by the direct insertion at the tail, which leads to the leakage of the relationship between the newly added keywords and the document. Therefore, this study proposes a dynamic searchable encryption scheme based on semantic grouping. Firstly, the balanced binary tree is constructed as the index structure, and the number of nodes is reduced by semantic grouping for search efficiency improvement. Then, in light of the idea of partition matrix, virtual keywords are added to the matrix to ensure the security of update. Finally, the security of the scheme is analyzed by formal proof.
Keywords:searchable encryption  multi-keyword sorting retrieval  dynamic update  balanced binary tree
本文献已被 万方数据 等数据库收录!
点击此处可从《计算机系统应用》浏览原始摘要信息
点击此处可从《计算机系统应用》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号