International Journal of Modern Electronics and Communication Engineering (IJMECE) ISSN: Volume No.-4, Issue No.

Transcription

1 A Review on Multi-Keyword Based Image Retrieval System for Encrypted Image Data Stored On Cloud Pawandeep 1, Hardeep Singh 2 1 Student, CSE department, CGC-COE Landran, Pawandeep.saini@gmail.com 2 Asst. Prof., CGC-COE Landran, Cgccoe.cse.hardeep@gmail.com Abstract-In recent years, cloud computing has become an advanced area, particularly due to its potential merits and applications. Also CBIR has become the active research topic in the area of computer science in past few years. In order to realize the cloud computing, many constraints are associated out of which multi-keyword search and privacy preserving are one of them. To enhance the use of data utilization search over multi-keyword encrypted cloud data a CBIR approach is used. CBIR is an effective method to retrieve the relevant images from large database. Searchable encryption scheme is proposed which focuses on multi keyword search and Boolean keyword search. For the efficient result, image segmentation approach is followed to extract the various features present in an image. Further, the use of other principle inner product similarity is used therefore count of query keywords present in a document chooses for result ranking. Using secure inner product computation, MRSE scheme has been proposed. Keywords: Privacy preserving, Coordinate-matching, CBIR, Inner-product similarity, Multi-keyword and MRSE I. INTRODUCTION Cloud computing is getting more and more important with the increase in technology. Cloud computing has an extensive variety of use to store the information.it diminishes the cost on equipment, programming and work force systems of support, and so forth [1]. To upgrade the speed content based recovery is proposed in this paper which is concerned with the recovery of pictures from the dataset, like the database of images. Hence this CBIR is implemented in cloud environment. The meaning of content based is that the search will analyze the contents of the image like shape, texture, color, or any other information resulting from an image itself. To ensure the information security the information must be in scrambled form to ensure that unapproved individual cannot recover the information. To explore privacy protection and effective search administration over cloud is a major test. The substantial number of information clients and outsourced information records in a cloud is a major test in this paper on the grounds that it is excessively troublesome; making it impossible to meet the necessities of execution, ease of use and framework adaptability. To meet the effective result Coordinate-matching [2] is used to find the similarity between search query and data documents principle among various multi-keyword semantics. The other rule "inward product similarity" [2] assesses the quantity of multikeywords identified with question showing up in an archive, to discover the closeness of a record to the inquiry in "coordinate matching" guideline. Applying these standards in the encoded cloud information seek framework is an exceptionally difficult assignment. On the other hand, searchable encryption method [3] is exceptionally useful that regards encoded information as archives and clients can without much of a stretch pursuit reports through multi-keyword search and recover the productive result. On the other hand Boolean keyword search technique is also helpful to retrieve the data. This technique enhances the system greatly which retrieves the matching files in a ranked order. But this technique is not much secure to design ranked searchable encryption system. Another huge test is to build an effective encoded information search technique that supports multi-keyword semantics without breaking security rules. To meet this test MRSE plan is proposed utilizing secure inward product calculation adjusted from k-closest neighbor strategy. Two levels of risk models are utilized to accomplish different security prerequisites. 2.1 System Model II. PROBLEM FORMULATION Three entities are considered in system model as shown in figure 1. They are - cloud server, data user and data owner. Information Owner concentrates the quantity of remarkable keywords from the arrangement of information. From this accumulation of information a encoded searchable index is built by the owner. Every one of the documents are in encoded form and information owner transfers the encoded information gathering and file to the cloud server RES Publication 2012 Page 6

