Efficient Multi-User and Multi-Keyword Ranked Search Scheme for Encrypted Cloud Data

Abstract

With the improvement of cloud storage, greater data users are willing to outsource their data to cloud offerings. For privacy issues, sensitive data must be encrypted before outsourcing. There are numerous searchable encryption schemes to ensure statistics availability. However, the present search schemes pay little attention to the performance of facts users' queries, specifically for the multi-user situation. To allow the cloud servers to perform a search without understanding any statistics, to assemble a novel search and efficient technique based totally on the encrypted cloud statistics the usage of the "ECC cryptography scheme". To obtain an efficient search, for every statistics person, a tree-based totally index encrypted with an additive order and secure characteristic is constructed. In order to rank the search outcomes, the proposed method utilize and model the relevance ratings of facts documents and advise a ``Iterative Deepening Depth-First Search'' (ID-DFS) set of rules to attain the ranked results. To perform a keyword-primarily based query, the complete records set needs to be decrypted despite the fact that the matching end result set may be very small. It poses insufferable query latency and incurs unacceptable computational overhead. Finally, the proposed approach confirms the security and performance of the proposed scheme through complete theoretical evaluation and big experiments with real dataset.