...
首页> 外文期刊>IEEE Transactions on Parallel and Distributed Systems >Enabling Personalized Search over Encrypted Outsourced Data with Efficiency Improvement
【24h】

Enabling Personalized Search over Encrypted Outsourced Data with Efficiency Improvement

机译:通过提高效率实现对加密外包数据的个性化搜索

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

摘要

In cloud computing, searchable encryption scheme over outsourced data is a hot research field. However, most existing works on encrypted search over outsourced cloud data follow the model of “one size fits all” and ignore personalized search intention. Moreover, most of them support only exact keyword search, which greatly affects data usability and user experience. So how to design a searchable encryption scheme that supports personalized search and improves user search experience remains a very challenging task. In this paper, for the first time, we study and solve the problem of personalized multi-keyword ranked search over encrypted data (PRSE) while preserving privacy in cloud computing. With the help of semantic ontology WordNet, we build a user interest model for individual user by analyzing the user’s search history, and adopt a scoring mechanism to express user interest smartly. To address the limitations of the model of “one size fit all” and keyword exact search, we propose two PRSE schemes for different search intentions. Extensive experiments on real-world dataset validate our analysis and show that our proposed solution is very efficient and effective.
机译:在云计算中,外包数据上的可搜索加密方案是一个热门研究领域。但是,大多数有关外包云数据的加密搜索的现有作品都遵循“一刀切”的模型,而忽略了个性化搜索意图。而且,它们中的大多数仅支持精确的关键字搜索,这极大地影响了数据的可用性和用户体验。因此,如何设计一种可支持个性化搜索并改善用户搜索体验的可搜索加密方案仍然是一项非常艰巨的任务。在本文中,我们首次研究并解决了在加密数据(PRSE)上个性化多关键字排名搜索的问题,同时保留了云计算中的隐私。在语义本体WordNet的帮助下,我们通过分析用户的搜索历史来建立单个用户的用户兴趣模型,并采用评分机制来智能地表达用户兴趣。为了解决“一刀切”和关键字精确搜索模型的局限性,我们针对不同的搜索意图提出了两种PRSE方案。在真实数据集上进行的大量实验验证了我们的分析结果,并表明我们提出的解决方案非常有效。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号