A SCRIPT TOWARDS SECURITY-PRESERVING AND NUMEROUS WORD SEARCH METHOD ON ENCRYPTED DATA IN CLOUD COMPUTING PREMISES

Abstract

Cloud information owners prefer to outsource documents in an encrypted form for the motive of private
retaining. Therefore it's far critical to expand green and reliable ciphertext search techniques. One project is that the
relationship between files may be usually concealed within the system of encryption, so that you can cause enormous search
accuracy performance degradation. Also, the extent of statistics in statistics centers has experienced a dramatic increase.
This will make it even more hard to design ciphertext seek schemes that may provide green and reliable online information
retrieval on a large quantity of encrypted statistics. In this paper, a hierarchical clustering approach is proposed to assist
greater seek semantics and also to satisfy the demand for fast ciphertext search inside a big data environment. The proposed
hierarchical technique clusters the files primarily based at the minimal relevance threshold and then partition the resulting
clusters into sub-clusters until the constraint at the most length of the cluster is reached. In the search section, this method
can attain a linear computational complexity in opposition to an exponential size boom of file series. In order to confirm the
authenticity of seek results; a structure called minimal hash sub-tree is designed in this paper. Experiments had been
performed using the collection set constructed from the IEEE Xplore. The outcomes show that with a sharp boom of files in
the dataset the search time of the proposed technique will increase linearly whereas the hunt time of the traditional technique
will increase exponentially. Furthermore, the proposed method has a bonus over the traditional method inside the rank
private and relevance of retrieved files