Secure Multi keyword Top-K Retrieval over the ...

ISSN: 2321-5585 (Online) ISSN: 2321-0338(Print)

IJRCSE Vol-5, Issue-5, Sep -Oct, 2015

Secure Multi keyword Top-K Retrieval over the Compressed Encrypted Cloud Data 1 1

Kola Pavithra, 2V.A Radhika, 3Anusha.M

M.Tech Student, 2Assistant Professor, 3Research Scholar, 1,2,3 Department of Computer Science and Engineering, 1,2,3 Nova College of Engineering and Technology, Vijayawada, A.P, India.

Abstract: Out sourcing of data can possible only with Cloud computing without any data loss and with security. Moreover sensitive information on cloud potentially causes privacy problems. Data encryption works for the security concern to protect the data storage in the cloud. Encrypted data can be retrieved by using two-round searchable encryption (TRSE). In this paper, proposed work addresses the data privacy issues using two-round searchable encryption (TRSE). Here similarity and data privacy is also very important to protect the data from leakage. The proposed system uses order preserving symmetric encryption (OPSE) to protect the cloud data and also provides efficient search results.

“autonomic computing” is to broaden horizons across organizational boundaries.

II. Cloud Computing Models

Cloud computing is a figuring ideal model, where a huge pool of systems are associated in private or public networks, to give powerfully adaptable foundation to application, information and record storage. With the appearance of this technology, cost of computation, application hosting, content storage and delivery is reduced significantly. Cloud computing is a viable way to deal with experience direct money saving advantages and it can possibly change a data centre from a capital-escalated set up to a variable evaluated environment. The thinking of cloud computing is based on a very fundamental principal of re usability of IT capabilities'. The difference that cloud computing brings compared to traditional concepts of “grid computing”, “distributed computing”, “utility computing”, or

Cloud Providers offer services that can be grouped into three categories: 1. Software as a Service (SaaS): SAAS offers number of software application in online. With the constant cost for storage and deployment SAAS offers reasonable cost to the clients who are using these SaaS applications. Today SaaS is offered by companies such as Google, Salesforce, Microsoft, Zoho, etc. 2. Platform as a Service (PaaS): To provide the operating system within the cloud environment we are having PaaS. To meet manageability and scalability requirements of the applications, PaaS providers offer a predefined combination of OS and application servers, such as LAMP platform (Linux, Apache, MySql and PHP), restricted J2EE, Ruby etc. Google s App Engine, Force.com, etc are some of the popular PaaS examples. 3. Infrastructure as a Service (Iaas): IaaS provides basic storage and computing capabilities as standardized services over the network. Servers, storage systems, networking equipment, data centre space etc. are pooled and made available to handle workloads. The customer would typically deploy his own software on the infrastructure. Some common examples are Amazon, GoGrid, 3 Tera, etc. To enhance possibility and save money on the cost in the cloud ideal model, it is liked to get the recovery result with the most applicable records that match clients' enthusiasm rather than every one of

www.ijrcse.com

International Journal of Research in Computer Science & Engineering 3047

Keywords: Multi keyword, TRSE, OPSE

I. Introduction

IJRCSE Vol-5, Issue-5, Sep -Oct, 2015

the documents, which shows that the documents ought to be positioned in the request of importance by clients' advantage and just the records with the most files with the highest relevance's are sent back to users. A progression of searchable symmetric encryption plans have been proposed to empower search on ciphertext. Traditional SSE plans empower clients to safely recover the ciphertext, yet these plans support only Boolean keyword search, i.e, whether a keyword exists in a record or not, without considering the distinction of importance with the queried keyword of these files in the result. Keeping the cloud from including in positioning and entrusting all the work to the client is a characteristic approach to avoid information leakage. On the other hand, the constrained computational force on the client side and the high computational overhead blocks data security.

