Privacy Preserving Ranked Multi Keyword Search for Multiple Data Owners in Cloud Computing
Cloud computing has become increasingly popular for data owners to outsourcing their data in public cloud and also permits other users to fetch this data. With the advantage of flexibility and economic savings motivates both individuals and organizations to outsource their private complex data management system into the cloud. However, in reality cloud does not support only one or two user instead they supports millions of users and hence privacy issues of data is incurred. We are analyzing the schemes to deal with Privacy preserving Ranked Multi keyword Search in a Multi owner model (PRMSM) According to our analysis this scheme perform secure search without knowing the actual data of both keywords and trapdoors. For that we are going to develop secure search protocol. In this paper we are proposing a novel Additive Order and Privacy Preserving Function family to protect the legal data from the attackers. Furthermore, our proposed PRMSM supports efficient data user revocation. 1.Introduction Cloud computing is gaining more popularity in the world. User can remotely store his data on the server. With the advantage of flexibility and economic savings motivates both individuals and enterprises to out source their local complex data management system into the cloud [2] Cloud computing provides lots of benefits for user as well as enterprises to easy access, resource management, reduced cost etc. Despite of several benefits of cloud users are worried about the security for outsourced their data. These because once owner data is become outsourced, owner of the data completely lose his \her control from the data. Virtualization and firewalls are security concerns supplied by the cloud service providers are not able to protect data privacy. In many researchers secure search over encrypted data has attracted the interest. Song et al [4] In this paper, a privacy preserving ranked multi keyword search protocol in a multi owner cloud model. This enables users for secure search without knowing the actual value of keywords and trapdoors. In this we are developing two protocols for different data owners use different keys to encrypt their files and keywords. Boolean keyword search scheme solves the problem of suppo rting efficient ranked keyword search. By doing this effective utilization of remotely stored encrypted data is achieved in Cloud Computing. It enhances system usability by returning the matching files [7] This paper develop secure search protocol and proposed a novel Additive Order and Privacy Preserving Function family to protect the legal data from the attackers. Alexandra Boldyreva Nathan Chenette Adam O'Neill [18] addressed the problems of security of the ideal object" ROPF, for improving security of the any OPE (Order Preserving Encryption) scheme. This system implements simple transformation that can work efficient to any OPE scheme. Efficiently Orderable Encryption (EOE) is proposed further for define general primitive of efficient OPE scheme. Dynamic secret key generation protocol and a new data user authentication protocol for preventing attackers from monitoring the secret keys and covering to be legal data [1] 2 Literature Survey: Wei Zhang, Yaping Lin, Sheng Xiao, Jie Wu, and Siwang Zhou [1] explore the problem of secure multi keyword search in multi keyword search. PRMSM model in this system searches a keywords without knowing actual data of Vol 2 Issue 1 2016 IJARIIE ISSN(O) 2395 4396 1612 www.ijariie.com 473 trapdoors as well as keywords. This system preserves the keywords and files systematically. In this sy stem sum of the relevance scores is used to search result in metric. Authors defined the problem of secure search over encrypted data. Additive Order and Privacy Preserving Function family (AOPPF) is proposed to preserve the privacy of relevant scores of different functions. This system works on Ranked Multi keyword Search over Multi owner, Data owner scalability, Data user revocation and Security Goals of system. M. Armbrust, A. Fox, R. Griffith, A. D. Joseph, R. Katz, A. Konwinski, G. Lee, D. Patterson, A. Rabkin, I. Stoica, and M. Zaharia, [2] provides the simple figure to evaluate the comparison between cloud computing and conventional computing. It also identifies functional and non functional opportunities of cloud storage. C. Wang, S. S. Chow, Q. Wang, K. Ren, and W. Lou [3] provide data security in cloud this paper proposed a privacy preserving public auditing system. This system handles multiple audit session different users for their outsourced data files. The privacy preserving public auditing scheme required to design auditing protocol to prevent data from flowing away. Therefore it is not completely solve the problem of privacy preserving in key management. Therefore unauthorized data leaked problem cannot be solved by this system. TPA audit out sourced data when it is required. Authors were utilizes homomorphic linear authenticator and random masking to provide assurance that TPA cannot learn about knowledge of data. D.Song, D.Wagner, and A.Perrig,[4],describes cryptographic schemes for the prob lem of searching on encrypted data. It also provides proofs of security for the resulting crypto systems. This scheme is provably secure for remote searching on encrypted data using an untrusted server. This system searches data remotely from untrusted server. This system provides the proofs of security that required for crypto systems. This system worked efficiently for query isolation as they are simple and fast. Only O(n) stream cipher required for encryption and search algorithm. R. Curtmola, J. Garay, S. Kamara, and R. Ostrovsky [5],reviewing existing notions of security and propose new and stronger security definitions called as Searchable symmetric encryption (SSE) This scheme allows outsourcing the data to other party. They proved stronger security level. This system solves the problem of searchable symmetric encryption. This system provides guarantee of security for user which aims to perform search at once. Two new SSE constructions are proposed for stronger security definitions. P. Golle, J. Staddon, and B. Waters [6] proposed protocols that allow for conjunctive keyword queries on encrypted data. It solves the problem of secure Boolean search. This technique is based on simple keyword search method. This system proposed an approach that define s metakeywords that are associated with documents. Problem with this approach is that It requires, 2m keyword search for every keyword m. C. Wang, N. Cao, J. Li, K. Ren, and W. Lou,[7],proposed schemes in this paper support only boolean keyword search. This scheme solves the problem of supporting efficient ranked keyword search. By doing this effective utilization of remotely stored encrypted data is achieved in Cloud Computing. Authors were mainly concerning on searching effective as well as secure ranked keyword searching for encrypted data. This system uses SSE technique for keyword searching. For ranking function TF x IDF rules are used. For security purpose OPSE crypto primitive is developed in this system. N. Cao, C. Wang, M. Li, K. Ren, and W. Lou [8] define and solve the problem of multi keyword ranked search over encrypted cloud data (MRSE) and they also concern with preserving strict system wise privacy in the cloud computing paradigm. MRSE schemes to achieve various stringent privacy requirements in two different threat models. Coordinate matching technique is used to capture the relevance of data documents required for query. This system uses "inner product similarity" to search number of keywords in the document. To attempt this purpose authors were proposing MRSE technique. Compare to other mutikeyword ranked searching technique this system produces very overheads. J. Li, Q. Wang, C. Wang, N. Cao, K. Ren, and W. Lou [9],formalizes and solves the problem of effective fuzzy keyword search over encrypted cloud data and maintains keyword privacy. An advance technique is proposed i.e. wildcard based technique for searching fuzzy keywords. Fuzzy keyword search technique improves the usability of system by returning files with exactly matching keywords that are pre defined. Proxy server in this system is used to Vol 2 Issue 1 2016 IJARIIE ISSN(O) 2395 4396 1612 www.ijariie.com 474 give response for receiver keyword query. PEKS does not have a requirement of coordination between sender and receiver when they are firstly join in opposite. This system requires special methods for sorting the keywords. P. Xu, H. Jin, Q. Wu, and W. Wang [10] proposed a probabilistic public key system namely, PEKS. This technique is more convenient to search ciphertexts for multiple users. This system achieves the multi keyword search in fuzzy search. This system doe's not required any predefined keyword dictionary for keyword searching or keyword matching. This system adopts special hash function to build an index of searched keywords. LSH function approach is used to build index as well as to provide secure fuzzy search in multikeyword search. B. Wang, S. Yu, W. Lou, and Y. T. Hou [11] proposed a novel multi keyword fuzzy search scheme is for exploiting the locality sensitive hashing technique. Rather than expanding the index file fuzzy matching is done through algorithmic design. This approach of leveraging LSH functions in the Bloom filter provides efficient solution to the secure fuzzy search of multiple keywords. C. Wang, N. Cao, K. Ren, and W. Lou [12] developed a new crypto primit ive OPSE, and derive an efficient one tomany order preserving mapping function. This primitive is useful in cloud computing for supporting efficient ranked keyword search for achieving effective utilization of remotely stored encrypted data. This system focused on single keyword search. For single keyword searching IDF factor is taken into consideration. This system works efficiently as it does not have any multikeyword ranked searching problem. RSSE tech