원문정보
초록
영어
With the development of cloud computing, the sensitive information of outsourced data is at risk of unauthorized accesses. To protect data privacy, the sensitive data should be encrypted by the data owner before outsourcing, which makes the traditional and efficient plaintext keyword search technique useless. Hence, it is an especially important thing to explore secure encrypted cloud data search service. Considering the huge number of outsourced data, there are three problems we are focused on to enable efficient search service: multi-keyword search, result relevance ranking and dynamic update. In this paper, we propose a practically efficient and flexible searchable encrypted scheme which supports both multi-keyword ranked search and dynamic update. To support multi-keyword search and result relevance ranking, we adopt Vector Space Model (VSM) to build the searchable index to achieve accurate search result. To improve search efficiency, we design a tree-based index structure which supports insertion and deletion update well without privacy leakage. We propose a secure search scheme to meet the privacy requirements in the threat model. Finally, experiments on real-world dataset are implemented to demonstrate the overall performance of the proposed scheme, which show our scheme is efficient.
목차
1. Introduction
2. Related Work
2.1. Single Keyword Searchable Encryption
2.2. Multi-keyword Searchable Encryption
3. Problem Formulation
3.1. System Model
3.2. Threat Model
3.3. Design Goals
3.5. Preliminaries
4. Secure Index Scheme
5. Dynamic Update
6. Security Analysis
7. Performance Analysis
7.1. Index Tree Construction
7.2. Query Generation
7.3. Search Efficiency
8. Conclusions and Future Work
Acknowledgements
References
