A Glorified Secure Search Schema over Encrypted Secured Cloud Storage with a Hierarchical Clustering Computation

There are many secure objections in a multi-user strategy. First, all the users habitually keep the same secure key for trapdoor origination in a symmetric SE scheme. In this case, the revocation of the user is big demanding. If it is needed to revoke a user in this scheme, we demand to rebuild the index and disseminate the new secure keys to all the authorized users. Second, symmetric SE schemes frequently consider that all the data users are trustworthy with believable in nature. For an instance consider, a dishonest data user may search the documents and disseminate the decrypted documents to the unauthorized ones. There may be also chances of; a dishonest data user may disseminate his/her secure keys to the unauthorized ones. In the proposed work, we improve the SE scheme to grasp these challenge problems. In our enhancement model, a hierarchical clustering method is designed to guide more search semantics with an additional feature of making the system to cope the demand for fast cipher text search in large scale environments such as Big Data scenarios. The proposed hierarchical approach clusters the cloud documents with the minimum relevance threshold, and then divides the resulting clusters into sub-clusters until the necessity on the maximum size of cluster is reached. In the search module part of the proposed system, this advent model can influence a linear computational complexity against an exponential size increase of document collection.