Vol 7, No 7 (2017)

(1)

Research Article

July

2017

Computer Science and Software Engineering

ISSN: 2277-128X (Volume-7, Issue-7)

Study of Various Multi Keyword Search in Cloud

Computing

Hitesh Pardesi, Naveen Kumari

Punjabi University Regional Centre of Information and Technology Management, Mohali, Punjab, India

DOI: 10.23956/ijarcsse/V7I7/0130

Abstract— With the approach of cloud computing, information proprietors are persuaded to outsource their unpredictable data management frameworks from nearby places to the business open cloud for efficient adaptability. Accordingly, empowering a scrambled cloud information look administration is of vital significance. Considering the huge number of information clients and archives in the cloud, it is important to permit different watchwords in the hunt demand and return reports in the request of their pertinence to these catchphrases. Related chips away at searchable encryption concentrate on single watchword hunt or Boolean catchphrase seek, and once in a while sort the list items. In this paper, surprisingly, we characterize and take care of the testing issue of protection safeguarding multi-catchphrase positioned seek over encoded information in distributed computing (MRSE).

Keywords— Cloud Computing, Multi Keyword Search, Clustering in Cloud

I. INTRODUCTION

As the use of web is extending, the customers likes to store/exchange data on cloud with the objective that they can get to the data from wherever on the planet. Regardless, recalling the assurance, standard data stockpiling strategies for check are not that much strong. For the security of the data over cloud, the data ought to be mixe d before exchanging them to cloud to avoid the speeding up which may open up with the protection of data. Appropriated capacity is the indispensable and by and large used conveyed registering model where data is secured on remote servers and administered and gotten to over web. It is directed and worked by the CSP on a server which reinforce data stockpiling and depends on virtual machines. It works through the server cultivate virtualization which gives applications and data customers a virtual designing condition that is adaptable according to its necessities. All the chase arranges which reinforce the multi-watchword convenience recuperate look for yield. They collect a searchable turned around record that stores a summary of mapping from watchwords to the relating set of reports which contain this catchphrase. Right when data customers input a catchphrase, a trapdoor is created for this watchword and a short time later submitted to the cloud server. Furthermore, after that in the wake of tolerating the trapdoor, the cloud server executes. To address the stresses of security and addition the choice of dispersed stockpiling, we fight for sketching out a virtual private stockpiling organization in perspective of new cryptographic procedures. Such an organization should hope to fulfill the "best of both universes" by giving the security of a private cloud and the helpfulness and cost speculation assets of an open cloud. In this wander, we will deal with the issue of multi-catchphrase situated look for over encoded cloud data and recuperate the most vital records. We describe another arrangement named Latent Semantic Analysis based multi-catchphrase situated look which supports multi-watchword inactive semantic situated look for. By using LSA, the proposed plan could restore the right organizing records, and the archives including the terms idle semantically identified with the request catchphrase. For example, when the user inputs the keyword ―automobile‖ to search files, the proposed method returns not only the files containing ―automobile‖, but also the files including the term ―car.‖

Fig 1: Privacy preserved Multi keyword Search[2]

II. MULTI-KEYWORD SEARCH

(2)

ISSN(E): 2277-128X, ISSN(P): 2277-6451, DOI: 10.23956/ijarcsse/V7I7/0130, pp. 308-312

Inside this structure, we use an effective record to additionally enhance the pursuit effectiveness, and receive the visually impaired capacity framework to disguise get to example of the hunt client. This framework built up the searchable encryption for multi-watchword positioned look over the capacity information. In particular, by considering the expansive number of outsourced archives (information) in the cloud and used the importance score and k-closest neighbor strategies to build up a proficient multi-catchphrase seek plot that can restore the positioned query items in light of the exactness.

III. RELATED STUDY

Hongwei Li et al. [1] developed the searchable encryption for multi-watchword situated investigate the limit data. Specifically, by considering the gigantic number of outsourced documents (data) in the cloud, utilize the noteworthiness score and k-nearest neighbor techniques to develop a gainful multi-catchphrase look for plot that can reestablish the situated rundown things in perspective of the precision. Inside this structure, we utilize a viable rundown to moreover improve the interest viability, and get the outwardly weakened limit system to cover get to case of the request customer. Security examination displays that our arrangement can achieve grouping of records and document, trapdoor assurance, trapdoor unlinkability, and concealing access case of the interest customer.

