An Efficient and Secured Multiple Keyword Cloud Data Searching Scheme with Dynamic Encryption Procedure
Ramachandran Thandaiah Prabu, P. Vijayakumari, K. Chanthirasekaran, K Jayamani, Pangi Vijaya Nirmala · 2022 International Conference on Advances in Computing, Communication and Applied Informatics (ACCAI) · 2022
Increasingly, data owners are choosing to shift their information to the cloud servers in order to benefit from more ease and lower costs in managing their information. Furthermore, in order to meet privacy regulations, confidential information should be protected by using cipher techniques before being outsourced, rendering outdated methods of data retrieval such as keyword assisted indexing. Using encrypted data in the cloud, a safe multiple keyword based ranked search method is described, that allows dynamic update activities such as content removal and accession. A novel Multi-Data Handling Cipher Policy (MDHCP) is introduced in this paper, in which it is used to build indexes and generate queries. The Greedy assisted Depth First Search (DFS) technique is designed based on a tree based data structure indexing and it allows for fast multiple keyword based ranked search mechanism. On top of that, it ensures correct relevance score computation between the encrypted index and query vectors by using the secured ensemble approach. Search results can be blinded by synthetic phrases inserted to the indexing vector in necessary to defend against statistical assaults. With our tree oriented indexing structure and the suggested technique is able to achieve sub linear search times and handle content deletions and insertions more easily. For the suggested plan to be proven effective, extensive testing is carried out. The resulting section shows the efficiency of the proposed approach and the graphical illustrations prove the ability of the proposed technique to maintain the data in safe manner over the cloud environment.