Ranked Search of Encrypted Cloud Data Using Multi-Keyword Synonyms and Greedy Depth-First Search

With the advancement of cloud services, usage of cloud services in every aspect of information technology has surpassed its peak. More and more people are worried that private data would be vulnerable while it is being sent through cloud services. If people who aren’t part of a company get access to its cloud tools, they could tamper the company’s databases and its content to some extent. Encryption is the primary mode to make sure that the data you store in the remote server is safe. But looking through a enormous amount of protected data comes with its own set of problems. In this work, we study the state-of-the-art research that has been worked in this domain to delve how other researchers have dealt with these issues. Our main aim is to provide the fastest search speeds that could be attempted without compromising the privacy of the data or the efficiency with which computers handle the data at risk. In answer to this, we have come up with a new way to encrypt data that is perfect for cloud computing. We think that the Greedy Depth-First Search (DFS) Ranked Searching method will make it easier to find encrypted content quickly and accurately. Our number one goal is to come up with the best ways to cut down on the time spent using cloud technology. In order to reach our goal of making a unified encryption method that can work with a wide range of encryption methods, we are researching how to combine these methods. This method allows approach of multi ranked keyword search algorithms and makes sure that a good way to protect privacy is in place at the same time.