A New Privacy Preserving Approach Used in Cloud Computing

Abstract:

Cloud computing seems to offer some incredible benefits for communicators: the availability of an incredible array of software applications, access to lightning-quick processing power, unlimited storage, and the ability to easily share and process information. All of this is available through your browser any time you can access the Internet. While this might all appear enticing, there remain issues of reliability, portability, privacy, and security. When our private data are out-sourced in cloud computing, we should guarantee the confidentiality and searchability of the private data. Our paper provides a new approach to avoid the disclosure of the sensitive attributes of users when user ask for service from the Service Provider (SP) in cloud computing.

• Periodical: Key Engineering Materials (Volumes 439-440)
• Pages: 1318-1323
• DOI: https://doi.org/10.4028/www.scientific.net/KEM.439-440.1318
• Online since: June 2010
• Authors: Jian Wang, Yan Zhao, Jia Jin Le
• Keywords: Cloud Computing, Privacy, Security, Service Provider

References

[1] L. Wang et al., Scientific Cloud Computing: Early Definition and Experience, Proc. 10th International Conference of High-Performance Computing and Communications (HPCC 08), 2008, pp.825-830.

[2] N. Santos, K. P. Gummadi, and R. Rodrigues, Towards trusted cloud computing, In USENIX HotCloud, (2009).

[3] K. D. Bowers, A. Juels, and A. Oprea, HAIL: A High-Availability and Integrity Layer for Cloud Storage, Cryptology ePrint Archive, Report, (2008).

DOI: 10.1145/1653662.1653686

[4] L. Sweeney, k-anonymity: a model for protecting privacy, International Journal on Uncertainty, Fuzziness and Knowledge-based Systems, 2002, pp.557-570.

DOI: 10.1142/s0218488502001648

[5] R. Bayardo and R. Agrawal, Data privacy through optimal k-anonymization, In ICDE, 2005, pp.217-228.

DOI: 10.1109/icde.2005.42

[6] R. Agrawal, A. Evfimievski, and R. Srikant. Information sharing across private databases. In Proceedings of the 2003 ACM SIGMOD Int'l Conf. on Management of Data, San Diego, CA, (2003).

DOI: 10.1145/872757.872771

[7] Mohamed Shehab, Anna Cinzia Squicciarini and Gail-Joon Ahn, Beyond User-to-User Access Control for Online Social Networks, ICICS 2008: 10th International Conference on Information and Communications Security, October, 2008, Birmingham, UK.

DOI: 10.1007/978-3-540-88625-9_12

[8] Gabriel Ghinita, Panagiotis Karras, Panos Kalnis, and Nikos Mamoulis, Fast data anonymization with low information loss, In Proc. of Very Large Data Bases (VLDB), 2007, pp.758-769.

[9] C. C. Aggarwal, On k-anonymity and the curse of dimensionality, In VLDB, 2005, pp.901-909.

[10] WONG R C, LI J, FU A W, et a1, (α, k)-Anonymity： an enhaned k-anonymity model for privacy-preserving data publishing, Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining, ACM Press, New York, 2006, pp.754-759.

DOI: 10.1145/1150402.1150499

[11] A. Machanavajjhala, J. Gehrke, and D. Kifer, l-diversity: Privacy beyond k-anonymity, In Proc. of ICDE, Apr. (2006).

DOI: 10.1109/icde.2006.1

[12] N. Li, T. Li, and S. Venkatasubramanian, t-Closeness: Privacy Beyond k-anonymity and l-Diversity, In Proc. of ICDE, 2007, pp.106-115.