B. Kavitha, Dr. Y.Ravi Kumar


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.


Encryption; Inside Keyword Guessing Attack; Smooth Projective Hash Function; Diffie-Hellman Language; Keyword Search; Secure Cloud Storage;


C. Cocks, “An identity based encryption scheme based on quadratic residues,” in Cryptography and Coding. Cirencester, U.K.: Springer, 2001, pp. 360–363.

J. Baek, R. Safavi-Naini, and W. Susilo, “On the integration of public key data encryption and public key encryption with keyword search,” in Proc. 9th Int. Conf. Inf. Secur. (ISC), 2006, pp. 217–232.

D. Khader, “Public key encryption with keyword search based on K-resilient IBE,” in Proc. Int. Conf. Comput. Sci. Appl. (ICCSA), 2006, pp. 298–308.

K. Emura, A. Miyaji, M. S. Rahman, and K. Omote, “Generic constructions of secure-channel free searchable encryption with adaptive security,” Secur. Commun. Netw., vol. 8, no. 8, pp. 1547–1560, 2015.

L. Fang, W. Susilo, C. Ge, and J. Wang, “Public key encryption with keyword search secure against keyword guessing attacks without random oracle,” Inf. Sci., vol. 238, pp. 221–241, Jul. 2013.

Rongmao Chen, Yi Mu, Senior Member, IEEE, Guomin Yang, Member, IEEE, FuchunGuo, and Xiaofen Wang, “Dual-Server Public-Key Encryption With KeywordSearch for Secure Cloud Storage”, ieee transactions on information forensics and security, vol. 11, no. 4, april 2016.

R. Curtmola, J. Garay, S. Kamara, and R. Ostrovsky, “Searchable symmetric encryption: Improved definitions and efficient constructions,” in Proc. 13th ACM Conf. Comput. Commun. Secur. (CCS), 2006, pp. 79–88.

Full Text: PDF


  • There are currently no refbacks.

Copyright © 2012 - 2023, All rights reserved.| ijitr.com

Creative Commons License
International Journal of Innovative Technology and Research is licensed under a Creative Commons Attribution 3.0 Unported License.Based on a work at IJITR , Permissions beyond the scope of this license may be available at http://creativecommons.org/licenses/by/3.0/deed.en_GB.