2 Information client is in charge of giving essential keywords to the cloud server. By utilizing some inquiry control systems trapdoor is created comparing to the keywords. The approval between information owner and client is dared to be done roughly. Cloud server represents the estimation and returns the arrangement of encoded documents. Information client additionally sends a optional number alongside the trapdoor to decrease the correspondence cost. Accordingly, cloud server recover the most important highest records identified with search inquiry to send back. Figure 1: Search architecture over 2.2 THREAT MODELS Two kinds of threat model as per the following:- CIPHERTEXT MODEL encrypted cloud data In this model searchable index and encoded arrangement of information are outsourced from data. The cloud server should just know dataset in encoded structure C and searchable record I. BACKGROUND MODEL In this model, cloud server has a few foundations on the dataset, which can be subject and measurable data identified with it, in addition to this, what can be accessed to is known as cipher text model. In the event of possible attacks, cloud server could make utilization of record frequency to distinguish keywords in the submitted query [4]. 2.3 DESIGN GOALS The planned framework ought to accomplish security and execution assurances to empower the ranked search for successful use of outsourced cloud information. It ought to be as per the following: MULTI-KEYWORD RANKED SEARCH Under the above model, security and ranked search are proposed in this paper. MRSE supports the result ranking and multi keyword query. PRIVACY-PRESERVING To prevent additional information obtained from trapdoor and index to be learned by cloud server, a scheme is proposed and also meets the privacy concerns. a) Index Confidentiality: The file esteem which is put away in cloud server should be encoded as all the TF estimations of keywords are stored away there. b) Trapdoor Unlink ability: While cloud server performs some factual analysis of search results, the same inquiry produces the distinctive trapdoors in the mean time when the search is performed two times. c) Keyword privacy: cloud server couldn't have the capacity to discover query keyword and list by examining the terms like recurrence from factual data. 2.4 FRAMEWORK AND PRIVACY REQUIREMENTS FOR MRSE MRSE FRAMEWORK MRSE consists of four algorithms as follows:- Setup: - The symmetric key SK is put on as an output by the data owner and security parameter L is taken as a input RES Publication 2012 Page 7

3 Build Index: - On the premise of dataset F, searchable list is build by data owner, which is further encoded by the symmetric key SM and afterward send to cloud server. After the list is developed, the report gathering can be autonomously encoded and outsourced. Trapdoor (): - With the assistance of t keywords as information, this calculation creates a comparing trapdoor. Query(K,I ):- Ranked search on list I is performed at whatever point cloud server gets a request demand as (K) and with the assistance of trapdoor returns the rundown of top k reports in a positioned id request, sorted in the similarity structure. PRIVACY REQUIREMENTS FOR MRSE The different search privacy requirements for MRSE included in the inquiry methodology are more entangled and hard to handle which are as per the following:- KEYWORD PRIVACY: - In keyword security, pivotal words which are shown by the comparing trapdoor will be concealing which are search by the clients. The purpose to create the trapdoor is just to secure the query keywords. To distinguish the keyword with high likelihood [5] report recurrence is adequate strategy. TRAPDOOR PRIVACY: - In trapdoor privacy only authorized persons are able to acquire trapdoor for their search query. SEARCH PATTERN: - Search pattern identifies the single keyword searchable encryption plan. Search patterns utilized as a part of MRSE implies that any data can be determined by the server. To know the search pattern of any user data trapdoor must be generated in a deterministic manner. ACCESS PATTERN: - Access patterns intend to search in grouping and each query output contain an arrangement of records which are positioned in a ranking order. Single Keyword Searchable Encryption III. RELATED WORK For secure keyword look, searchable encryption plan gives numerous arrangements [6]. In the symmetric key setting plan,song et al. presented the first searchable encryption plan in which two layered encryption is built where every word is encrypted independently [6] in the file. For efficient search, researchers turned this scheme to index technique. Goh et al. proposed comparable secure per-record index plan, in which a list incorporates backdoor of every particular word is developed for every document [7]. Goh brings change and security definitions in the symmetric key setting. Goh built up a Bloom channel based upon per-record file which diminishes the work load when another solicitation desires look which is specifically relative to the quantity of documents in the accumulation. Curtmola et al. introduced a for each keyword list based methodology, where hash table list is built [10] for the full collection of record, where exceptionally section contains the backdoor for a keyword and set of related document identifiers in encoded structure. Boneh et al. presented public key based searchable encryption plan [8]. In this plan with utilizing public key unapproved individual can keep in touch with the information which is put away on the server however the search is done just by approved clients by utilizing private key. Boolean Keyword Searchable Encryption P-Golle et al.[14] proposed conjunctive pivotal word look over encoded information. To improve framework ease of use and security scientists proposed ranking keyword search. As of late predicate encryption plan have been proposed both conjunctive and disjunctive search. Conjunctive keyword search in view of the idea of "win or nothing" that profits just those records in which all the keywords are indicated with the inquiry question showed up though disjunctive keyword returns undifferentiated results,implies that it gives back each archive which contains a particular's subset of keywords.. Wang et al. proposed ranked single-keyword search to recover the significant picture [17]. Cao et al. built plan for multi-keyword rank search, where Inward product similarity is utilized for result ranking [19]. To put it into action, he presumes that any existing Boolean encryption scheme does not support ranked multi-keyword ranked over encoded cloud data. Emilet al achieve more secure and effective updated images [21] using hierarchical index structure Chuah et al. exhibited fuzzy keyword search to upgrade the search over encrypted cloud data [22]. RES Publication 2012 Page 8

