Enabling Fine-Grained Multi-Keyword Search Supporting Classified Sub-Dictionaries over Encrypted Cloud Data

Enabling Fine-Grained Multi-Keyword Search Supporting Classified Sub-Dictionaries over Encrypted Cloud Data
复制标题

实现细粒度多关键词搜索,支持加密云数据分类子词典

DOI:
10.1109/tdsc.2015.2406704
复制
发表时间:
2016-05-01
影响因子:
7.3
通讯作者:
Shen, Xuemin (Sherman)
Shen, Xuemin (Sherman)
中科院分区:
计算机科学2区
文献类型:
--
作者:
Li, Hongwei;Yang, Yi;Shen, Xuemin (Sherman)

文献摘要

被引文献

相似文献

使用云计算,个人可以将其数据存储在远程服务器上,并允许公共用户通过云服务器访问数据。由于外包数据可能包含敏感的隐私信息,因此它们通常在上传到云之前进行加密。然而,由于难以在加密数据上搜索,这显著限制了外包数据的可用性。在本文中,我们通过开发加密云数据上的细粒度多关键字搜索方案来解决这个问题。我们最初的贡献是三方面的。首先,我们引入关键字的相关性分数和偏好因子,从而实现精确的关键字搜索和个性化的用户体验。第二,我们开发了一个实用的和非常有效的多关键字搜索方案。该方案可以支持复杂的逻辑搜索,包括关键字的“AND”、“OR”和“NO”混合运算。第三,我们进一步采用分类子字典技术,以实现更好的效率,索引建设,陷门生成和查询。最后,从文档的机密性、索引和陷门的隐私保护以及陷门的不可链接性等方面分析了方案的安全性。通过大量的实验,使用真实世界的数据集,我们验证了所提出的方案的性能。安全性分析和实验结果表明,与现有方案相比,本文提出的方案在功能、查询复杂度和效率等方面都具有更好的性能,并且可以达到相同的安全水平。
Using cloud computing, individuals can store their data on remote servers and allow data access to public users through the cloud servers. As the outsourced data are likely to contain sensitive privacy information, they are typically encrypted before uploaded to the cloud. This, however, significantly limits the usability of outsourced data due to the difficulty of searching over the encrypted data. In this paper, we address this issue by developing the fine-grained multi-keyword search schemes over encrypted cloud data. Our original contributions are three-fold. First, we introduce the relevance scores and preference factors upon keywords which enable the precise keyword search and personalized user experience. Second, we develop a practical and very efficient multi-keyword search scheme. The proposed scheme can support complicated logic search the mixed “AND”, “OR” and “NO” operations of keywords. Third, we further employ the classified sub-dictionaries technique to achieve better efficiency on index building, trapdoor generating and query. Lastly, we analyze the security of the proposed schemes in terms of confidentiality of documents, privacy protection of index and trapdoor, and unlinkability of trapdoor. Through extensive experiments using the real-world dataset, we validate the performance of the proposed schemes. Both the security analysis and experimental results demonstrate that the proposed schemes can achieve the same security level comparing to the existing ones and better performance in terms of functionality, query complexity and efficiency.