基于B^+树的多关键字密文排序检索方法  

Multi-keyword Ranked Search Method Based on B^+ Tree

作　　者：那海洋 杨庚[1] 束晓伟 NA Hai-yang YANG Geng SHU Xiao-wei(School of Computer Science, Nanjing University of Posts and Telecommunications, Nanjing 210003, China)

机构地区：[1]南京邮电大学计算机学院,南京210003

出　　处：《计算机科学》2017年第1期149-154,共6页Computer Science

基　　金：国家自然科学基金资助项目:云计算环境下的新型访问控制理论与关键技术研究(61272084);国家自然科学基金资助项目:云计算环境中面向数据多维隐私保护的关键技术研究(61572263)资助

摘　　要：针对当前社会信息量大、隐私信息需要加密存储带来的检索难度大等问题,研究分析了现有的基于密文的可搜索加密方案,提出了一种基于B^+树的多关键字密文排序方法。利用向量模型构建索引和查询陷门,根据相关性分数和关键字匹配度对检索结果进行排序。在真实数据集上进行了实验,结果证明本方案具有较高的检索效率。For the large amount of information and the storage of encrypted privacy information in society, it has become more difficult to retrieve these information for users. Based on research and analysis of the existing searchable encryp- tion scheme,a method of multi-keyword ranked search based on B^＋ tree was proposed in this paper. Specifically, the vector model is combined in the index construction and trapdoor generation, and the search results are sorted according to the relevance score and the match number of keyword. Finally, the experiments are conducted on the really dataset to demonstrate the search efficiency of the proposed scheme.

关 键 词：B^+树 密文检索 多关键字 

分 类 号：TP309[自动化与计算机技术—计算机系统结构]