The objective of this paper is to critically assess the security of expressive public-key encryption with keyword search (PEKS) schemes, with a particular focus on the transformed scheme. The paper aims to identify and demonstrate a significant vulnerability—a keyword guessing attack—that enables adversaries to infer hidden keywords. By exposing this weakness, the research seeks to provide insights into the limitations of current expressive PEKS constructions and to contribute to the development of more secure and resilient encryption schemes for cloud-based data privacy.
The public key encryption with keyword search (PEKS) scheme is a cryptographic primitive that allows a cloud server to search for a ciphertext without knowing the corresponding keyword used in the search. An expressive PEKS scheme is a variant of the PEKS scheme that supports conjunctive and disjunctive searches (expressive search). Utilizing the expressive properties of an attribute-based encryption (ABE) scheme, most of the expressive PEKS schemes can be constructed from an ABE scheme. In this paper, we first give a brief review of the transformed expressive PEKS scheme by Shen et al. in 2019.Then, we present a keyword guessing attack on Shen et al.’s transformed expressive PEKS scheme and show that an adversary can correctly guess the supposedly hidden keyword.
Keywords: Expressive PEKS, keyword guessing, key-policy ABE.
NOTE: Without the concern of our team, please don't submit to the college. This Abstract varies based on student requirements.

Hard Disk - 160GB
Key Board - Standard Windows Keyboard
Mouse - Two or Three Button Mouse
Monitor - SVGA
RAM - 8GB
S/W CONFIGURATION:
• Operating System : Windows 7/8/10
• Server side Script : HTML, CSS, Bootstrap & JS
• Programming Language : Python
• Libraries : Flask/Django, Pandas, Mysql, Smtplib, Numpy
• IDE/Workbench : PyCharm/VSCode
• Technology : Python 3.6+
• Server Deployment : Xampp Server