A NEW FRAMEWORK FOR PROVABLE FEATURES BASED KEYWORD SEARCH OUTSOURCED ENCRYPTED DATA FINAL

Transcription

1 A NEW FRAMEWORK FOR PROVABLE FEATURES BASED KEYWORD SEARCH OUTSOURCED ENCRYPTED DATA FINAL M.Divyalakshmi 1, D.Rambabu 2 1 Pursuing M.Tech, 2 Associate Professor, Holy Marry Institute of Technology & Sciences (HITS), Bogaram(V), Keesara(M), R.R.(dist), Telangana, (India) ABSTRACT To ensure security, cryptography techniques play a major role once knowledge are outsourced to the cloud. Downside of retrieving the information from the cloud servers is taken into account. Several looking techniques are used for retrieving the information. This study targeted on a collection of keyword primarily based search algorithms. It provides secure knowledge retrieval with high potency. It concludes stratified Searchable Centro symmetric Encryption (RSSE) theme meant to be best methodology for se arching the encrypted knowledge. Keyword: Cloud, Encrypted Knowledge, Keyword Primarily Based Search, Outsourced Knowledge, Survey. I. INTRODUCTION Cloud Computing, the trendiest computing in data technology wherever everything relies on on-demand service and pay-for-use service. it's transportation of computing services like SAAS, PAAS and IAAS over the internet that area unit supervised by arbitrager iterator at outback locations. Many applications like s, file storage, business knowledge, etc. area unit outsourced to cloud server. Only approved user will access the information from the cloud server. Outsourcing unencrypted knowledge to cloud by the owner isn't abundant secure as a result of server might leak information to cyberpunks. Thus coding plays a significant role before outsourcing the information into the cloud server. In spite of encrypting, retrieval of information becomes an intriguing task once looking must be created on vast data. the simplest method is to use keyword based mostly search on encrypted knowledge for knowledge concealing. Many searchable techniques are projected on the premise of keyword search. Discussion is created on the present techniques that area unit been intend by many authors. This study analyses the algorithms for searching the encrypted content. Survey is created on these algorithms supported the working rule, merits and demerits. It conjointly compares the quality, efficiency overhead of varied algorithms and shows that technique is best to handle whereas retrieving the encrypted content. This paper focuses on to the answer of keyword search over encrypted cloud information (MRSE) whereas protective strict system-wise privacy within the cloud computing paradigm. a range of keyword linguistics area unit on the market, Associate in Nursing economical similarity live of coordinate matching, i.e., as several matches as attainable, to capture the connectedness of information documents to the search question is employed. Significantly inner product similarity, i.e., the amount of question keywords showing in an 58 P a g e

2 exceedingly document, to quantitatively measure such similarity live of that document to the search question is employed in MRSE algorithmic program. II. TECHNIQUES FOR SEARCHING OVER ENCRYPTED DATA It includes working of encryption algorithm, how searching is done on the encrypted content, advantages and disadvantages of each technique. 2.1 Symmetric Key Cryptography Symmetric key cryptography works by encrypting each word in a file using two layered encryption construction. Probabilistic searching is made on the encrypted data which deals with sequential scan and indexing methodologies Provable secrecy, controllable searching, hidden queries, query isolation [1] are the four techniques which makes the algorithm efficient, simple and fast. Sequential scan meets all the above techniques but it is not effective when searching is made on huge data content. Therefore to induce searching pre-computed index plays a vital role which support advanced search queries. But to make indexing technique secure, secure index data structure [2] can be used which admits queries with a trapdoor. It is semanticallysecure and practicable in multi-user settings where indexes are updated frequently on the remotely located server. 2.2 Public Encryption Keyword Search Public secret writing Keyword Search (PEKS),a searchable secret writing technique that corresponds to symmetric key secret writing.in this, file is encrypted mistreatment public key by the those who desires to store within the server however the approved users will search a file mistreatment their personal key [3]. Fig. one illustrates the operating principle of PEKS. The four algorithms area unit used for this system. First, key is employed to get public key and private key combine for each server and user. Second, PEKS algorithmic program produces searchable secret writing. Third, Trapdoor algorithmic program is employed to calculate trapdoor with personal key and keyword. Fourth, check is employed to match the keyword and requested word. If matches then the file area unit sent to the user.peks suggests that Identity primarily based Encryption (IBE) that has major blessings like a) Effective system based on Diffie-Hellman problem b) Limited system based on general trapdoor definitions Fig 1. Working of PEKS This scheme fails regarding access policy and dictionary attack. The major disadvantages are trapdoor contains meaningful keywords and one-one mapping takes place between trapdoor and keyword. 59 P a g e

