期刊名称：International Journal of Innovative Research in Science, Engineering and Technology
印刷版ISSN：2347-6710
电子版ISSN：2319-8753
出版年度：2017
卷号：6
期号：4
页码：6701
DOI：10.15680/IJIRSET.2017.0604086
出版社：S&S Publications
摘要：As Cloud Computing technology becomes more mature, many organizations and individuals areinterested in storing more sensitive data in the cloud for great convenience and reduced cost in data management . Suchsensitive data needs to be encrypted before it is outsourced to the cloud. Typically, the cloud servers also need tosupport a keyword search feature for these encrypted files. This work is extending the work of Xia[1] "A Secure andDynamic Multi-Keyword Ranked Search Scheme over Encrypted Cloud Data" by incorporating the approximatekeyword matching. Xia's schema includes secure multi-keyword ranked search scheme over encrypted cloud data,which simultaneously supports dynamic update operations like deletion and insertion of documents. Specifically, thevector space model and the widely-used TF*IDF model are combined in the index construction and query generation.We construct a special tree-based index structure and propose a Greedy Depth-first Search algorithm to provideefficient multi-keyword ranked search. The secure kNN algorithm is utilized to encrypt the index and query vectors,and meanwhile ensure accurate relevance score calculation between encrypted index and query vectors. These schemessupport only exact keyword matching. As a result, if keywords are misspelled, incorrect results are returned. Toovercome this issue, this work uses the concept of proposes an algorithm that, even if the keyword was misspelled, itreturns the documents which has high probability.
