DISCOVERY CONSERVING HIERARCHICAL MULTIPLE KEY SEARCH FOR SEVERAL FACT HOLDERS IN CLOUD COMPUTING

Mabasha Shaik, Jetty Madhan Kumar

Abstract


Within this paper, we advise schemes to handle Privacy protecting Rated Multi-keyword Search within the Multi-owner model (PRMSM). Ought to be fact, most cloud servers used don't merely serve one data owner rather, they frequently occasions support multiple data keepers to go over the advantages produced by cloud-computing. For privacy concerns, a great search over encoded cloud data has motivated several research works underneath the single owner model. However, most cloud servers used don't merely serve one owner rather, they support multiple keepers to go over the advantages produced by cloud-computing. Using the introduction of cloud-computing, it's more and more popular for data keepers to delegate their data to public cloud servers while permitting data people to retrieve this data. Allowing cloud servers to accomplish secure search missing the understanding within the specific data of both keywords and trapdoors, we methodically create a novel secure search protocol. Additionally, PRMSM supports efficient data user revocation. To avoid the attackers from eavesdropping secret keys and pretending to get legal data customers posting searches, we advise a manuscript dynamic secret key generation protocol along with a new data user authentication protocol. Extensive experiments on real-world datasets start to see the effectiveness and efficiency of PRMSM. To place searching results and preserve the privacy of relevance scores between keywords and files, we advise a manuscript Additive Order and Privacy Protecting Function family.


Keywords


Ranked Keyword Search; Multiple Owners; Privacy Preserving;

References


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

D. B. et al., “Public key encryption with keyword search secure against keyword guessing attacks without random oracle,” EUROCRYPT, vol. 43, pp. 506–522, 2004.

M. Chuah and W. Hu, “Privacy-aware bedtree based solution for fuzzy multi-keyword search over encrypted data,” in Proc. IEEE 31th International Conference on Distributed Computing Systems (ICDCS’11), Minneapolis, MN, Jun. 2011, pp. 383–392.

R. Agrawal, J. Kiernan, R. Srikant, and Y. Xu, “Order preserving encryption for numeric data,” in Proc. ACM SIGMOD’04, Paris, France, Jun. 2004, pp. 563–574.

D. B. et al., “Public key encryption with keyword search secure against keyword guessing attacks without random oracle,” EUROCRYPT, vol. 43, pp. 506–522, 2004.


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.