A NOVEL AND CAPABLE SCHEME ASSURANCE DATA PRIVACY OF ENCRYPTION CATEGORY

Abstract

During this paper, we must have another critical property of smooth projective hash functions. We introduce two games, namely semantic-security against selected keyword attack as well as in distinguish ability against keyword guessing attack1 to capture the safety of PEKS ciphers text and trapdoor, correspondingly. A principal component of our construction for dual-server public key file encryption with keyword search is smooth projective hash function, an idea created by Cramer and Shoup.  In spite of being free of secret key distribution, PEKS schemes are afflicted by an natural insecurity concerning the trapdoor keyword privacy, namely inside Keyword Guessing Attack. Regrettably, it has been established the conventional PEKS framework is struggling with an all-natural insecurity known as inside keyword guessing attack launched using the malicious server. To handle this security vulnerability, we advise a totally new PEKS framework named dual-server PEKS. You have to show a regular construction of secure DS-PEKS from LH-SPHF. Our plan is easily the most efficient when it comes to PEKS computation. For the reason that our plan doesn't include pairing computation. Particularly, the present plan necessitates the most computation cost because of 2 pairing computation per PEKS generation.