III. Related Work Searchable encryption has likewise been considered in people in general key setting. Boneh et al. exhibited the first publickey-based searchable encryption plan, with a similar too situation. In their development, anybody with the general population key can keep in touch with the information put away on the server however just approved clients with the private key can look. As an endeavor to advance question predicates, conjunctive magic word seek over encoded information have likewise been proposed. Going for resilience of both minor sorts and arrangement irregularities in the user search input, fuzzy keyword search over scrambled cloud information has been proposed by Li et al. in [1]. Recently, a security guaranteed closeness look instrument over outsourced cloud information has been investigated by Wang et al. in [2]. Secure topk recovery from Database Community from database group is the most related work to our proposed RSSE. The thought of consistently dispersing posting components utilizing a request saving cryptographic capacity. On the other hand, 3048 International Journal of Research in Computer Science & Engineering

ISSN: 2321-5585 (Online) ISSN: 2321-0338 (Print)

the request saving mapping capacity proposed does not bolster score flow, i.e., any insertion and upgrades of the scores in the file will bring about the posting rundown totally remade. Zerr et al. utilize an alternate request protecting mapping taking into account pre-examining and preparing of the pertinence scores to be outsourced, which is not as effective as our proposed plans. Furthermore, when scores taking after distinctive disseminations should be embedded, their score change capacity still should be remade. Unexpectedly, in our plan the score elements can be effortlessly taken care of, which is an essential advantage acquired from the first OPSE. Taking after our examination on secure positioned hunt over scrambled information, as of late, Cao et al. [3] propose a security saving multiessential word positioned inquiry plan, which broadens our past work in [4] with backing of multi keyword question. They pick the rule of ―coordinate matching, i.e., whatever number matches as could be allowed, to catch the closeness between a multi-catchphrase inquiry question and information records, and later quantitatively formalize the guideline by a protected inward item reckoning system. One impediment of the plan is that cloud server needs to straightly cross the entire file of the considerable number of records for every hunt solicitation, while our own is as effective as existing SSE plans with just steady pursuit cost on cloud server. Encoded cloud information facilitating administration including three unique substances as represented in Figure 2.1, information proprietor, information client, and cloud server. Information proprietor has an accumulation of n information documents C = {F1, F2, . . . , Fn} that he needs to outsource on the cloud server in encoded structure while as yet keeping the capacity to hunt through them down powerful information use reasons. To do as such, before outsourcing, information proprietor will first form a safe searchable record I from an arrangement of m particular essential words W = {w1, w2, . . . ,wm} separated from the document www.ijrcse.com

ISSN: 2321-5585 (Online) ISSN: 2321-0338(Print)

IJRCSE Vol-5, Issue-5, Sep -Oct, 2015

gathering C, and store both the list I and the scrambled record accumulation C on the cloud server. The prerequisites of adjusting security and privacy with proficiency and exactness posture critical difficulties to the outline of quest plans for various hunt situations. This issue has pulled in premiums from the cryptography group as of late to explore speculations and procedures for ―searchable encryption. However; existing work just backings Boolean ventures to recognize the vicinity/nonappearance of terms of hobbies in encoded reports. Propels in data recovery have gone well past Boolean inquiries; scoring plans have been generally utilized to evaluate and rank-arrange the importance of a record to an arrangement of inquiry terms. The objectives of this paper are to investigate a structure to safely rank-request records because of an inquiry, and create strategies to extricate the most important document(s) from an expansive scrambled information accumulation. To our best information, this is the first endeavor in the exploration group to investigate secure rankrequested hunt. As a beginning step, we center in this paper on displaying normal situations of secure rank-requested inquiry and investigating indexing and hunt strategies based after existing built up cryptographic primitives. The understandings got from this investigation will clear approaches to unite specialists from data recovery and connected cryptography to build up a scaffold between these regions. The approval between the data owner and users is suitably done. To look the record gathering for a given magic word w, an approved client produces and presents a pursuit demand in a mystery shape—a trapdoor Tw of the watchword w—to the cloud server. After accepting the inquiry demand Tw, the cloud server is dependable to look the file I and return the comparing arrangement of documents to the client. We consider the protected positioned essential word seek issue as takes after: the query item ought to be returned by positioned pertinence criteria (e.g., catchphrase recurrence

based scores, as will be presented in a matter of seconds), to enhance document recovery precision for clients without former learning on the record accumulation C. In any case, cloud server ought to learn nothing or minimal about the pertinence criteria as they show noteworthy touchy data against watchword security. To reduce transfer speed, the client may send a optional value k alongside the trapdoor Tw and cloud server just sends back the top-k most relevant files to the user’s interested keyword w.

