Novel approach for Secure Cloud Storage with Similar word Search

Abstract

Searchable encryption is of increasing interest for protecting the data privacy in secure searchable cloud storage. In this paper, we investigate the security of a well-known cryptographic primitive, namely, public ,encryption with similar word search ,which is very useful in many applications of cloud storage. Unfortunately, it has been shown that the traditional ,framework suffers from an inherent insecurity called inside similarword guessing attack ,launched by the malicious server. To address this security vulnerability, we propose a new ,framework named dual-server similar. As another main contribution, we define a new variant of the smooth projective hash functions ,referred to as linear and homomorphic We then show a generic construction of secure DS-,from LH-SPHF. To illustrate the feasibility of our new framework, we provide an efficient instantiation of the general framework from a Decision Diffie–Hellman-based LH-SPHF and show that it can achieve the strong security against inside the KGA.