Open Access   Article Go Back

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

Vanishree K.A.1 , Santhiya. C2 , M.K. Chandrasekaran PhD3

Section:Research Paper, Product Type: Journal Paper
Volume-3 , Issue-9 , Page no. 248-255, Sep-2015

Online published on Oct 01, 2015

Copyright © Vanishree K.A., Santhiya. C , M.K. Chandrasekaran PhD . 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 Style Citation: Vanishree K.A., Santhiya. C , M.K. Chandrasekaran PhD, “Defend Clandestine Rated Multi-keyword Search for Multi-Proprietors in Cloud Computing,” International Journal of Computer Sciences and Engineering, Vol.3, Issue.9, pp.248-255, 2015.

MLA Style Citation: Vanishree K.A., Santhiya. C , M.K. Chandrasekaran PhD "Defend Clandestine Rated Multi-keyword Search for Multi-Proprietors in Cloud Computing." International Journal of Computer Sciences and Engineering 3.9 (2015): 248-255.

APA Style Citation: Vanishree K.A., Santhiya. C , M.K. Chandrasekaran PhD, (2015). Defend Clandestine Rated Multi-keyword Search for Multi-Proprietors in Cloud Computing. International Journal of Computer Sciences and Engineering, 3(9), 248-255.

BibTex Style Citation:
@article{K.A._2015,
author = {Vanishree K.A., Santhiya. C , M.K. Chandrasekaran PhD},
title = {Defend Clandestine Rated Multi-keyword Search for Multi-Proprietors in Cloud Computing},
journal = {International Journal of Computer Sciences and Engineering},
issue_date = {9 2015},
volume = {3},
Issue = {9},
month = {9},
year = {2015},
issn = {2347-2693},
pages = {248-255},
url = {https://www.ijcseonline.org/full_paper_view.php?paper_id=680},
publisher = {IJCSE, Indore, INDIA},
}

RIS Style Citation:
TY - JOUR
UR - https://www.ijcseonline.org/full_paper_view.php?paper_id=680
TI - Defend Clandestine Rated Multi-keyword Search for Multi-Proprietors in Cloud Computing
T2 - International Journal of Computer Sciences and Engineering
AU - Vanishree K.A., Santhiya. C , M.K. Chandrasekaran PhD
PY - 2015
DA - 2015/10/01
PB - IJCSE, Indore, INDIA
SP - 248-255
IS - 9
VL - 3
SN - 2347-2693
ER -

VIEWS PDF XML
2347 2411 downloads 2457 downloads
  
  
           

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.

Key-Words / Index Term

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

References

[1] 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.
[2] 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.
[3] 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.
[4] 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.
[5] 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.
[6] 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.