PROVIDING A FLEXIBLE AND COSTLESS SOLUTION FOR TRANSITIONAL SETS

Amrutha Mary, J.Arthi Jaya Kumari

Abstract


Within this paper, we advise a manuscript upper bound privacy leakage constraint-based method of identify which intermediate data sets have to be encoded and that do not, to ensure that privacy-protecting cost could be saved as the privacy needs of information holders can nonetheless be satisfied. To be able to curtail the general expenses by staying away from frequent computation to acquire these data sets. Such situations are very common because data customers frequently reanalyze results, conduct new analysis on intermediate data sets, or share some intermediate results with other people for collaboration. Across the processing of these programs, a sizable amount of intermediate data sets is going to be produced, and frequently stored in order to save the price of computing them. Cloud computing provides massive computation power and storage capacity which enable customers to deploy computation and knowledge-intensive programs without infrastructure investment. However, protecting the privacy of intermediate data sets turns into a challenging problem because opponents may recover privacy-sensitive information by examining multiple intermediate data sets. Evaluation results show the privacy-protecting price of intermediate data sets could be considerably reduced with this approach over existing ones where all data sets are encoded. Encrypting ALL data takes hold cloud is broadly adopted in existing methods to address this concern. But we reason that encrypting all intermediate data sets are neither efficient nor cost-effective since it is very time intensive and pricey for data-intensive programs to en/decrypt data sets frequently while carrying out any operation in it. Finally, we design an operating heuristic formula accordingly to recognize the information sets that should be encoded.


Keywords


Data Storage Privacy; Intermediate Data Set; Privacy Upper Bound.

References


H. Takabi, J.B.D. Joshi, and G. Ahn, “Security and Privacy Challenges in Cloud Computing Environments,” IEEE Security & Privacy, vol. 8, no. 6, pp. 24-31, Nov./Dec. 2010.

E.T. Jaynes, “Information Theory and Statistical Mechanics,” Physical Rev., vol. 106, no. 4, pp. 620-630, 1957.

S.B. Davidson, S. Khanna, T. Milo, D. Panigrahi, and S. Roy, “Provenance Views for Module Privacy,” Proc. 30th ACM SIGMOD-SIGACT-SIGART Symp. Principles of Database Systems (PODS ’11), pp. 175-186, 2011.

K.-K. Muniswamy-Reddy, P. Macko, and M. Seltzer, “Provenance for the Cloud,” Proc. Eighth USENIX Conf. File and Storage Technologies (FAST ’10), pp. 197-210, 2010.

B.C.M. Fung, K. Wang, R. Chen, and P.S. Yu, “Privacy-Preserving Data Publishing: A Survey of Recent Developments,” ACM Computing Survey, vol. 42, no. 4, pp. 1-53, 2010.


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.