Paper Title
Efficient Way of Retrieving Users Secure Data in Cloud Using Multi Keyword

Abstract
Users can added various records in the form of text, image, audio, video etc. through the program by using encryption algorithm so as to it be able to stored on cloud. Thus we can secure data on a cloud. Due to this efficiency is increase and data will be secure on the cloud. Recently, some research considers the complexity of protected and ordered community information truthfulness audit for shared energetic data. But this scheme is not protected next to support of confuse storage space server. An ordered community truthfulness auditing with a protected set consumer revocation based on vector commitment and collection user revocation. A scattered key image group algorithm is toward produce authentic user passwords diagonally many servers and remove on its own position failure. This system chain the community read-through and capable consumer revocation and also provide confidentiality, good society and traceability of protected collection customer revocation. A homomorphism encryption algorithm as well as use designed for creating single identification for the users. In this system, we apply a novel community verify technique for the truthfulness of common data with well-organized consumer revocation in a mind. Be applicability scheme of replacement re-signatures. It funding the shades to leave block on favour of obtainable user through the revocation, so as to obtainable user perform not require to download and leave blocks in themselves. In a public verify, it always able to audit the truthfulness of common data with no the fetching of whole information beginning the confuse, even if several parts of common data have been quit by cloud. This method is adept to hold batch audit by verify many audit mission simultaneously. Experimental results shows that our machine be capable of considerably recover the efficiency of consumer revocation. Keywords- Cloud Computing, User Revocation, Public Integrity Auditing, Encryption.