CLOUD ENVIRONMENT USING MANY PHRASAL WORDS CONCEALMENT PRESERVING TO PERFORM SAFE SEARCH

N. Grace Naomi, Dr. G. Charles Babu, Dr. Ch. Ramesh Babu

Abstract


Using the development of cloud computing, it's increasingly popular for data entrepreneurs to delegate their data to public cloud servers while enabling data clients to retrieve this data. For privacy concerns, secure searches over encoded cloud data have motivated several research works beneath the single owner model. However, most cloud servers used don't merely serve one owner rather, they support multiple entrepreneurs to speak about the benefits created by cloud computing. In this particular paper, we advise schemes to deal with Privacy safeguarding Ranked Multi-keyword Search in the Multi-owner model (PRMSM). To allow cloud servers to complete secure search lacking the knowledge of the specific data of both keywords and phrases and trapdoors, we methodically create a manuscript secure search protocol. To put searching results and preserve the privacy of relevance scores between key phrases and files, we advise a manuscript Additive Order and Privacy Safeguarding Function family. To prevent the attackers from eaves shedding secret keys and pretending to get legal data clients posting searches, we advise a manuscript dynamic secret key generation protocol plus a new data user authentication protocol. Additionally, PRMSM supports efficient data user revocation. Extensive experiments on real-world datasets browse the effectiveness and efficiency of PRMSM.


Keywords


Cloud Computing; Ranked Keyword Search; Multiple Owners; Privacy Preserving; Dynamic Secret Key

References


C. Wang, N. Cao, J. Li, K. Ren, and W. Lou, “Secure rankedkeyword search over encrypted cloud data,” in Proc. IEEEDistributed Computing Systems (ICDCS’10), Genoa, Italy, Jun.2010, pp. 253–262.

Z. Xu, W. Kang, R. Li, K. Yow, and C. Xu, “Efficient multikeywordranked query on encrypted data in the cloud,” inProc. IEEE Parallel and Distributed Systems (ICPADS’12), Singapore,Dec. 2012, pp. 244–251.

R. Curtmola, J. Garay, S. Kamara, and R. Ostrovsky, “Searchablesymmetric encryption: improved definitions and efficientconstructions,” in Proc. ACM CCS’06, VA, USA, Oct. 2006, pp.79–88.

I. H. Witten, A. Moffat, and T. C. Bell, Managing gigabytes:Compressing and indexing documents and images. San Francisco,USA: Morgan Kaufmann, 1999.

D. Boneh and M. Franklin, “Identity-based encryption fromthe weil pairing,” SIAM Journal on Computing, vol. 32, no. 3,pp. 586–615, 2003.


Full Text: PDF

Refbacks

  • There are currently no refbacks.




Copyright © 2012 - 2021, All rights reserved.| ijitr.com

Creative Commons License
International Journal of Innovative Technology and Research is licensed under a Creative Commons Attribution 3.0 Unported License.Based on a work at IJITR , Permissions beyond the scope of this license may be available at http://creativecommons.org/licenses/by/3.0/deed.en_GB.