www.ijrcse.com

International Journal of Research in Computer Science & Engineering 3049

IV. Existing System In this paper, we introduce the concepts of similarity relevance and scheme robustness to formulate the privacy issue in searchable encryption schemes, and then solve the insecurity problem by proposing a two-round searchable encryption (TRSE) scheme. Novel technologies in the cryptography community and information retrieval community are employed, including homomorphic encryption and vector space model. In the proposed scheme, the majority of computing work is done on the cloud while the user takes part in ranking, which guarantees top k multi-keyword retrieval over encrypted cloud data with high security and practical efficiency.

V. Proposed System With the great advantages of the cloud computing the cloud customer moving from personal site to the commercial site where the data owner can store and share his data with the other cloud customer. Cloud computing is responsible for the best security of the data which is stored over the cloud by the customer of cloud for the better security of data should be stored in encrypted form that reduce the privacy risk and leakage of the data. Cloud provides the flexibility for the customer. Always the encryption performs on binary data. Our proposed work uses order preserving symmetric encryption to protect

IJRCSE Vol-5, Issue-5, Sep -Oct, 2015

the cloud data and also provides efficient search results. Order Preserving Symmetric Encryption: This is a deterministic encryption plan where the numerical requesting of the plaintexts gets safeguarded by the encryption capacity. Boldyreva et al. gives the first cryptographic investigation of OPSE primitive and gives a development that is provably secure under the security structure of pseudorandom capacity or pseudorandom stage. To be specific, considering that any request safeguarding capacity g(.) from area D = {1, . . .,M} to range R = {1, . . .,N} can be particularly characterized by a blend of M out of N requested things, an OPSE [7] is then said to be secure if and if a foe needs to perform a beast power seek over all the conceivable mixes of M out of N to break the encryption plan. In the event that the security level is decided to be 80 bits, then it is recommended to pick M = N/2 > 80 so that the aggregate number of blends will be more prominent than 280. Their development is in light of a revealed relationship between an arbitrary request saving capacity and the hyper geometric likelihood conveyance. The data spillage is the plaintext circulation. For instance, which demonstrates a skewed pertinence score dispersion of keyword ―network, inspected from 1,000 documents of our test accumulation. For simple composition, we encode the real score into 128 levels in area from 1 to 128. Because of the deterministic property, on the off chance that we utilize OPSE specifically over these examined importance scores, the subsequent figure content should share precisely the same dissemination as the pertinence score. In particular, the creators have demonstrated that the TF dissemination of certain decisive words from the Enron email corpus3 can be exceptionally peaky, and in this manner result in critical data spill for the relating pivotal word. In [8], the creators further call attention to that the TF appropriation of the essential word in a given record accumulation for the most part takes after a force 3050 International Journal of Research in Computer Science & Engineering

ISSN: 2321-5585 (Online) ISSN: 2321-0338 (Print)

law circulation, paying little mind to the prevalence of the catchphrase. Their outcomes on a couple test document accumulations demonstrate that not just distinctive pivotal words can be separated by the incline and quality scope of their TF circulation, yet even the standardized TF appropriations, i.e., the first score disseminations can be catchphrase particular. Therefore, with certain foundation data on the record accumulation, for example, knowing it contains just specialized exploration papers, the enemy may have the capacity to figure out the essential word ―network straightforwardly from the encoded score dispersion without really breaking the trapdoor development, nor does the foe need to break the OPSE. OPSE algorithm works as follows: 1. K is generated Encryption key at P: K=OPE.key 2. Enc (V, K) runs at A and B:  A calculates D←Enc (V, K) and sends X to Y.  If D is present in E, E returns encoding F of D to P  Else go to step 3. 3. AVL Tree searches for V as follows:  P asks for the root of AVL tree to get cipher text C′. P obtains V′ by decrypting C'.  P orders AVL tree, if V