期刊文献+
任意字段
题名或关键词
题名
关键词
文摘
作者
第一作者
机构
刊名
分类号
参考文献
作者简介
基金资助
栏目信息

基于聚类索引的多关键字排序密文检索方案 被引量：1

Multi-keyword Ranked Ciphertext Retrieval Scheme Based on Clustering Index
在线阅读 下载PDF
导出
摘要 为了提高密文检索的效率和精度,提出基于聚类索引的多关键字排序密文检索方案.首先利用改进的Chameleon算法对文件向量聚类,聚类过程中通过记录关键字位置对文件向量进行降维处理.其次,提出适合聚类索引的检索算法,使得在查询过程中可以排除大量与查询向量无关的文件向量,减少了不必要的计算消耗.再次,在聚类过程中引入杰卡德相似系数来计算文件向量之间的相似度以及设定合适的阈值提高聚类质量.在真实数据集上进行了实验,理论分析和实验结果表明:在保障数据隐私安全的前提下,该方案较传统的密文检索方案有效地提高了密文检索的效率与精度. Data owners prefer to outsource documents in an encrypted form for the purpose of privacy preserving. But existed encrypting technologies make it difficult to search for encrypted data, which limit the availability of outsourced data. This will make it even more challenging to design ciphertext search schemes that can provide efficient and reliable online information retrieval. In order to improve the efficiency and precision of ciphertext retrieval, we propose a multi-keyword ciphertext retrieval scheme based on clustering index. Firstly, the improved Chameleon algorithm is used to cluster the file vectors during which the file vectors are dimensioned by recording the position of the key words. Secondly, a retrieval algorithm suitable for clustering index is proposed, which makes it possible to eliminate a large number of file vectors irrelevant to the query vector in the query process, and reduce unnecessary consumption. Finally, in the clustering process, Jaccard similarity coefficient is introduced to calculate the similarity between the file vectors and to set the appropriate threshold to improve the quality of the cluster. The theory analysis and experimental results show that the scheme can effectively improve the efficiency and precision of ciphertext retrieval under the premise of guaranteeing the privacy and security of data.
作者 杜瑞忠 李明月 田俊峰 Du Ruizhong;Li Mingyue;Tian Junfeng(School of Cyber Security and Computer,Hebei University,Baoding,Hebei 071002;Key Laboratory on High Trusted Information System in Hebei Province (Hebei University),Baoding,Hebei 071002)
机构地区 河北大学网络空间安全与计算机学院 河北省高可信信息系统重点实验室(河北大学)
出处 《计算机研究与发展》 EI CSCD 北大核心 2019年第3期555-565,共11页 Journal of Computer Research and Development
基金 国家自然科学基金项目(61170254 60873203) 河北省自然科学基金项目(F2016201244 F2018201153) 河北省高等学校科学技术研究基金项目(ZD2016043)~~
关键词 云安全 密文检索 排序检索 聚类索引 CHAMELEON算法 cloud security ciphertext search ranked search clustering index Chameleon algorithm
分类号 TP309.2 [自动化与计算机技术—计算机系统结构]
  • 相关文献

参考文献3

二级参考文献17

  • 1Song DX, Wagner D, Perrig A. Practical techniques for searches on encrypted data. In: Titsworth FM, ed. Proc. of the 2000 IEEE Symp. on Security and Privacy. Los Alamitos: IEEE Computer Society, 2000. 44-55. [doi: 10.1109/SECPRI.2000.848445].
  • 2Goh EJ. Secure Indexes. Vol.216: IACR Cryptology ePrint Archive, 2004. 1-19.
  • 3Wang C, Cao N, Li J, Ren K, Lou W. Secure ranked keyword search over encrypted cloud data. In: Guerrero JE, ed. Proc. of the 2010 Int'l Conf. on Distributed Computing Systems. Los Alamitos: IEEE Computer Society, 2010. 253-262. [doi: 10.1109/ICDCS.2010.34].
  • 4Sun W, Wang B, Cao N, Li M, Lou W, Hou YT, Li H. Privacy-Preserving multi-keyword text search in the cloud supporting similarity-based ranking. In: Proc. of the ASIA 8th ACM Symp. on Information, Computer and Communications Security (CCS 2013). New York: ACM Press, 2013. 71-82. [doi: 10.1145/2484313.2484322].
  • 5Leslie H, Jain R, Birdsall D, Yaghmai H. Efficient search of multi-dimensional B-trees. In: Dayal U, ed. Proc. of the 21th Int'l Conf. on Very Large Data Bases (VLDB'95). San Francisco: Morgan Kaufmann Publishers Inc., 1995. 710-719.
  • 6Ciaccia P, Patella M, Rabitti F, Zezula P. Indexing metric spaces with M-tree. In: Cristani M, ed. Proc. of the SEBD. 1997. 67-86.
  • 7Wang C, Cao N, Ren K, Lou WJ. Enabling secure and efficient ranked keyword search over outsourced cloud data.. IEEE Trans. on Parallel and Distributed Systems, 2012, 23 (8) :1467-1479 . [doi:10.1109/TPDS.2011.282].
  • 8Yu S, Wang C, Ren K, Lou W. Achieving secure, scalable, and fine-grained data access control in cloud computing. In: Proc. of the 2010 IEEE INFOCOM. New York: IEEE Press, 2010. 1-9. [doi: 10.1109/INFCOM.2010.5462174].
  • 9Kaufman L, Rousseeuw PJ. Finding Groups in Data: An Introduction to Cluster Analysis. New Jersey: John Wiley & Sons, 2005 : 108 -110.
  • 10White D, Jain R. Similarity indexing with the SS-tree. In: Proc. of the 20th Int'l Conf. on Data Engineering. New York: IEEE Press, 1996. 516-523. [doi: 10.1109/ICDE.1996.492202].

共引文献36

同被引文献11

引证文献1

计算机研究与发展
2019年 第3期

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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