3 2.3 Hidden Vector Encryption Hidden Vector Encryption (HVE) supports continuative queries [6] whereas PEKS supports onlycomparison and subset queries. In which it works with four algorithms namely Setup, Encrypt, GenToken and Query.First, Setup creates a bilinear group of elements using random primes and random elements, Second, Encrypt chooses the random element and using public key it encrypt the contents in a file. Third, Gen Token will generate the token for the predicate using a secret key. Fourth, Query finds the keyword from the cipher text andif matches it return the file. Even so HVE fails for disjunctive queries because cipher text is linear to attribute. 2.4Attribute Based Encryption (ABE) Attribute based encryption (ABE) affirms one upload several download policy most formally PEKS and HVE doesn't support. ABE uses access policy whereas looking out on encrypted knowledge with its Boolean expressions. It works on the premise of 9 algorithms.the first is that the Setup algorithmic rule wont to calculate secret key and master key by the trustworthy authority. Second, KeyGen algorithmic rule is employed to get the public/private key try. Fourth, fifth and sixth algorithmic rule like PseudoGen, Encrypt, AttrScm are used for outsourcing the information victimization cryptographic primitives like access structure, linear maps and attribute scrambling procedure. Seventh, eighth and ninth algorithmic rule like question, retrieve and decode is principally for the retrieval of information. and receiver sends the scrambled index to the Cloud Service supplier (CSP). Then the CSP checks whether or not the request created by the retriever and therefore the encrypted index keep are same by victimization Retrieve algorithmic rule. If it matches decode algorithmic rule works wherever the encrypted knowledge are decrypted and sent to the gun dog. It provides very best quality for looking out over encrypted data and easy in accessing. 2.5 Predicate Privacy Preserving in Public Key Encryption That search on keyword gets the higher of PEKS by victimization randomization technique. during which keywords are randomized and thus trapdoors doesn't give any significant keywords. The user and also the receiver share a secret key that isn't logical once there is immense rangeof users. Two frameworks were introduced specifically for to make tolerant of shot attacks of PEKSrand-BG for bruteforce guessing. PEKSrand-BG provides a proxy server that before processes the PEKS cipher text from the sender. The regulation illustrates in fig a pair of. PEKSrand-SG has two ways Proxy Farm and stochastic process. In that many proxies will be maintained for storing the key and indirect mapping between keyword and trapdoor severally. Fig 2. Working Flow of PEKSrand-BG 60 P a g e

4 1. Random Trapdoors 2. Inverse Tokens 3. PEKS Cipher text 4. Keywords with cipher text Therefore overall communication, computation and storage overhead are sensible when predicate Privacy made in PEKS. 2.6 Privacy Preserving Keyword Search It is a multi-round protocol between server and user on single keyword.it uses per index file wherever each document contains a keyword. The keyword index is encoded mistreatment pseudorandom bits mistreatment heuristic pseudorandom functions. On the setup section user chooses a random secret key to cipher the file. Then the user submits index and file content to server.on the retrieval section, once the user needs to look or retrieve file from the server, user retrieves the index file then computes keyword with the key. The computed key is sent to server, wherever server matches the file then sent to the user.the per-index file theme mistreatment pseudorandom functions is that the higher than mistreatment bloom filters. This theme fails once multiple keywords square measure used. 2.7 Secure Privacy Preserving Keyword Search Secure Privacy protective Keyword Search (SPKS) grants cloud service supplier to decipher the information and come file containing keywords.this technique overcomes the computation and communication overhead, provides question and knowledge privacy for the users. It find out six algorithms for economical looking out on encoded data.the flow of SPKS is illustrated in fig three. First, KeyGen accustomed generate a public/private key try. Second, EMBEnc & KWEnc encrypts all the content within the file and keywords are encrypted severally thatthen hold on within the server. And the third one to compute used on the retrieving section wherever user generates a trapdoor and pass it to CSP. Fourth, KWtest checks whether or not the keyword contain within the encrypted knowledge. Fifth, PDecrypt in the main for CSP to decipher the intermediate result partially and sends the cipher text and therefore the partial decrypted content. Sixth, Recovery runs by the user to decipher the plain text. Thus it provides linguistics security in plain text attack. Fig 3. Working Principle of SPKS 61 P a g e

