By Topic

Data Outsourcing in Cloud Environments: A Privacy Preserving Approach

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
T. J. V. R. K. M. K. Sayi ; Sri Sathya Sai Inst. of Higher Learning, Prasanthi Nilayam, India ; R. K. N. Sai Krishna ; R. Mukkamala ; P. K. Baruah

With the increasing cost of maintaining IT centers, organizations are looking into outsourcing thier storage and computational needs to a cloud server. However, such outsourcing has also raised the more serious issue of data privacy. In this paper, we summarize our work in privacy-preserving data outsourcing. In particular, we discuss the issue of employing vertical fragmentation to a relation so that the fragment that is assigned to the cloud server contains maximum data without violating privacy. Here, privacy is expressed in terms of a set of confidentiality constraints. We represent the confidentiality constraints as a graph where the nodes are the attributes and links represent paired confidentiality. We then apply the graph coloring problem with two colors for the a cyclic portion of the graph. We use some heuristic to eliminate the cycles, and complete the coloring of all nodes. We are currently extending the work to multiple relations and constraints with multiple attributes in a constraint (i.e., triplet, quadruplet, etc.) instead of just pairs.

Published in:

Information Technology: New Generations (ITNG), 2012 Ninth International Conference on

Date of Conference:

16-18 April 2012