返回
Semantic-aware multi-keyword ranked search scheme over encrypted cloud data
DOI:10.1016/j.jnca.2019.102442.png)
摘要
En 中文
Traditional searchable encryption schemes mostly adopt the TF-IDF (term frequency - inverse document frequency) model which ignores the semantic association between keywords and documents. It is a challenge to design an effective and secure semantic-aware search scheme. The topic model is based on high-order co-occurrence, i.e., how often words co-occur in different contexts. Hence, it can be utilized for modeling the latent semantics among texts. In this paper, we propose a novel privacy-persevering searchable encryption scheme based on the Latent Dirichlet Allocation (LDA) topic model. Documents are modeled by LDA, and the concept of topics is utilized to generate a document-topic relevance matrix and query topic vectors. The matrix is used as the index for the proposed scheme. The secure inner product operation is adopted to encrypt the index and query topic vectors, which provides accurate topic relevance score calculation between encrypted index and trapdoors. To improve the efficiency of our basic scheme, we adopt a special complete binary tree and use the Greedy Depth First Search algorithm. Our evaluation results demonstrate the effectiveness of our scheme.
Keyword:
Semantic-aware search
Searchable encryption
Cloud computing
Multi-keyword ranked search
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
8
论文数:
3.7K
被引数:
1.1W
机构
暂无机构信息
引用论文
Enabling Efficient Verifiable Fuzzy Keyword Search Over Encrypted Data in Cloud Computing在云计算中的加密数据上实现高效的可验证模糊关键字搜索
IEEE ACCESS
IF3.6