K.S.Saravanan and S.Karthika et al. [2] displayed a safe multi-catchphrase situated look plan over encoded cloud data, which in the meantime supports dynamic invigorate operations like eradication and expansion of reports. Specifically, the vector space show and the extensively used TF_IDF model are participated in the record improvement and request time and fabricate a remarkable tree-based rundown structure and proposed a "Ravenous Depth-first Search" estimation to give capable multi-watchword situated look for. The secured KNN figuring is utilized to scramble the record and request vectors, and afterward ensure exact congruity score tally between encoded document and question vectors. Remembering the ultimate objective to contradict true strikes, nebulous vision terms are added to the record vector for blinding rundown things. In light of the usage of our one of a kind tree-based record structure, the proposed plan can finish sub-coordinate request time and deal with the deletion and incorporation of reports adaptably.

Veerraju Gampala and Sreelatha Malempati [3] proposed a profitable multi-catchphrase equal word request over mixed cloud data by recuperating top k scored records. The vector space model and TFIDF model are used to assemble record and question time. The KNN computation used to scramble record and request vectors and build up a one of a kind tree called Balanced M-way Search (BMS) Tree for requesting and propose a Depth First Search Technique (DFST) figuring to finish viable multi-catchphrase proportionate word situated look for. The efficiency and accuracy of DFST estimation are spoken to with a case, BMS tree, it takes sub-straight time multifaceted nature.

Raghavendra S et al. [4] vital to encode the delicate data before exchanging to the cloud server in order to keep up insurance and security. All customary searchable symmetric encryption (SSE) arranges enable the customers to look for all in all record report. In this paper, we propose the Domain and Range Specific Multi catchphrase Search (DRSMS) plan that constrains the chase time and Index storage space. This arrangement grasps gathering sort framework to part the document record into D Domains and R Ranges. The Domain relies on upon the length of the watchword; the Range parts inside the space in perspective of the essential letter of the catchphrase. A logical model is used to look for over the encoded documented watchword that takes out the information spillage. Matched interest is used to pick the range inside the space with time multifaceted nature O(RlogD) and direct request is used to find the watchword inside the range with O(R). The space eccentrics of the record storage space is O(NT × 3) and request time unpredictability is O(1)+O(RlogD)+O(R), while the multifaceted way of document time is O(NT × 3).

Ajay kumar Narayankar et al. [5] proposed a major idea for the MRSE in light of secure inner thing computation, and subsequently give two basically improved MRSE arrangements to achieve diverse stringent necessities in two unmistakable threat models. To improve look inclusion of the data look for advantage and further extend these two arrangements to support more chase semantics and besides settled a course of action of strict assurance essentials for such a sheltered cloud data utilization structure. Among various multi-catchphrase semantics and pick the capable closeness measure of "organize planning," i.e., however many matches as could sensibly be normal, to get the criticalness of data chronicles to the request address.

V. Goutham et al. [6] portrayed that for imprisonment inconveniences, a secured rifle over encoded cloud data has blended different research parts underneath the particular proprietor illustrate. Then again, most cloud servers for all intents and purposes don't just help one proprietor, as a choice, their sustenance gives different proprietors to share the guides passed on by appropriated figuring. In this skilled and order Preserving Multi-Keyword Ranked Search over Encrypted Cloud Data, new plans to oversee Privacy securing Ranked Multi-catchphrase Search in a Multi-proprietor appear (PRMSM) has been exhibited. To urge cloud servers to execute secure interest without knowing the genuine data of both watchwords and trapdoors, we out and out gather a novel secure request tradition. To rank the inquiry things and range the security of relevance scores among catchphrases and reports.

(3)

proposed plan can fulfill sub-coordinate interest time and deal with the cancelation and consideration of reports adaptably.

Shikha Rani and Shanky Rani [9] gave an alternate encryption techniques and feasible security game plan and besides to diminish appropriated capacity to reduce its overhead. Disseminated processing is just the framework to give on demand advantage get to and giving figuring resources over the web. It is a social event of shared pool of information, resources that makes up a cloud.