5 2.8 Authorized Private keyword Search (APKS) Authorized non-public Keyword Search (APKS) deals with multi-keyword search, whereas on top of techniques conducts with single keyword that misses question flexibility and potency [10]. In fine-grained authorization framework, each user obtains looking out capabilities authorization from native sure Authority (LTA). Hierarchical Predicate encoding (HPE), a crypto logical primitive uses attribute hierarchy for easy vary queries. III. APKS BASED ON HPE The following steps are required while searching takes place in encrypted data using multi-keyword a. Multi-dimensional query are converted to its CNF (Conjunctive Normal Form) formula. b. Attributes are defined in a hierarchical way. i.e., attribute hierarchy. c. Indexes and capabilities are generated by GenIndex and GenCap algorithm respectively. When a user wants to retrieval a file using a keyword from LTA, LTA checks whether the user has an attribute value set and if it matches then user can retrieval the file from the server. But the major disadvantage isapks also does not prevent keyword attack.apks+ adds a secret key while encryption and decryption takes place which hides the data from theattackers. Therefore it prevents dictionary keyword attack and accomplishes index privacy and query privacy. 3.1 Fuzzy Keyword Search It enhances system usability once looking out input precisely matches. Keywords area unit measured victimization editdistance and fuzzy keyword sets area unit created. Uncomplicated and wild card based mostly area unit the 2 approaches are addressed edit distance in it.in uncomplicated approach edit distance area unit calculated wherever all the styles of keywords area unit to be listed.based on this assortment is made.trapdoor area unit shared between user and also the owner. While retrieving file user computes the trapdoor supported the request, server compare with index table and returns all potential identifiers. Massive storage necessities and lack of potency area unit the most important disadvantages. Wild card based activity overcomes the drawbacks by building a wild card fuzzy sets that calculates edit Distance. The above all techniques based on searchable encryption supports only Boolean search which has two major drawbacks. They are, a) User wants to decrypt every file that contains the keyword to match their file when retrieving the file is based on keyword b) Retrieving all files leads to network traffic. 3.2 Keyword Search Based on Ranking Over Encrypted Data The main drawbacks of above mentioned techniques get the higher of in stratified keyword search. Ranked Searchable bilaterally symmetrical encoding (RSSE) framework is employed to support rank search that engineered over the sou'-sou'-east scientific discipline primitive. Four algorithms area unit used specifically KeyGen, BuildIndex, TrapdoorGen, SearchIndex. Two parts like setup phase that uses KeyGen formula for generating public/private key pair and Build Index formula to come up with index file containing keywords educed from file. The file assortment and the index file area unit outsourced once encoding with frequency 62 P a g e

6 primarily based connection score. Whereas the retrieval phase uses Trapdoor Gen formula generates a trapdoor victimization the user s request. Upon the user request server runs Search Index formula that searches the files supported ids and connection scores and sent files to the user. But RSSE has immense communication overhead once ranking is on user facet and 2 trip times is taken. Therefore economical RSSE frame work uses Order protective bilaterally symmetrical encoding theme (OPSE) in [12]. It supports settled property within which a random coin generator and sampling operate enforced. OPSE is used rather than encrypting scores in RSSE and in retrieval part OPSE values area unit way more relevant. They provide higher potency whereas retrieving files with top-k retrieval. IV. CONCLUSION In this study rigorous analysis is created on cryptography techniques that relate to look primarily based retrieval of files from the outsourced encrypted knowledge. several searchable cryptography schemes are analyzed supported single keyword and multi-keyword search. several disadvantages are focused on these techniques sincethey place confidence in Boolean expressions. thus rank primarily based retrieval of knowledge has been mentioned that proves the data security, quick search access and doesn't leak info to untrusted authorities. This study concludes rank primarily based retrieval is most effective for looking out on encrypted knowledge. AUTHOR DETAILS M. Divyalakshmi pursuing M-Tech in Holy marry Institute of Technology & Sciences (HITS), Bogaram(V), Keesara(M), R.R.(dist), Telangana, India D. Rambabu working as Associate Professor in Holy marry Institute of Technology & Sciences (HITS), Bogaram(V), Keesara(M), R.R.(dist), Telangana, India P a g e