Defend Clandestine Rated Multi-keyword Search for Multi-Proprietors in Cloud Computing

Authors

  • Vanishree K.A Dept. Of Computer Science and Engineering, Anna University, India
  • Santhiya C Dept. Of Computer Science and Engineering, Anna University, India
  • MK Chandrasekaran Dept. Of Computer Science and Engineering, Anna University, India

Keywords:

Cloud Computing, Rated Keyword Search, Multiple Owners, Privacy Preserving, Dynamic Secret Key

Abstract

Due to the escalating popularity of cloud computing, more and more data owners are encouraged to outsource their data to cloud servers for great convenience and scaled-down the cost in data management. For privacy concerns, secure searches over encrypted cloud data have motivated numerous research works under the solitary owner model. However, most cloud servers in practice do not just serve single owner; instead, they support multiple owners to share their profits fetched by cloud computing. In our proposed scheme which is deals with Defend Clandestine rated Multi-keyword Search in a Multi-proprietor model (DCMSM). To activate cloud servers to perform secure search without knowing the actual data of both keywords and trapdoors, we methodically build a newfangled secure search protocol. We propose another technique as distinct Additive Order and Privacy Preserving Function family for the purpose of rank the search results and preserve the privacy of appositeness scores between keywords and files. By introducing a modish dynamic secret key generation protocol and a novel data user authentication protocol to prevent the attackers from intruding secret keys and concealing the legal data users submitting searches. Additionally, DCMSM supports efficient data user invocation. Comprehensive experiments on real-world datasets confirm the efficaciousness and efficiency of DCMSM.

References

C. Wang, S. S. Chow, Q. Wang, K. Ren, and W. Lou, Privacy-preserving public auditing for secure cloud storage,” Computers, IEEE Transactions on, vol. 62, no. 2, pp. 362-375, 2013.

D.Song, D.Wagner, and A.Perrig, “Practical techniques for searches on encrypted data,” in Proc. IEEE International Symposium on Security and Privacy (S&P’00), Nagoya, Japan, Jan.2000, pp. 44-55.

R.Curtmola, J.Garay, S.Kamara, and R.Ostrovsky, “Searchable symmetric encryption: improved definitions and efficient constructions,” in Proc. ACM CS’06, VA, USA, Oct. 2006, pp.79-88.

N.Cao,C. Wang, M. Li, K. Ren, and W. Lou, “Privacy- preserving multi-keyword ranked search over encrypted clouddata,”inProc.IEEEINFOCOM’11,Shanghai,China,Apr.2011,pp. 829-837.

N.Cao, C.Wang, M. Li, K. Ren, and W. Lou,“Privacy- preserving multi-keyword ranked search over encrypted cloud data,” Parallel and Distributed Systems, IEEE Transactions on,vol. 25, no. 1, pp. 222-233, 2014.

T. Jung, X. Y. Li, Z. Wan, and M. Wan, “Privacy preserving cloud data access with multi-authorities,” in Proc. IEEE INFOCOM’13, Turin, Italy, Apr. 2013, pp. 2625-2633.

Downloads

Published

2025-11-10

How to Cite

[1]
K. Vanishree, C. Santhiya, and M. Chandrasekaran, “Defend Clandestine Rated Multi-keyword Search for Multi-Proprietors in Cloud Computing”, Int. J. Comp. Sci. Eng., vol. 3, no. 9, pp. 248–255, Nov. 2025.

Issue

Section

Research Article