1 / 12

Combining Fragmentation and Encryption for Secure Data Outsourcing in Privacy Preservation

This paper explores innovative methods for secure data outsourcing, focusing on the integration of fragmentation and encryption techniques. By breaking sensitive associations between attributes, we enhance data confidentiality while allowing specified attribute release under defined constraints. The study discusses various examples, including singleton constraints and how to optimally fragment attributes in a distributed database setting. We delve into complexities of enforcing confidentiality constraints, maximizing visibility and attribute affinity, with insights into NP-hard problem challenges.

jadon
Télécharger la présentation

Combining Fragmentation and Encryption for Secure Data Outsourcing in Privacy Preservation

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. CS573 Data Privacy and Security Secure data outsourcing – Combining encryption and fragmentation

  2. Combining Fragmentation and Encryption for outsourcing • Breaking sensitive associations between attributes

  3. Confidentiality Constraints • Example: constraint {DoB, Zip, Illness} • Okay to release {DoB, Zip}, {Zip}, …

  4. Constraint Example

  5. Basic ideas • Singleton constraints • encryption • Association constraints • encryption of any one attribute • Fragmentation of the attributes

  6. Example

  7. Fragmentation • Classical distributed database design problem (vertical fragmentation) • Total number of possible fragmentations given N attributes? • What would be an optimal fragmentation?

  8. Optimal fragmentation • Correctly enforce constraints • Maximal visibility • Minimal fragmentation • Maximal attribute affinity • Problem is NP hard

  9. Algorithm without confidentiality constraints • Without confidentiality constraints - Hierarchical clustering • With confidentiality constraints? • {s}, {n,d}, {n,z}, {n, i}, {n, p}, {d, z, i}, {d, z, p}

  10. References • Combining fragmentation and encryption to protect privacy in data storage, TISSEC, 2010 • Fragmentation design for efficient query execution over sensitive distributed databases, ICDCS, 2009

More Related