期刊文献+

基于Huffman树的密文索引构建方案 被引量:1

Scheme of ciphertext index construction based on Huffman tree
下载PDF
导出
摘要 为实现安全高效的云端数据密文检索,提出基于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.
作者 陈元 张昌宏 付伟 Chen Yuan;Zhang Changhong;Fu Wei(Dept.of Information Security,Naval University of Engineering,Wuhan 430033,Chin)
出处 《计算机应用研究》 CSCD 北大核心 2018年第8期2425-2427,2438,共4页 Application Research of Computers
基金 国家自然科学基金资助项目(61672531) 总装后勤科技重大项目子课题 全军军事类研究生资助课题
关键词 云存储 密文检索 HUFFMAN树 密文索引 索引结构 cloud storage ciphertext retrieval Huffman tree ciphertext index index structure
  • 相关文献

参考文献3

二级参考文献50

  • 1Fagin R. Combining fuzzy information from multiple systems. Journal of Computer and System Sciences, 1999,58(1):83-99. [doi: 10.1006/jcss.1998.1600].
  • 2Fagin R, Lotem A, Naor M. Optimal aggregation algorithms for middleware. Journal of Computer and System Sciences, 2003,66(4) 614-656. [doi: 10.1016/S0022-0000(03)00026-6].
  • 3Guntzer U, Balke W, KieBling W. Towards efficient multi-feature queries in heterogeneous environments. In: Proc. of the Int'l Conf. on Information Technology: Coding and Computing (ITCC 2001). Piscataway: IEEE, 2001. 622-628. [doi: 10.1109/ITCC. 2001.918866].
  • 4Chang KCC, Hwang SW. Minimal probing: Supporting expensive predicates for top-k queries. In: Proc. of the SIGMOD Int'l Conf. on Management of Data. New York: ACM Press, 2002. 346-357. [doi: 10.1145/564691.564731].
  • 5Bruno N, Chaudhuri S, Gravano L. Top-K selection queries over relational databases: Mapping strategies and performance evaluation. ACM Trans. on Database Systems, 2002,27(2): 153-187. [doi: 10.1145/568518.568519].
  • 6Ilyas IF, Aref WG, Elmagarmid AK. Supporting top-k join queries in relational databases. In: Proc. of the 29th Int'l Conf. on Very Large Databases. San Fransisco: Morgan Kaufmann Publishers, 2003. 207-221. [doi: 10.1007/s00778-004-0128-2].
  • 7Vlachou A, Doulkeridis C, Kotidis Y, Norvag K. Reverse top-k queries. In: Proc. of the 26th IEEE Int'l Conf. on Data Engineering. Piscataway: IEEE, 2010. 365-376. [doi: 10. 1109/ICDE.2010.5447890].
  • 8Vlaehou A, Doulkeridis C, Kotidis Y, Norvag K. Monochromatic and bichromatic reverse top-k queries. IEEE Trans. on Knowledge and Data Engineering, 2011,23(8):1215-1229. [doi: 10.1109/TKDE.2011.50].
  • 9Marian A, Bruno N, Gravano L. Evaluating top-k queries over Web-accessible databases. ACM Trans. on Database Systems, 2004, 29(2):319-362. [doi: 10.1145/1005566.1005569].
  • 10Cao P, Wang Z. Efficient top-K query calculation in distributed networks. In: Proc. of the 23th Annual ACM Symp. on Principles of Distributed Computing. New York: ACM Press, 2004.206-215. [doi: 10.1145/1011767.1011798].

共引文献206

同被引文献8

引证文献1

二级引证文献7

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部