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 key encryption with keyword search (PEKS) which is very useful in many applications of cloud storage. Unfortunately, it has been shown that the traditional PEKS framework suffers from an inherent insecurity called inside keyword guessing attack (KGA) launched by the malicious server. To address this security vulnerability, we propose a new PEKS framework named dual-server PEKS (DS-PEKS). As another main contribution, we define a new variant of the smooth projective hash functions (SPHFs) referred to as linear and homomorphic SPHF (LH-SPHF). We then show a generic construction of secure DS-PEKS 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.
Location-based social network, text mining, travel route recommendation.
A.Vijaya Durga , Dr . N. Koteswaramma , B. Lakshmi Praveena "Dual-Server Public-key Encryption With Keyword Search For Secure Cloud Storage" Iconic Research And Engineering Journals Volume 1 Issue 10 2018 Page 218-224
A.Vijaya Durga , Dr . N. Koteswaramma , B. Lakshmi Praveena "Dual-Server Public-key Encryption With Keyword Search For Secure Cloud Storage" Iconic Research And Engineering Journals, 1(10)