Abstract
In the interest of privacy concerns, cloud service users choose to encrypt their personal data before outsourcing them to cloud. However, it is difficult to achieve efficient search over encrypted cloud data. Therefore, how to design an efficient and accurate search scheme over large-scale encrypted cloud data is a challenge. In this paper, we integrate bisecting k-means algorithm and multibranch tree structure and propose the α-filtering tree search scheme based on bisecting k-means clusters. The novel index tree is built from bottom-up, and a greedy depth first algorithm is used for filtering the nonrelevant document cluster by calculating the relevance score between the filtering vector and the query vector. The α-filtering tree can improve the efficiency without the loss of search accuracy. The experiment on a real-world dataset demonstrates the effectiveness of our scheme.
Highlights
IntroductionCloud computing is a new model in IT enterprise which can offer high-quality calculation, storage, and application capacity. e cloud customers choose to outsource their local data and computation to the cloud server for minimizing the data maintenance cost. us, to protect users’ privacy and achieve efficient and precise data retrieving from the cloud server has become the focus of recent works
Cloud computing is a new model in IT enterprise which can offer high-quality calculation, storage, and application capacity. e cloud customers choose to outsource their local data and computation to the cloud server for minimizing the data maintenance cost. us, to protect users’ privacy and achieve efficient and precise data retrieving from the cloud server has become the focus of recent works.e traditional way to protect data privacy is to encrypt the original data
Researchers proposed a series of searchable encryption schemes [8,9,10,11,12,13] based on the theory of cryptography. ese encryption schemes either do not have high-accuracy retrieval results [8,9,10, 12] or cost a lot of time and space overhead [8, 11]. erefore, it is a necessity to design an efficient and useable search scheme
Summary
Cloud computing is a new model in IT enterprise which can offer high-quality calculation, storage, and application capacity. e cloud customers choose to outsource their local data and computation to the cloud server for minimizing the data maintenance cost. us, to protect users’ privacy and achieve efficient and precise data retrieving from the cloud server has become the focus of recent works. E search schemes based on ciphertext [1,2,3,4,5,6,7] can guarantee the data privacy but the search algorithms have high time and space complexity, which are not suitable for cloud data retrieval. To solve this problem, researchers proposed a series of searchable encryption schemes [8,9,10,11,12,13] based on the theory of cryptography. We propose an α-filtering tree search scheme based on bisecting k-means clusters, which achieves efficient multi-keyword ranked search over encrypted cloud data.
Sign-in/Register to view highlights & summary Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
