Please use this identifier to cite or link to this item:
http://hdl.handle.net/10603/285480
Title: | Hybrid approach for privacy preserving multi keyword ranked search on encrypted cloud data |
Researcher: | Handa, Rohit |
Guide(s): | C. Rama Krishna and Aggarwal, Naveen |
Keywords: | Cloud storage Conjunctive Search Disjunctive Search Engineering and Technology,Computer Science,Computer Science Artificial Intelligence Keyword-binning Searchable Encryption |
University: | Panjab University |
Completed Date: | 2019 |
Abstract: | Cloud provides numerous advantages which attract a large number of users to utilize cloud storage to store their data. This leads to reduced infrastructure requirements thereby reducing the financial burden borne by the end users. Hence, there is a shift from hefty capital expenditure (CapEx) to lower operational expenditure (OpEx) in the form of monthly subscriptions. newlineVarious security challenges have emerged the moment user s data leaves the trusted premises as the control over their data is lost. To offer enhanced privacy, encryption is considered as a preferred solution. By encrypting the data, the end users are assured that the privacy of the data is maintained even if the data is compromised. newlineBut, encryption reduces the possibility of retrieving the relevant data without decrypting the entire collection. To provide search facility, various Searchable Encryption (SE) schemes emerged. But, these schemes either search the documents with all the search terms quickly or they can search the documents containing the subset of the search terms at high search time. Thus, it is desirable to propose a system which can overcome this imbalance between search efficiency and search capability. newlineIn this thesis, in the first phase, two conjunctive search schemes have been proposed which focus on decreasing the candidate documents to be explored. As search time is directly proportional to the comparisons performed, so with a decrease in the candidate documents, the search time decreased. The first scheme is based on document clustering and is restricted by the keywords supported per cluster. The second scheme is based on keyword binning and is independent of such restriction. Thus, efficient retrieval with limited capability is explored. newlineIn the second phase, a disjunctive search scheme has been proposed which can find the documents with a subset of the query terms. Further, with keyword binning incorporated, the relevant documents can be efficiently retrieved. |
Pagination: | xx,217p. |
URI: | http://hdl.handle.net/10603/285480 |
Appears in Departments: | National Institute of Technical Teachers Training and Research (NITTTR) |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
01_title.pdf | Attached File | 6.41 kB | Adobe PDF | View/Open |
02_certificate.pdf | 1.37 MB | Adobe PDF | View/Open | |
03_acknowledgment.pdf | 47.44 kB | Adobe PDF | View/Open | |
04_abstract.pdf | 47.18 kB | Adobe PDF | View/Open | |
05_abbreviations.pdf | 46.49 kB | Adobe PDF | View/Open | |
06_list_of_tables.pdf | 96.29 kB | Adobe PDF | View/Open | |
07_list_of_figures.pdf | 97.04 kB | Adobe PDF | View/Open | |
08_contents.pdf | 76.5 kB | Adobe PDF | View/Open | |
09_chapter1.pdf | 1.38 MB | Adobe PDF | View/Open | |
10_chapter2.pdf | 860.37 kB | Adobe PDF | View/Open | |
11_chapter3.pdf | 78.1 kB | Adobe PDF | View/Open | |
12_chapter4.pdf | 813.61 kB | Adobe PDF | View/Open | |
13_chapter5.pdf | 426.38 kB | Adobe PDF | View/Open | |
14_chapter6.pdf | 346.82 kB | Adobe PDF | View/Open | |
15_chapter7.pdf | 288.97 kB | Adobe PDF | View/Open | |
16_chapter8.pdf | 129.79 kB | Adobe PDF | View/Open | |
17_references.pdf | 234.72 kB | Adobe PDF | View/Open | |
18_list_of_publications.pdf | 74.9 kB | Adobe PDF | View/Open |
Items in Shodhganga are licensed under Creative Commons Licence Attribution-NonCommercial-ShareAlike 4.0 International (CC BY-NC-SA 4.0).
Altmetric Badge: