Fragmentation in Presence of Data Dependencies

Fragmentation has been recently proposed as a promising approach to protect the confidentiality of sensitive associations whenever data need to undergo external release or storage. By splitting attributes among different fragments, fragmentation guarantees confidentiality of the associations among t...

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on dependable and secure computing 2014-11, Vol.11 (6), p.510-523
Main Authors: De Capitani di Vimercati, Sabrina, Foresti, Sara, Jajodia, Sushil, Livraga, Giovanni, Paraboschi, Stefano, Samarati, Pierangela
Format: Article
Language:English
Subjects:
Computation
Confidentiality
CSP
Data dependencies
Data dependency
data fragmentation
Data integrity
Data models
Fragmentation
Fragments
Information processing
Information storage
Leakage
Leaking of information
Mathematical models
Proposals
Security management
Splitting
Studies
visibility requirements
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Fragmentation has been recently proposed as a promising approach to protect the confidentiality of sensitive associations whenever data need to undergo external release or storage. By splitting attributes among different fragments, fragmentation guarantees confidentiality of the associations among these attributes under the assumption that such associations cannot be reconstructed by re-combining the fragments. We note that the requirement that fragments do not have attributes in common, imposed by previous proposals, is only a necessary, but not sufficient, condition to ensure that information in different fragments cannot be recombined as dependencies may exist among data enabling some form of linkability. In this paper, we identify the problem of improper information leakage due to data dependencies, provide a formulation of the problem based on a natural graphical modeling, and present an approach to tackle it in an efficient and scalable way.
ISSN:1545-5971
1941-0018
DOI:10.1109/TDSC.2013.2295798