PROTECTED CLOUD REPOSITORY WITH PUBLIC KEY SEARCH BY ENCRYPTION IN TWO SERVERS
Keywords:
Keyword search, secure cloud storage, encryption, inside keyword guessing attack, smooth projective hash function, Diffie-Hellman language.Abstract
Searchable encryption is of increasing interest for shielding the information privacy in safe searchable cloud storage. In this paper, we check out the safety of a famous cryptographic primitive, specifically, public key encryption with key-word seeks (PEKS) which could be very beneficial in lots of programs of cloud storage. Unfortunately, it has been proven that the traditional PEKS framework suffers from an inherent lack of confidence referred to as interior keyword guessing attack (KGA) released via the malicious server. To cope with this protection vulnerability, we propose a new PEKS framework named twin-server PEKS (DS-PEKS). As any other main contribution, we outline a brand new variant of the clean projective hash capabilities (SPHFs) called linear and homomorphic SPHF (LH-SPHF). We then show an accepted creation of relaxed DS-PEKS from LHSPHF. To illustrate the feasibility of our new framework, we offer a green instantiation of the general framework from a Decision Diffie–Hellman-based totally LH-SPHF and show that it could attain the sturdy protection towards within the KGA.