Keerthana G et al. [10] produced an application for overhauling cloud security utilizing package and encryption methodology which will enhance the cloud security. Above all record from client were taken and allocate into number of parts. After section we scramble the all record parts. By then we send record parts to various cloud servers. Right when client require that information back we take that information from cloud servers and unscramble that information. Consequent to unscrambling, merging of that information is done and offer it to client. Our objective is that the application ought to have straight forward client interface for clients adaptability. The proficient system for giving security is the use of cream cryptography for more secured sending and getting of information.

S.No Keyword Based Searching

Clustering Algorithm Remarks

1 Yes Yes IBE User upload the index and the encrypted File on the cloud server

2 Yes Yes Symmetric key Encryption

User upload cluster index, document index & encrypted document 4 Yes No AES User outsourced the

index and the encrypted File on cloud server 5 Yes No ECC User upload file with

index after encryption process

10 Yes No OPSE User upload the index and the encrypted Files on the cloud server

IV. PRIVACY REQUIREMENTS FOR MULTI RANKED KEYWORD SEARCHING

In the related composed work, for example, searchable encryption is that the server ought to focus just request things. With this general security picture, we find and make a game plan of strict affirmation necessities exceptionally for the MRSE structure.

Data Privacy, the information proprietor can fall back on the standard symmetric key cryptography to scramble the information some time starting late outsourcing, and successfully keep the cloud server into the outsourced information.

Record Privacy, if the cloud server derives any relationship among catchphrases and encoded accounts from report. Thusly, the searchable once-over ought to be endeavored to check the cloud server from acting such sort of affiliation strike.

Keyword Privacy, as clients for the most part wish to have their search for from closeness appearing to others like the cloud server, the most pressing concern is to stow away what they are searching for, i.e., the catchphrases exhibited by the differentiating trapdoor. The trapdoor can be made cryptographically to secure the question catchphrases.

Trapdoor, the trapdoor period breaking point ought to be a randomized one as opposed to being deterministic. The cloud server ought not be able to reason the relationship of any given trapdoors, i.e, to pick if the two trapdoors are encompassed by a practically identical demand ask. Something else, the deterministic trapdoor time would give the cloud server ideal position to gather frequencies of unique demand demands concerning unmistakable keyword(s), which may likewise chafe the effectively indicated watchword affirmation fundamental.

V. COMPARATIVE STUDY FOR DATA SEARCHING AND ENCRYPTION TECHNIQUES[12]

1. Accessible Encryption: With this method client can store their information in encoded arrangement to enhance the security of information, additionally other client can seek in this encoded secure information. This can likewise exercise on extensive scale information. Different encryption systems can be used to accomplish this, for example, AES, ECC and so forth.

(4)

3. Multi paraphrase Search: To make seeking framework more functional, framework can support to multi catchphrase look in the place of single watchword seek. With this framework, input look inquiry may contain more than one catchphrase, which enhances the exactness of pursuit question. Numerous catchphrases has the capacity to clarify the pursuit inquiry precisely.

4. Positioned Multi-watchword Search: In this procedure, numerous irregular catchphrases is a contribution to cloud server. As an answer cloud server creates the most related record that coordinated with information watchwords. Positioned catchphrase seek produced the outcomes rank astute rather than just giving coordinated outcomes.

5. Fuzzy watchword seek: This system permits the minor blunders in inquiry question catchphrases. It enhances the vigor and increment the ease of use of fluffy catchphrase seek framework. It likewise creates the outcome for incorrectly spelled watchwords.

6. A conjunctive catchphrase Check: In this approach, an inquiry ask for has numerous watchwords and for every catchphrase trapdoor is created. The last result is the crossing point of aftereffects of every catchphrase in inquiry ask.

7. Likeness catchphrase seek: This pursuit framework brings all conceivable comparable information with inquiry question ask for from cloud server. Due to security what's more, security concerns, it is extremely testing to accomplish likeness catchphrase seek approach in useful. Amid improvement of such framework, productivity, security and vigor ought to be considered.

8. Property based catchphrase look: The property based catchphrase look framework is valuable to bolster numerous information proprietors to impart their data to other different information proprietors in substantial scale distributed storage frameworks. Such framework safely shares the information among various information proprietors

