首页> 外文期刊>Parallel and Distributed Systems, IEEE Transactions on >A Secure and Dynamic Multi-Keyword Ranked Search Scheme over Encrypted Cloud Data
【24h】

A Secure and Dynamic Multi-Keyword Ranked Search Scheme over Encrypted Cloud Data

机译:基于加密云数据的安全动态多关键字排名搜索方案

获取原文
获取原文并翻译 | 示例

摘要

Due to the increasing popularity of cloud computing, more and more data owners are motivated to outsource their data to cloud servers for great convenience and reduced cost in data management. However, sensitive data should be encrypted before outsourcing for privacy requirements, which obsoletes data utilization like keyword-based document retrieval. In this paper, we present a secure multi-keyword ranked search scheme over encrypted cloud data, which simultaneously supports dynamic update operations like deletion and insertion of documents. Specifically, the vector space model and the widely-used TFIDF model are combined in the index construction and query generation. We construct a special tree-based index structure and propose a “Greedy Depth-first Search” algorithm to provide efficient multi-keyword ranked search. The secure kNN algorithm is utilized to encrypt the index and query vectors, and meanwhile ensure accurate relevance score calculation between encrypted index and query vectors. In order to resist statistical attacks, phantom terms are added to the index vector for blinding search results. Due to the use of our special tree-based index structure, the proposed scheme can achieve sub-linear search time and deal with the deletion and insertion of documents flexibly. Extensive experiments are conducted to demonstrate the efficiency of the proposed scheme.
机译:由于云计算的日益普及,越来越多的数据所有者被激励将其数据外包给云服务器,以提供极大的便利并降低数据管理成本。但是,在出于隐私要求外包之前,应该对敏感数据进行加密,这会使诸如基于关键字的文档检索之类的数据利用率过时。在本文中,我们提出了一种对加密的云数据进行安全的多关键字排序的搜索方案,该方案同时支持动态更新操作,例如删除和插入文档。具体来说,向量空间模型和广泛使用的TFIDF模型在索引构建和查询生成中组合在一起。我们构建了一种特殊的基于树的索引结构,并提出了一种“贪婪深度优先搜索”算法来提供有效的多关键字排名搜索。利用安全的kNN算法对索引和查询向量进行加密,同时确保加密后的索引和查询向量之间的相关度得分计算准确。为了抵抗统计攻击,将幻象项添加到索引向量中,以使搜索结果模糊。由于使用了我们特殊的基于树的索引结构,因此该方案可以实现亚线性搜索时间,并且可以灵活地处理文档的删除和插入。进行了广泛的实验以证明所提出的方案的效率。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号