ResearchBib Share Your Research, Maximize Your Social Impacts
Sign for Notice Everyday Sign up >> Login

Achieving Efficient Multi-Keyword Ranked Search over Encrypted Cloud Data Using Bloom Filters

Journal: International Journal of Science and Research (IJSR) (Vol.6, No. 1)

Publication Date:

Authors : ; ;

Page : 1621-1624

Keywords : Cloud computing; Multi- search; Ranking; Privacy requirement; Searchable encryption;

Source : Downloadexternal Find it from : Google Scholarexternal

Abstract

In emerging cloud computing, a central application is to outsource the files and record belonging to its user, to outer cloud servers for adaptable information storage. The outsourced documents and files should be encrypted because of the protection and secrecy worries of their proprietor. As there is large amount data present in the cloud it is very important to have a multi- search over the encrypted data. Essentially huge amount of data is present on cloud and providing it for any time on demand request is difficult and is challenging. As searching is time consuming process it is important to provide multi search giving a ranking result to get effective data. To maintain accuracy of search result and also provide better searching experience, it is important for such ranking system to provide multiple searches, as single search gives lots of noisy data. However, for privacy requirement encryption should be done on the sensitive data before outsourcing it, which obsoletes data utilization like information retrieval based on. The main goal of efficient and secure search is building up the searchable encryption for multi- ranked search over the scalable data documents that are stored on cloud.

Last modified: 2021-06-30 17:35:27