An Efficient Privacy-Preserving Ranked Keyword Search Method. Issue 1 (March 2021)

• Record Type: Journal Article
• Authors: Nirmala, E.; Muthurajkumar, S.; Subitha, D.
• Is Part Of: IOP conference series. Volume 1084:Issue 1(2021)
• Publication Date: 2021-03
• Subjects: Fuzzy Gramm algorithm -- Bloom Filter Algorithm -- query base searching -- multiple keyword searching algorithms; Materials science -- Periodicals; 620.1105
• DOI: 10.1088/1757-899X/1084/1/012103
• Languages: English
• ISSNs: 1757-8981

Abstract

Abstract: The keyword searching algorithm plays a vital role in cloud computing Architecture. Here, the searching technique is applied as a tool to encrypted data set which is outsourced. This technique works well, by either directed on multi keyword findings with exact match or one keyword search with fuzzy logic with a result of true or false. Though the existing techniques come across sensible difficultyin execution upon the encrypted data set, in the execution of multiple keyword based searching, keyword correction is difficult to achieve. To overcome with this problem, we construct a highly efficient, multiple corrections in keyword searching algorithm using ranking scheme. Multiple corrections like spell checks and errors. In the existing system of Author Wang and others scheme, they were unable to address the aforementioned problems, But in our method of multiple keyword searching technique, the Fuzzy Gramm algorithm helps to detect and handle the spelling errors by making a function call. Additionally the keywords with similar ancestry can be found by making use of stemming procedure. Alongside with thatrank keyword is used to achieve accurate checking with matched text file content. Thus the proposed approach enhances security and reliability to the maximum extent compared to the existing system.