Author(s): Maddela Sravanth Kumar

Abstract: Searchable encryption is increasing interest for protecting the data privacy in secure searchable cloud storage. The security of a well-known cryptographic primitive, namely, public key encryption with keyword search (PEKS) which is very useful in many applications of cloud storage. Shockingly, it has been demonstrated that the customary PEKS structure experiences an inborn uncertainty called inside catchphrase speculating assault (KGA) propelled by the vindictive server. To address this security helplessness, to manage this security shortcoming, we will in general propose a being born PEKS framework named twofold server PEKS (DS-PEKS). As another rule responsibility, we will in general portray a beginning variety of the agile projective hash limits (SPHFs) insinuated as immediate and Homomorphic SPHF (LH-SPHF). We tend to around then show a dull advancement of secure DS-PEKS from LH-SPHF. To stipulate the opportunity of our initial framework, we will in general offer a decent portrayal of the last structure from a determination Diffie–Hellman-predicated LH-SPHF and exhibit that it will achieve the lively protection from inside the KGA.

DOI: 10.33545/27075907.2020.v1.i2a.10

Pages: 01-03 | Views: 1494 | Downloads: 1110

Download Full Article: Click Here