Searchable Encryption (SE) systems provide cloud information with safety and privacy. The current SE methods allow multiple users to search using various systems such as Broadcast Encryption (BE), Attribute-Based Encryption (ABE), etc. These systems, however, do not allow various users to conduct the search procedure over various owners ' encrypted information. Some SE systems require a Proxy Server (PS) that allows various users to search. However, these approaches incur a huge computational burden on PS due to the repeated encryption of the user queries for transformation purpose to ensure that users’ query is searchable over the encrypted data of multiple owners. Therefore, this project recommends a safe proxy server strategy to eliminate this computational burden on PS that conducts the search procedure without transforming user queries. This method also returns appropriate top-k records to user queries using a similarity method to Euclidean distance. This strategy is effective in terms of search time and precision based on the experimental study. This scheme does not allow making search operations over the data owned by multiple owners that is do not supports search operations in multiple owners and multiple user environments. So we proposed in this project half encryption-based multi-user keyword search over encrypted cloud data. In this project, the data owner creates an index for each document. It encrypts the document collection and sends the encrypted documents over to the cloud server. The words in the indices are partially encrypted with the owner’s secret key and then these indices are sent to the proxy server. This project we have proposed two algorithms IBE algorithm to perform the Encryption. Top Rank, the files, and another algorithm is the TF/IDF algorithm which calculates the term frequency of each keyword.