The thought of traditional public-key file encryption by keyword search does not hold any hidden structure involving the public-key file encryption by keyword search cipher-texts correspondingly, its semantic security is just defined for your keywords and phrases. We are concerned in provision of efficient search performance missing of compromising semantic security within public-key file encryption by keyword search. Inside our work we introduce searchable public-key cipher-texts by hidden structures for keyword search as rapidly as achievable missing of compromising semantic security regarding encoded keywords and phrases. Our structure is inspired by a lot of interesting findings using the systems of on Identity-Based Key Encapsulation. Inside the recommended system, the entire keyword-searchable cipher-texts that are structured by hidden relations, by search trapdoor that suits a keyword, minimum data of relations is revealed with a search formula as management to locate the whole matching cipher-texts resourcefully

Ramana Reddy, K.

Varsha, Mukta

International Journal of Innovative Technology and Research (IJITR)

Mukta Varsha* et al.   (IJITR) INTERNATIONAL JOURNAL OF INNOVATIVE TECHNOLOGY AND RESEARCH   Volume No.4, Issue No.5, August – September 2016, 3514 – 3516. 2320 –5547 @ 2013-2016 http://www.ijitr.com All rights Reserved.  Page | 3514 Elevating The Problems Of Linear Searchable Ciphertext On Large-Scale Database MUKTA VARSHA M.Tech Student, Dept of CSE Aurora's Technological & Research Institute Hyderabad, T.S, India K.RAMANA REDDY Assistant Professor, Dept of CSE Aurora's Technological & Research Institute Hyderabad, T.S, IndiaAbstract: The thought of traditional public-key file encryption by keyword search does not hold any hidden structure involving the public-key file encryption by keyword search cipher-texts correspondingly, its semantic security is just defined for your keywords and phrases. We are concerned in provision of efficient search performance missing of compromising semantic security within public-key file encryption by keyword search. Inside our work we introduce searchable public-key cipher-texts by hidden structures for keyword search as rapidly as achievable missing of compromising semantic security regarding encoded keywords and phrases. Our structure is inspired by a lot of interesting findings using the systems of on Identity-Based Key Encapsulation. Inside the recommended system, the entire keyword-searchable cipher-texts that are structured by hidden relations, by search trapdoor that suits a keyword, minimum data of relations is revealed with a search formula as management to locate the whole matching cipher-texts resourcefully. Keywords: Public-Key Encryption By Keyword Search; Semantic Security; Cipher-Texts; Trapdoor; Hidden Relations; I. INTRODUCTION Public-key file file encryption by keyword search includes advantage that anyone who identifies receiver public key uploads keyword searchable cipher-texts towards server. Traditional guaranteed techniques of public-key file encryption by keyword search consider search time straight line with final number in the entire cipher-texts. This makes recovery from major databases too pricey hence more ingenious search performance is essential for applying public-key file encryption by keyword search techniques. For guaranteeing of appropriate security, hidden star-like arrangement should safeguard semantic security of keywords and phrases, which indicate that partial relations are revealed only when equivalent keyword search trapdoor is recognized [1]. All the sender have to be capable of produce keyword-searchable cipher-texts with hidden star-likes arrangement by receiver public-key the server includes keyword search trapdoor must reveal partial relations, that's in the entire matching cipher-texts. Semantic security is maintained when no keyword search trapdoor is recognized, the entire cipher texts are impossible to differentiate, without any particulars are revealed regarding the structure, then when specified a keyword search trapdoor, only equivalent relations are revealed, and matching cipher-texts leak no data regarding relaxation of cipher-texts, except the information that relaxation don't include requested keyword [2]. Inside our work we advise searchable public-key cipher-texts by hidden structures for keyword search as rapidly as achievable missing of compromising semantic security regarding encoded keywords and phrases. Our recommended structures are inspired by a lot of interesting findings using the systems of on Identity-Based Key Encapsulation.  Inside the recommended system, the entire keyword-searchable cipher-texts that are structured by hidden relations, by search trapdoor that suits a keyword, minimum data of relations is revealed with a search formula as management to locate the whole matching cipher-texts resourcefully. The device produces keyword-searchable cipher-texts by means of hidden structure like star and contains search complexity mostly straight line with exact volume of cipher-texts including requested keyword. We build searchable public-key cipher-texts by hidden structure within the scratch where cipher-texts possess a hidden star-like structure. Searching complexity within our system is founded on actual volume of cipher-texts including requested keyword, to some degree than volume of the entire cipher-texts. II. METHODOLOGY Existing techniques of semantically secure public-key searchable file encryption consider search time straight line with final number of cipher-texts making recovery from important databases unaffordable. In public areas-key file encryption by keyword search all the sender individually encrypts file and its removed keywords and phrases and send the cipher-texts perfectly right into a server when receiver desires to return files that includes a specific keyword, he associates a keyword search trapdoor towards server which finds encoded files that includes requested keyword missing of knowing original files and returns matching encoded files for that receiver finally, receiver decrypts the encoded files. The searchable public-key cipher-texts by hidden structures for keyword Mukta Varsha* et al.   (IJITR) INTERNATIONAL JOURNAL OF INNOVATIVE TECHNOLOGY AND RESEARCH   Volume No.4, Issue No.5, August – September 2016, 3514 – 3516. 2320 –5547 @ 2013-2016 http://www.ijitr.com All rights Reserved.  Page | 3515 search as rapidly as achievable was introduced missing of compromising semantic security regarding encoded keywords and phrases. Semantic security is described for keywords and phrases additionally to hidden structures. This breakthrough and its semantic security is appropriate for keyword-searchable ciphertexts by kind of hidden structures.  We construct searchable public-key cipher-texts by hidden structure by yourself where cipher-texts possess a hidden star-like structure. Semantic security in the recommended system captures confidentiality of keywords and phrases and invisibility of hidden structures [3].  Hidden star-like arrangement should safeguard semantic security of keywords and phrases for guaranteeing of appropriate security, which indicate that partial relations are revealed only when equivalent keyword search trapdoor is recognized. Searching performance mostly relies upon actual cipher-texts that have requested keyword. For security, plan's confirmed semantically guaranteed according to Decisional Bilinear Diffie-Hellman assumption. Searching impracticality of our physiques is founded on actual volume of cipher-texts including requested keyword, to some degree than volume of the entire cipher-texts. III. AN OVERVIEW OF PROPOSED SYSTEM We are concerned in provision of generic searchable public-key cipher-texts by hidden structures to produce keyword-searchable cipher texts by hidden star-like structure. Our general searchable public-key cipher-texts by hidden structures is inspired by a lot of interesting findings using the systems of on Identity-Based Key Encapsulation. In Identity-Based Key Encapsulation a sender encapsulates an important perfectly right into a forecasted receiver ID which de-capsulate and get key. Our work examines as-fast-as-possible search within public-key file encryption by keyword search by semantic security. Semantic security is maintained when no keyword search trapdoor is recognized, the entire cipher texts are impossible to differentiate, without any particulars are revealed regarding the structure, then when specified a keyword search trapdoor, only equivalent relations are revealed, and matching cipher-texts leak no data regarding relaxation of cipher-texts, except the information that relaxation don't include requested keyword.  The recommended concept permits keyword-searchable cipher-texts to get produced utilizing a hidden structure plus this, entire keyword-searchable cipher-texts that are structured by hidden relations, by search trapdoor that suits a keyword, minimum data of relations is revealed with a search formula as management to locate the whole matching cipher-texts. When specifies a keyword search trapdoor, searching formula in the recommended system uncovers thing about this hidden arrangement for management on finding cipher-texts of requested keyword. Semantic security in the recommended system captures confidentiality of keywords and phrases and invisibility of hidden structures.  The recommended system produces keyword-searchable cipher-texts by means of hidden structure like star [4]. It's search complexity mostly straight line with exact volume of cipher-texts including requested keyword. The device outperforms existing public-key file encryption by keyword search techniques by means of semantic security, whose complexity of search is straight line with volume of the entire cipher-texts [5][6]. The recommended system seems a reliable tool for fixing of some problems within public-key searchable file encryption. One application could be to achieve recovery completeness verification which, isn't accomplished within existing public-key file encryption by keyword search techniques. Particularly, by means of developing hidden ring-like arrangement, that's letting final hidden pointer constantly indicate mind, you can obtain public-key file encryption by keyword search enabling making certain totality of retrieved cipher-texts by means of checking whether pointers of returned cipher-texts forms a gemstone ring.  Fig1: Time cost of proposed system IV. CONCLUSION For promising of appropriate security, hidden star-like arrangement should safeguard semantic security of keywords and phrases, which indicate that partial relations are revealed only when equivalent keyword search trapdoor is recognized. We introduce searchable public-key cipher-texts by hidden structures for keyword search as rapidly as achievable missing of compromising semantic security regarding encoded keywords and phrases.  We build searchable public-key cipher-texts by hidden structure within the scratch where cipher-texts possess a hidden star-like structure. To make sure of appropriate security, hidden star-like arrangement should safeguard semantic security of keywords and phrases, which indicate that partial relations are revealed only when equivalent keyword search trapdoor is recognized. In this particular system, the whole keyword-searchable cipher-texts that are structured by hidden relations, Mukta Varsha* et al.   (IJITR) INTERNATIONAL JOURNAL OF INNOVATIVE TECHNOLOGY AND RESEARCH   Volume No.4, Issue No.5, August – September 2016, 3514 – 3516. 2320 –5547 @ 2013-2016 http://www.ijitr.com All rights Reserved.  Page | 3516 by search trapdoor that suits a keyword, minimum data of relations is revealed with a search formula as management to locate the whole matching cipher-texts resourcefully. Searching complexity within our plan is founded on actual volume of cipher-texts including requested keyword, to some degree than volume of the entire cipher-texts. V. REFERENCES [1]  Abdalla M., Catalano D., Fiore D.: Verifiable Random Functions: Relations to Identity-Based Key Encapsulation and New Constructions. Journal of Cryptology, 27(3), pp. 544-593 (2013) [2]  Freire E.S.V., Hofheinz D., Paterson K.G., Striecks C.: Programmable Hash Functions in the Multilinear Setting. In: Canetti R., Garay J.A. (eds.) Advances in Cryptology - CRYPTO 2013. LNCS, vol. 8042, pp. 513-530. Springer, Heidelberg (2013) [3]  Garg S., Gentry C., Halevi S.: Candidate Multilinear Maps from Ideal Lattices. In: Johansson T., Nguyen P. (eds.) Advances in Cryptology - EUROCRYPT 2013. LNCS, vol. 7881, pp. 1-17. Springer, Heidelberg (2013) [4]  Kamara S., Papamanthou C., Roeder T.: Dynamic searchable symmetric encryption. In ACM Conference on Computer and Communications Security, pp. 965976 (2012) [5]  Kamara S., Papamanthou C.: Parallel and Dynamic Searchable Symmetric Encryption. In: Sadeghi A.-R. (ed.) FC 2013. LNCS, vol.7859, pp. 258-274. Springer, Heidelberg (2013) [6]  Cash D., Jaeger J., Jarecki S., Jutla C., Krawczyk H., Ros M.-C., Steiner M.: Dynamic Searchable Encryption in Very Large Databases: Data Structures and Implementation. In: NDSS 2014. 

ELEVATING THE PROBLEMS OF LINEAR SEARCHABLE CIPHERTEXT ON LARGE-SCALE DATABASE

http://www.ijitr.com/index.php/ojs/article/download/996/pdf

ELEVATING THE PROBLEMS OF LINEAR SEARCHABLE CIPHERTEXT ON LARGE-SCALE DATABASE

Abstract

Similar works

Full text

Available Versions

International Journal of Innovative Technology and Research (IJITR)