检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:陈元 张昌宏[1] 付伟[1] Chen Yuan;Zhang Changhong;Fu Wei(Dept.of Information Security,Naval University of Engineering,Wuhan 430033,Chin)
出 处:《计算机应用研究》2018年第8期2425-2427,2438,共4页Application Research of Computers
基 金:国家自然科学基金资助项目(61672531);总装后勤科技重大项目子课题;全军军事类研究生资助课题
摘 要:为实现安全高效的云端数据密文检索,提出基于Huffman树的密文索引构建及检索方案。将Huffman树型结构及其编码的思想引入密文索引结构的构建方案中,改进基于知识理解的中文分词算法提取明文关键词,通过改进的TF-IDF规则对检索结果集进行排序以返回最符合用户需求的Top-k个结果,并增加伪造的索引节点以增强索引结构的抗统计分析攻击能力。通过实验测试和性能对比分析可得出结论:方案在保证密文和索引信息安全性的同时,可以提高密文检索的效率。To achieve safe and efficient ciphertext retrieval of data in cloud,this paper proposed a scheme of ciphertext index construction and retrieval based on Huffman tree.The scheme introduced the idea of the Huffman tree structure and its coding into the construction of ciphertext index structure,improved Chinese word segmentation algorithm based on knowledge understanding to extract keywords of plaintext,sorted the search result set through the improved rule of TF-IDF to return the Top- k results that meet the users’ needs mostly,and added forged nodes of ciphertext index to enhance capabilities of resistance to statistical analysis of the index structure.Through the experimental test and comparison analysis of performance,it can be concluded that the scheme can improve the efficiency of ciphertext retrieval,which can ensure the security of ciphertext and index simultaneously.
关 键 词:云存储 密文检索 HUFFMAN树 密文索引 索引结构
分 类 号:TP309[自动化与计算机技术—计算机系统结构]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.165