<p>Searchable encryption is a cryptographic technique enabling efficient searching within a set of encrypted files, while preventing the ability to decrypt them. There are two main types of searchable encryption: symmetric searchable encryption and public key encryption with keyword search. Many existing public key encryption schemes with keyword search are vulnerable to threats from semi-honest but curious servers. This means that the server storing the data may provide incomplete or incorrect information in response to search queries. In this study, we introduce a new approach called Secure Channel Free Verifiable Public key Encryption with Keyword Search (SCF-VPEKS), which builds upon the principles of secure channel free public key encryption with keyword search (SCF-PEKS). Our proposed scheme is designed to address the issues of insider and outsider keyword guessing and file-injection attacks, providing verifiability and robustness against various threats. Through security analysis, we demonstrate that our scheme can withstand not only honest-but-curious server threats but also semi-honest-but-curious server threats.</p>