VPSearch: Achieving Verifiability for Privacy-Preserving Multi-Keyword Search Over Encrypted Cloud Data

0
790
VPSearch: Achieving Verifiability for Privacy-Preserving Multi-Keyword Search over Encrypted Cloud Data

VPSearch: Achieving Verifiability for Privacy-Preserving Multi-Keyword
Search Over Encrypted Cloud Data

Abstract

While cloud computing offers elastic computing and storage resources, it poses challenges to computational verifiability and data privacy. In this VPSearch: Achieving Verifiability for Privacy-Preserving Multi-Keyword Search over Encrypted Cloud Data work, we investigate verifiability for searching for multi-keyword privacy over outsourced documents. Because the cloud server may return incorrect results due to system failures or incentive to reduce computation costs, it is critical to simultaneously offer verifiability of search results and privacy protection for outsourced data.

 

VPSearch: Achieving Verifiability for Privacy-Preserving Multi-Keyword Search Over Encrypted Cloud Data To meet these requirements, by integrating an adapted homomorphic MAC technique with a multi-keyword search scheme, we design a V erifiable P rivacy-preserving keyword Search scheme, called VPSearch. The proposed scheme enables the client to efficiently verify search results without storing a local copy of the outsourced data.

Advantages

  • By applying our adaptedhomomorphic MAC, our proposed scheme is able to achieveverifiable privacy-preserving multi-keyword search over encryptedcloud data.
  • To our best knowledge, our solution is thefirst to use the homomorphic MAC to achieve both verifiabilityand privacy for multi-keyword search.
  • VPSearch is highlyefficient as it uses only a one-way function (pseudorandomfunction) for security, making it scalable to large databases.Since top-k retrieval for search results is a commonly usedoperation, we further propose a random challenge techniqueto verify top-k multi-keyword search results.
  • This techniqueenables the client to detect wrong top-k results with probabilityclose to 1.

Disadvantages

  • Althoughfully homomorphic encryption provides a seemingly perfectsolution for supporting arbitrary computations over encrypteddata, its prohibitive computation cost makes it impracticalcurrently.
  • Unfortunately, all these schemes assume the cloud server will follow the designated protocols honestly, i.e. the honest-but-curious model, while whether the computation result is authentic is not considered in those proposals.

System Configuration

H/W System Configuration
Speed                   : 1.1 GHz
RAM                      : 256 MB(min)
Hard Disk              : 20 GB
Floppy Drive          : 1.44 MB
Key Board             : Standard Windows Keyboard
Mouse                  : Two or Three Button Mouse
Monitor                : SVGA
S/W System Configuration

Platform                     :  cloud computing

Operating system       : Windows Xp,7,
Server                       : WAMP/Apache
Working on                : Browser Like Firefox, IE

Conclusion

In this paper we proposed the first verifiable privacy scheme to preserve multi-keyword search for cloud computing. Our scheme is implemented by applying an efficient homomorphic MAC scheme to a multi-keyword privacy-preserving scheme, and we have made necessary modifications to the homomorphic MAC scheme to support privacy-preserving multi-keyword search. We also provide a verification technique called random challenge to order topk search results.