Efficient privacy‐preserving scheme supporting disjunctive multi‐keyword search with ranking

• Published in: Concurrency and computation 2020-01, Vol.32 (2), p.n/a
• Main Authors: Handa, Rohit, Rama Krishna, C., Aggarwal, Naveen
• Format: Article
• Language: English
• Subjects: cipher‐text search; disjunctive search; Encryption; Information retrieval; Information storage; keyword binning; multi‐keyword search; Optimization; Privacy; privacy‐preserving; ranked search; Searching; storage‐as‐a‐service
• ISSN: 1532-0626; 1532-0634
• DOI: 10.1002/cpe.5450

Summary Information storage and retrieval from the cloud is growing continuously unabated. The cost‐efficient solutions offered by the cloud providers to the end‐users have motivated them to outsource their confidential data to the cloud. Outsourcing confidential data leads to enhanced privacy risks due to disclosure of sensitive information to adversaries. To handle this disclosure of information, encryption is preferred, but it hinders the efficient searching on the documents. The existing searchable encryption schemes either focused on optimization of search time or improvement of search efficiency. To solve this trade‐off between search time and search efficiency, we propose an efficient disjunctive search scheme using non‐positional inverted index. To the best of our knowledge, there is no searchable encryption scheme based on the non‐positional inverted index in the literature. Thus, we first propose a basic scheme based on a non‐positional inverted index to search the desired keywords and highlight its inefficiency in terms of high search time required. To perform efficient searching, an extended search scheme is proposed using keyword binning, which reduces comparisons required and improves the search time. The extended search scheme has recall of 100% and precision 99.75%. The experimental analysis of the proposed scheme on real datasets proves that the proposed scheme is privacy‐preserving and efficient.