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

Authors

  • Sai Sirisha P Computer Science & Engineering, St.Ann's College of Engineering & Technology, JNTUK, Chirala, India
  • Praveen Kumar K Computer Science & Engineering, St.Ann's College of Engineering & Technology, JNTUK, Chirala, India
  • Vardhan MH Computer Science & Engineering, St.Ann's College of Engineering & Technology, JNTUK, Chirala, India
  • Karthik J Computer Science & Engineering, St.Ann's College of Engineering & Technology, JNTUK, Chirala, India

DOI:

https://doi.org/10.26438/ijcse/v6i5.622625

Keywords:

MultiKeyword, Ranked, Efficient, Searchable

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.

References

K.Ren, C.Wang, Q.Wangetal., “Security challenges for the public cloud”, IEEE Internet Computing, vol. 16, No. 1, pp. 69–73, 2012.

S. Kamara and K. Lauter, “Cryptographic cloud storage,” in Financial Cryptography and Data Security. Springer, 2010, pp. 136– 149.

C. Gentry, “A fully homomorphic encryption scheme”, Ph.D. dissertation, Stanford University, 2009.

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.

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.

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.

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

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.

E.-J. Goh, “Secure indexes”, IACR Cryptol. ePrint Archive, vol. 2003, pp. 216.

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.

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.

Downloads

Published

2025-11-13
CITATION
DOI: 10.26438/ijcse/v6i5.622625
Published: 2025-11-13

How to Cite

[1]
P. Sai Sirisha, K. Praveen Kumar, M. H. Vardhan, and J. Karthik, “A Novel Approach for Searchable Keyword in Cloud Computing Using Efficient Algorithm”, Int. J. Comp. Sci. Eng., vol. 6, no. 5, pp. 622–625, Nov. 2025.

Issue

Section

Research Article