SEARCH FOR MULTI-KEYWORD WITH PRIVACY PROTECTION IN ENCRYPTION DATA

Hierarchical grouping technique is proposed to help more semantic search and to satisfy the interest in the quick search engine cipher text in an atmosphere of great data. In addition, we evaluate the effectiveness and security of the appearance among two popular threat models. A challenge would usually hide the relationship between documents during file encryption, which could lead to significant performance decline in search. Data levels in data centers also had a dramatic growth. It makes it much harder to schedule designing search cipher text that can provide information retrieval effectively and reliably online in a very encrypted data. An experimental platform should evaluate the effectiveness of the search engine effectiveness, accuracy and extent of security. The result of the experiment shows that the proposed architecture not only solves the problem of qualified search multiple keywords, brings a noticeable difference in the effectiveness of the search, security rank and relevance among the story documents. In the search phase, this method can achieve computational complexity straight face exponentially increased size of the document collection. Due to the insufficient classification mechanism, users must take a long time to choose what you need when the bulk of documents maintain the keyword query. Therefore, order retention techniques are used to execute the classification mechanism. In order to verify the authenticity of search engine results, a structure is known as a minimum hash subtree created in this document. In addition, the proposed method has an advantage over the standard method within the scope of privacy and relevance of retrieved documents