The searchable encryption scheme is employed to address privacy and data confidentiality issues in outsourced databases. It enables users to send encrypted search queries containing a keyword to a server, which then returns all encrypted documents containing the specified keyword without learning additional information about the queries or documents. Boneh et al. [2] proposed a scheme for searching encrypted keywords without leaking information about the keywords and original documents. A unique technique for public-key encryption with keyword search (PEKS) has been presented in this paper, leveraging the power of bilinear pairings, offering better performance than [2] due to not using pairing operation in the encryption. Our scheme can also search conjunctive keywords simultaneously without leaking information and does not require the establishment of a secure channel, known as the secure channel free scheme. Additionally, we introduce a highly efficient SSE scheme that enables advanced conjunctive search capabilities. The innovative approach has been thoroughly examined and verified to be secure.