VI. CONCLUSION

This paper concentrated on various information seek strategies crosswise over cloud servers. To start with, requirement for cloud information stockpiling and its significance are examined. Later paper experienced cloud information looking significance. After that we talked about about various looking strategies in the cloud information. Every method has their preferences and disservices. So as to overcome the disservices, Multi-catchphrase looking plan with equivalent word inquiry is utilized.

REFERENCES

[1] Hongwei Li, Dongxiao Liu, Yuanshun Da, Tom H. Luan, Xuemin, Shen, ―Enabling Efficient Multi-Keyword Ranked Search Over Encrypted Mobile Cloud Data Through Blind Storage‖, IEEE Transactions On Emerging Topics In Computing, ISSN: 2168-6750, Volume 3, No: 1, March 2015, pp: 127-138

[2] K.S.Saravanan, S. Karthika, ―A Secure and Dynamic Multi-keyword Ranked Search Scheme over Encrypted Cloud Data‖, International Journal of Advanced Research in Computer and Communication Engineering, ISSN (Online) 2278-1021, ISSN (Print) 2319 5940, Vol. 5, Issue 2, February 2016, pp: 244-247

[3] Veerraju Gampala, Sreelatha Malempati, ―An efficient Multi-Keyword Synonym Ranked Query over Encrypted Cloud Data using BMS Tree‖, International Journal of Applied Engineering Research, ISSN 0973-4562, Vol: 11, No: 1, 2016, pp: 738-743

[4] Raghavendra S, Geeta C M, Rajkumar Buyya, Venugopal K R, S S Iyengar, L M Patnaik, ―DRSMS: Domain and Range Specific Multi-Keyword Search over Encrypted Cloud Data‖, International Journal of Computer Science and Information Security, ISSN: 1947-5500, Vol. 14, No. 5, May 2016, pp: 69-78

[5] Ajay kumar Narayankar, Gajanan Rathod, Sanket Londhe, Ashish Wankhade, M.A. Ansari, ―A Review on Privacy-Preserving Multi Keyword Ranked Search over Encrypted Cloud Data‖, International Journal of Innovative Research in Science, Engineering and Technology, ISSN(Online) : 2319-8753, ISSN (Print) : 2347-6710, Vol. 5, Issue 3, March 2016, pp: 3532-3537

[6] V. Goutham, B.Shyla Reddy, Krishna Manasa, ―An proficient and Confidentiality-Preserving MultiKeyword Ranked Search over Encrypted Cloud Data‖, International Journal of Computer Applications Technology and Research, ISSN: - 2319-8656, Vol: 5, Issue 7, 2016, pp: 478 – 483

[7] M. Veerabrahma Chary, N. Sujatha, ―A Novel Additive Multi-Keyword Search for Multiple Data Owners in Cloud Computing‖, International Journal of Computer Engineering In Research Trends, ISSN: 2349-7084, Volume 3, Issue 6, June-2016, pp. 308-313

[8] Jeniphar Francis, Ruchika Bansod, Chetna Getme, Priyanka Bagde, ―A Secure and Encrypted Cloud Data with Multi-keyword Rank Search and Revocation of User‖, International Journal of Advanced Research in Computer Science and Software Engineering, ISSN: 2277 128X, Volume 6, Issue 9, September 2016, pp: 367-369

[9] Shikha Rani, Shanky Rani, ―Data Security in Cloud Computing Using Various Encryption Techniques‖, International Journal of Modern Computer Science, ISSN: 2320-7868, Volume 4, Issue 3, June 2016, pp: 163-166

(5)

[11] Gayathri M R, K. Srinivas, ―Efficient Keyword Search Techniques over Cloud Data in Cloud Computing‖, International Journal of Science and Advanced Technology, ISSN 2228386, Volume 5 No 7 July 2015, pp: 1-5

[12] Neha Mahajan, V.M.Barkade, ―Survey on Recent Keyword Search Techniques on Outsource Encrypted Big Data‖, International Journal of Innovative Research in Computer and Communication Engineering, ISSN(Online): 2320-9801 ISSN (Print): 2320-9798, Vol. 5, Issue 1, January 2017, pp: 441-445