Privacy Preserving Heuristic Approach for Intermediate Data Sets in Cloud

  IJETT-book-cover  International Journal of Engineering Trends and Technology (IJETT)          
  
© 2014 by IJETT Journal
Volume-9 Number-5                          
Year of Publication : 2014
Authors : Ms. C. Celcia , Mrs. T. Kavitha
  10.14445/22315381/IJETT-V9P247

MLA 

Ms. C. Celcia , Mrs. T. Kavitha. "Privacy Preserving Heuristic Approach for Intermediate Data Sets in Cloud", International Journal of Engineering Trends and Technology(IJETT), V9(5),235-240 March 2014. ISSN:2231-5381. www.ijettjournal.org. published by seventh sense research group

Abstract

Cloud computing is the sharing of computing resources which lessen the upfront investment cost of IT infrastructure. So many organizations are moving their business into cloud. In data intensive applications, while processing original data set many intermediate data sets will be generated. The intermediate data sets are often stored in cloud in order to reduce the cost of recomputing them. Intermediate data sets may contain sensitive information. Preserving the privacy of the intermediate data sets is a challenging problem because adversaries may recover sensitive information by analyzing multiple intermediate data sets. Encrypting all intermediate data sets is neither efficient nor cost effective. It may be very time consuming to encrypt and decrypt all the intermediate data sets. Privacy preserving heuristic approach identifies which intermediate data set needs to be encrypted and which do not based on the privacy requirements of the data holders. In this, encryption is integrated with data anonymization for cost-effective privacy preserving.

References

[1] H. Lin and W. Tzeng, “A Secure Erasure Code-Based Cloud Storage System with Secure Data Forwarding,” IEEE Trans. Parallel and Distributed Systems, vol. 23, no. 6, pp. 995-1003, June 2012.
[2] N. Cao, C. Wang, M. Li, K. Ren, and W. Lou, “Privacy-Preserving Multi-Keyword Ranked Search over Encrypted Cloud Data,” Proc. IEEE INFOCOM ’11, pp. 829-837, 2011.
[3] M. Li, S. Yu, N. Cao, and W. Lou, “Authorized Private Keyword Search over Encrypted Data in Cloud Computing,” Proc. 31st Int’l Conf. Distributed Computing Systems (ICDCS ’11), pp. 383-392, 2011.
[4] C. Gentry, “Fully Homomorphic Encryption Using Ideal Lattices,” Proc. 41st Ann. ACM Symp. Theory of Computing (STOC ’09), pp. 169-178, 2009.
[5] Wang J, Zhao Y et al. (2009). Providing Privacy Preserving 1. in cloud computing, International Conference on Test and Measurement, vol 2, 213–216.
[6] 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.
[7] I. Roy, S.T.V. Setty, A. Kilzer, V. Shmatikov, and E. Witchel, “Airavat: Security and Privacy for Mapreduce,” Proc. Seventh USENIX Conf. Networked Systems Design and Implementation (NSDI ’10), p. 20, 2010.
[8] K.P.N. Puttaswamy, C. Kruegel, and B.Y. Zhao, “Silverline: Toward Data Confidentiality in Storage-Intensive Cloud Applications,” Proc. Second ACM Symp. Cloud Computing (SoCC ’11), 2011.
[9] K. Zhang, X. Zhou, Y. Chen, X. Wang, and Y. Ruan, “Sedic: Privacy-Aware Data Intensive Computing on Hybrid Clouds,” Proc. 18th ACM Conf. Computer and Comm. Security (CCS ’11), pp. 515-526, 2011.
[10] V. Ciriani, S.D.C.D. Vimercati, S. Foresti, S. Jajodia, S. Paraboschi, and P. Samarati, “Combining Fragmentation and Encryption to Protect Privacy in Data Storage,” ACM Trans. Information and System Security, vol. 13, no. 3, pp. 1-33, 2010.
[11] Xuyun Zhang, Chang Liu, Surya Nepal, Suraj Pandey, and Jinjun Chen, Member, IEEE , “A Privacy Leakage Upper Bound Constraint-Based Approach for Cost-Effective Privacy Preserving of Intermediate Data Sets in Cloud,” IEEE transactions on parallel and distributed systems, vol. 24, no. 6, june 2013.

Keywords
Privacy preserving, Cloud computing, Intermediate data set, Encryption, Privacy requirement, Privacy Leakage