원문정보
초록
영어
To protect the privacy, sensitive information has to be encrypted before outsourcing to the cloud. Thus the effective data utilization becomes a significant challenge. Searchable encryption scheme has been developed to conduct retrieval over encrypted data. However, these schemes only support exact keyword search. Recent fuzzy search schemes mainly evaluate the similarity of keywords from the structure but the semantic relatedness is not considered. Our work focuses on realizing secure semantic search through query keyword semantic extension. Based on the co-occurrence probability of terms, the semantic relationship library is constructed to record the semantic similarity between keywords. We exploited architecture of two clouds, namely private cloud and public cloud. The search operation is divided into two steps. The first step expands the query keyword upon SRL stored in the private cloud. The second step uses the extended query keywords set to retrieve the index on public cloud. Finally the matched files are returned in order. Detailed security analysis shows that our solution is privacy-preserving and secure. Experimental evaluation demonstrates the efficiency and effectives of the scheme.
목차
1. Introduction
2. Problem Definition
2.1. System Model
2.2. Threat Model
2.3. Design goals
2.4. Notation
2.5. Preliminaries
2.6. Basic Definitions
3. The Ranked Semantic Keyword Search Scheme
3.1. One-to-Many Order-Preserving Encryption
3.2. The Details of the Proposed Scheme
4. Security Analysis
4.1. Secutity Analysis for one-to-many OPE
4.2. Security Analysis for the Ranked Semantic Keyword Search
5. Performance Analysis
6. Conclusion
Acknowledgements
References