4.6 Article

VPAMS: Verifiable and practical attribute-based multi-keyword search over encrypted cloud data

Journal

JOURNAL OF SYSTEMS ARCHITECTURE
Volume 108, Issue -, Pages -

Publisher

ELSEVIER
DOI: 10.1016/j.sysarc.2020.101741

Keywords

Cloud storage; Multi-keyword search; Verification; k-nearest neighbor (k-NN)

Funding

  1. National Natural Science Fundation of China [61802243, 61602232, 61572246]
  2. Key R&D Program in industry field of Shaanxi Province [2019GY-013]
  3. Fundamental Research Funds for the Central Universities [GK201002037, GK201903011]

Ask authors/readers for more resources

With fast development of cloud storage, people increasingly outsource their files to the cloud server. To protect the confidentiality of outsourced files, files often are encrypted before outsourced. However, the accurate location and search on encrypted files will be greatly limited. This paper mainly considers how to realize an accurate multikeyword fine-grained search on the encrypted files. Firstly, we use multiple keywords and an improved k-nearest neighbor (k-NN) technology to improve the search accuracy. Secondly, our scheme can protect the privacy of the file keyword indexes and the search queries and further preserve the privacy of outsourced files and users. Thirdly, unlike other existing multi-keyword search schemes without considering the verification and decryption of search results, the data users in our scheme not only can check whether the returned files contain multiple queried keywords, but also can realize the authorized decryption of the search files by using attribute-based encryption. Finally, performance evaluations show the time costs of our search algorithm is a constant value and independent of the number of user attributes. Therefore, our scheme is more efficient and practical.

Authors

I am an author on this paper
Click your name to claim this paper and add it to your profile.

Reviews

Primary Rating

4.6
Not enough ratings

Secondary Ratings

Novelty
-
Significance
-
Scientific rigor
-
Rate this paper

Recommended

No Data Available
No Data Available