Open Access   Article Go Back

A Novel Approach for Searchable Keyword in Cloud Computing Using Efficient Algorithm

P.Sai Sirisha1 , K.Praveen Kumar2 , M.Harsha Vardhan3 , J.Karthik 4

  1. Computer Science & Engineering, St.Ann`s College of Engineering & Technology, JNTUK, Chirala, India.
  2. Computer Science & Engineering, St.Ann`s College of Engineering & Technology, JNTUK, Chirala, India.
  3. Computer Science & Engineering, St.Ann`s College of Engineering & Technology, JNTUK, Chirala, India.
  4. Computer Science & Engineering, St.Ann`s College of Engineering & Technology, JNTUK, Chirala, India.

Section:Research Paper, Product Type: Journal Paper
Volume-6 , Issue-5 , Page no. 622-625, May-2018

CrossRef-DOI:   https://doi.org/10.26438/ijcse/v6i5.622625

Online published on May 31, 2018

Copyright © P.Sai Sirisha, K.Praveen Kumar, M.Harsha Vardhan, J.Karthik . This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

View this paper at   Google Scholar | DPI Digital Library

XML View
PDF Download

How to Cite this Paper

  • IEEE Citation
  • MLA Citation
  • APA Citation
  • BibTex Citation
  • RIS Citation

IEEE Style Citation: P.Sai Sirisha, K.Praveen Kumar, M.Harsha Vardhan, J.Karthik, “A Novel Approach for Searchable Keyword in Cloud Computing Using Efficient Algorithm,” International Journal of Computer Sciences and Engineering, Vol.6, Issue.5, pp.622-625, 2018.

MLA Style Citation: P.Sai Sirisha, K.Praveen Kumar, M.Harsha Vardhan, J.Karthik "A Novel Approach for Searchable Keyword in Cloud Computing Using Efficient Algorithm." International Journal of Computer Sciences and Engineering 6.5 (2018): 622-625.

APA Style Citation: P.Sai Sirisha, K.Praveen Kumar, M.Harsha Vardhan, J.Karthik, (2018). A Novel Approach for Searchable Keyword in Cloud Computing Using Efficient Algorithm. International Journal of Computer Sciences and Engineering, 6(5), 622-625.

BibTex Style Citation:
@article{Sirisha_2018,
author = {P.Sai Sirisha, K.Praveen Kumar, M.Harsha Vardhan, J.Karthik},
title = {A Novel Approach for Searchable Keyword in Cloud Computing Using Efficient Algorithm},
journal = {International Journal of Computer Sciences and Engineering},
issue_date = {5 2018},
volume = {6},
Issue = {5},
month = {5},
year = {2018},
issn = {2347-2693},
pages = {622-625},
url = {https://www.ijcseonline.org/full_paper_view.php?paper_id=2030},
doi = {https://doi.org/10.26438/ijcse/v6i5.622625}
publisher = {IJCSE, Indore, INDIA},
}

RIS Style Citation:
TY - JOUR
DO = {https://doi.org/10.26438/ijcse/v6i5.622625}
UR - https://www.ijcseonline.org/full_paper_view.php?paper_id=2030
TI - A Novel Approach for Searchable Keyword in Cloud Computing Using Efficient Algorithm
T2 - International Journal of Computer Sciences and Engineering
AU - P.Sai Sirisha, K.Praveen Kumar, M.Harsha Vardhan, J.Karthik
PY - 2018
DA - 2018/05/31
PB - IJCSE, Indore, INDIA
SP - 622-625
IS - 5
VL - 6
SN - 2347-2693
ER -

VIEWS PDF XML
350 200 downloads 203 downloads
  
  
           

Abstract

In ancient, dynamic secret writing systems it provides solely information confidentiality, however, it`s incompatible with dynamic multi-keyword over encrypted information by causing secret keys to the user through the mail. In traditional we`ll be going to be operative on plain information however in our project we tend to encrypt the information. The info by generating secret keys and activity search on encrypted data by user request. During this paper, we tend to propose a dynamic multi-keyword hierarchical search theme over encrypted cloud information, that at the same time supports dynamic update operations like deletion and insertion of documents. Intensive experiments area unit conducted to demonstrate the potency of the projected theme.

Key-Words / Index Term

MultiKeyword,Ranked,Efficient,Searchable

References

K.Ren, C.Wang, Q.Wangetal., “Security challenges for the public cloud”, IEEE Internet Computing, vol. 16, No. 1, pp. 69–73, 2012.
[2] S. Kamara and K. Lauter, “Cryptographic cloud storage,” in Financial Cryptography and Data Security. Springer, 2010, pp. 136– 149.
[3] C. Gentry, “A fully homomorphic encryption scheme”, Ph.D. dissertation, Stanford University, 2009.
[4] O. Goldreich and R. Ostrovsky, “Software protection and simulation on oblivious rams”, Journal of the ACM (JACM), vol. 43, No. 3, pp. 431–473, 1996.
[5] D. Boneh, G. Di Crescenzo, R. Ostrovsky, and G. Persiano, “Public key encryption with keyword search”, in Advances in Cryptology Eurocrypt 2004. Springer, 2004, pp. 506–522.
[6] D. Boneh, E. Kushilevitz, R. Ostrovsky, and W. E. Skeith III, “Public key encryption that allows pir queries”, in Advances in Cryptology-CRYPTO 2007. Springer, 2007, pp. 50–67.
[7] Y. H. Hwang and P. J. Lee, “Public key encryption with conjunctive keyword search and its extension to a multi-user system,” in Proc. 1st Int. Conf. Pairing-Based Cryptography, 2007, pp. 2–22
[8] D. X. Song, D. Wagner, and A. Perrig, “Practical techniques for searches on encrypted data”, in Proc. IEEE Symp. Secur. Privacy, 2000, pp. 44–55.
[9] E.-J. Goh, “Secure indexes”, IACR Cryptol. ePrint Archive, vol. 2003, pp. 216.
[10] Y.-C. Chang and M. Mitzenmacher, “Privacy preserving keyword searches on remote encrypted data,” in Proc. 3rd Int. Conf. Appl. Cryptography Netw. Secur., 2005, pp. 442–455.
[11] J. Li, Q. Wang, C. Wang, N. Cao, K. Ren, and W. Lou, “Fuzzy keyword search over encrypted data in cloud computing,” in IEEE Proc. INFOCOM, 2010, pp. 1–5.