Article thumbnail
Location of Repository

General Terms

By Qi Chai and Guang Gong

Abstract

Outsourcing data to cloud servers, while increasing service availability and reducing users ’ burden of managing data, inevitably brings in new concerns such as data privacy, since the server may be honest-but-curious. To mediate the conflicts of data usability and data privacy in such a scenario, research of searchable encryption is of increasing interest. Motivated by the fact that a cloud server, besides its curiosity, may be selfish in order to save its computation and/or download bandwidth, in this paper, we investigate the searchable encryption problem in the presence of a semihonest-but-curious server, which may execute only a fraction of search operations honestly and return a fraction of search outcome honestly. To fight against this strongest adversary ever, a verifiable SSE (VSSE) scheme is proposed to offer verifiable searchability in additional to the data privacy, both of which are further confirmed by our rigorous security analysis. Besides, we treat the practicality/efficiency as a central requirement of a searchable encryption scheme as well. To this end, we implemented and tested the proposed VSSE, with real world data sets, on a laptop (serve as the server) and a mobile phone running Android 2.3.4 (serve as the user). The experimental results optimistically suggest that the proposed scheme satisfies all of our design goals

Year: 2012
OAI identifier: oai:CiteSeerX.psu:10.1.1.228.5535
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://www.cacr.math.uwaterloo... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.