4 Li et al. build method which is used for storage efficiency of fuzzy keywords set [23]. Liu proposed dictionary-based fuzzy set construction to lessen the size of fuzzy keywords set [25]. Bringer et al. proposed a fuzzy search plan to embed edit distance into Hamming distance [26]. TABLE 1: COMPREHENSIVE SUMMARY OF PROPOSED WORK Paper Proposed Work Remarks Song, Dawn Xiaodon, IEEE, [27] has worked about the practically tested models over Chang, Y. C. et. al. Springer [9], 2005 has worked on user privacy protection in the keyword based search from the Curtmola, R. et. al. ACM [10] 2006 has worked on the symmetric algorithm for data encryption with improved feature definitions. Boneh, D. et. al., Springer, 2004 [8] have worked on the keyword search over the data encoded with public key encryption plans. Golle, P. et.al. Springer, 2004 [14] proposed multi-keyword in conjunctive form for the encrypted data searching. Stefanov, E. et. al., IACR, 2013 [21] for practical search of the dynamic queries over the leakageenabled The first encryption scheme with the searchable ability has been introduced. Full index based ranking over the data with large number of files. Full text query processing with every keyword based distributed search. The public key cryptosystem has been proposed for searchable Multi-keyword n-gram search for efficient search over the encrypted storage data. Works with the hierarchically structured data indexing. The double layer based encryption mechanism has been proposed for data. The proposed scheme has been popular indexing scheme for highly efficient data search models. Authors have worked on the bloom filter for full index containing each file s features to reduce the work load. Hash table based file indexing for the centralized fast information retrieval system. The writeable or readable encrypted data to create the search ability in the stored Not capable of providing the keyword based search in the appropriate ranking. Require higher level of efficiency for the secure image update and scalability. RES Publication 2012 Page 9

5 Chuah, M. et. al. [28], IEEE, 2011 for the fuzzy enabled solution for multiple keyword queries over the encrypted data with privacy awareness. Fuzzy sets enabled multivariate keyword search. The scheme has been presented as the enhancement of the search efficiency over the encoded data. IV. CONCLUSION & FUTURE WORK In this paper the issue of multi-keyword ranked search over encoded cloud data is determined and characterized and build up various security prerequisites. The standards coordinate matching and inner product similarity is utilized among different multikeyword semantics. The MRSE plan is proposed to meet the test of supporting multi-keyword semantics without security breaks. The audit done in this paper will turn out to be useful to scientists working in the range of multi-keyword look over encoded cloud information. Following the current examination, several possible directions are proposed for multi-keyword based image retrieval system for encrypted image data stored on cloud. In future, the most encouraging one will support other multi-keyword semantics over encoded data and stronger privacy ensure in threat model. In future work, problem of irrelevant searches in the result can be removed. When user submits the query car, the resultant is the images showing all car but also the other automobiles. So these irrelevant searches can be removed by using better schemes. REFERENCES [1] Ren, K., Wang, C., & Wang, Q. (2012). Security challenges for the public cloud. IEEE Internet Computing, (1), [2] Witten, I. H., Moffat, A., & Bell, T. C. (1999). Managing gigabytes: compressing and indexing documents and images. Morgan Kaufmann. [3] Song, D. X., Wagner, D., & Perrig, A. (2000). Practical techniques for searches on In Security and Privacy, S&P Proceedings IEEE Symposium on (pp ). IEEE. [4] Zerr, S., Demidova, E., Olmedilla, D., Nejdl, W., Winslett, M., & Mitra, S. (2008, March). Zerber: r-confidential indexing for distributed documents. In Proceedings of the 11th international conference on Extending database technology: Advances in database technology (pp ). ACM. [5] Zerr, S., Olmedilla, D., Nejdl, W., & Siberski, W. (2009, March). Zerber+ r: Top-k retrieval from a confidential index. In Proceedings of the 12th International Conference on Extending Database Technology: Advances in Database Technology (pp ). ACM. [6] Song, D. X., Wagner, D., & Perrig, A. (2000). Practical techniques for searches on In Security and Privacy, S&P Proceedings IEEE Symposium on (pp ). IEEE. [7] Goh E-J Secure indexes. Cryptology eprint Archive, Report 2003/216 [8] Boneh, D., Di Crescenzo, G., Ostrovsky, R., & Persiano, G. (2004, January). Public key encryption with keyword search. In Advances in Cryptology-Eurocrypt 2004 (pp ). Springer Berlin Heidelberg. [9] Chang, Y. C., & Mitzenmacher, M. (2005, January). Privacy preserving keyword searches on remote In Applied Cryptography and Network Security (pp ). Springer Berlin Heidelberg. [10] Curtmola, R., Garay, J., Kamara, S., & Ostrovsky, R. (2006, October). Searchable symmetric encryption: improved definitions and efficient constructions. In Proceedings of the 13th ACM conference on Computer and communications security (pp ). ACM. [11] Bellare, M., Boldyreva, A., & O Neill, A. (2007). Deterministic and efficiently searchable encryption. In Advances in Cryptology-CRYPTO 2007 (pp ). Springer Berlin Heidelberg. [12] Curtmola, R., Garay, J., Kamara, S., & Ostrovsky, R. (2006, October). Searchable symmetric encryption: improved definitions and efficient constructions. In Proceedings of the 13th ACM conference on Computer and communications security (pp ). ACM. [13] Boneh, D., Di Crescenzo, G., Ostrovsky, R., & Persiano, G. (2004, January). Public key encryption with keyword search. In Advances in Cryptology-Eurocrypt 2004 (pp ). Springer Berlin Heidelberg. [14] Golle, P., Staddon, J., & Waters, B. (2004, January). Secure conjunctive keyword search over In Applied Cryptography and Network Security (pp ). Springer Berlin Heidelberg. RES Publication 2012 Page 10

6 [15] Ballard, L., Kamara, S., & Monrose, F. (2005). Achieving efficient conjunctive keyword searches over In Information and Communications Security (pp ). Springer Berlin Heidelberg. [16] Hwang, Y. H., & Lee, P. J. (2007). Public key encryption with conjunctive keyword search and its extension to a multi-user system. In Pairing- Based Cryptography Pairing 2007 (pp. 2-22). Springer Berlin Heidelberg. [17] Wang, C., Cao, N., Li, J., Ren, K., & Lou, W. (2010, June). Secure ranked keyword search over encrypted cloud data. In Distributed Computing Systems (ICDCS), 2010 IEEE 30th International Conference on (pp ). IEEE. [18] Wang, C., Cao, N., Ren, K., & Lou, W. (2012). Enabling secure and efficient ranked keyword search over outsourced cloud data. Parallel and Distributed Systems, IEEE Transactions on, 23(8), [19] Cao, N., Wang, C., Li, M., Ren, K., & Lou, W. (2014). Privacy-preserving multi-keyword ranked search over encrypted cloud data. Parallel and Distributed Systems, IEEE Transactions on, 25(1), [20] Yang, C., Zhang, W., Xu, J., Xu, J., & Yu, N. (2012, November). A fast privacy-preserving multi-keyword search scheme on cloud data. In Cloud and Service Computing (CSC), 2012 International Conference on (pp ). IEEE. [21] Stefanov, E., Papamanthou, C., & Shi, E. (2013). Practical Dynamic Searchable Encryption with Small Leakage. IACR Cryptology eprint Archive, 2013, 832. [22] Chuah, M., & Hu, W. (2011, June). Privacy-aware bedtree based solution for fuzzy multi-keyword search over In Distributed Computing Systems Workshops (ICDCSW), st International Conference on (pp ). IEEE. [23] Wang, C., Ren, K., Yu, S., & Urs, K. M. R. (2012, March). Achieving usable and privacy-assured similarity search over outsourced cloud data. In INFOCOM, 2012 Proceedings IEEE (pp ). IEEE. [24] Li, J., Wang, Q., Wang, C., Cao, N., Ren, K., & Lou, W. (2010, March). Fuzzy keyword search over encrypted data in cloud computing. In INFOCOM, 2010 Proceedings IEEE (pp. 1-5). IEEE. [25] Liu, C., Zhu, L., Li, L., & Tan, Y. (2011, September). Fuzzy keyword search on encrypted cloud storage data with small index. In Cloud Computing and Intelligence Systems (CCIS), 2011 IEEE International Conference on (pp ). IEEE. [26] Bringer, J., & Chabanne, H. (2012). Embedding edit distance to enable private keyword search. Human-centric Computing and Information Sciences, 2(1), 1-12 [27] Song, Dawn Xiaodong, David Wagner, and Adrian Perrig. "Practical techniques for searches on " In Security and Privacy, S&P Proceedings IEEE Symposium on, pp IEEE, [28] Chuah, M., and W. Hu. "Privacy-aware bedtree based solution for fuzzy multi-keyword search over " In Distributed Computing Systems Workshops (ICDCSW), st International Conference on, pp IEEE, Pawandeep Mtech Student at cgc coe, landran AUTHOR S BIOGRAPHY RES Publication 2012 Page 11