Protecting Respondents' Identities in Microdata Release
IEEE Transactions on Knowledge and Data Engineering
Injecting utility into anonymized datasets
Proceedings of the 2006 ACM SIGMOD international conference on Management of data
Anonymizing sequential releases
Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining
Anatomy: simple and effective privacy preservation
VLDB '06 Proceedings of the 32nd international conference on Very large data bases
L-diversity: Privacy beyond k-anonymity
ACM Transactions on Knowledge Discovery from Data (TKDD)
Anonymizing bipartite graph data using safe groupings
Proceedings of the VLDB Endowment
Towards publishing recommendation data with predictive anonymization
ASIACCS '10 Proceedings of the 5th ACM Symposium on Information, Computer and Communications Security
Combining fragmentation and encryption to protect privacy in data storage
ACM Transactions on Information and System Security (TISSEC)
Fragments and loose associations: respecting privacy in data publishing
Proceedings of the VLDB Endowment
Selective data outsourcing for enforcing privacy
Journal of Computer Security - DBSEC 2008
Protecting privacy in data release
Foundations of security analysis and design VI
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part II
Privacy-Preserving network aggregation
PAKDD'10 Proceedings of the 14th Pacific-Asia conference on Advances in Knowledge Discovery and Data Mining - Volume Part I
Privacy preservation by disassociation
Proceedings of the VLDB Endowment
Enforcing subscription-based authorization policies in cloud scenarios
DBSec'12 Proceedings of the 26th Annual IFIP WG 11.3 conference on Data and Applications Security and Privacy
Supporting Security Requirements for Resource Management in Cloud Computing
CSE '12 Proceedings of the 2012 IEEE 15th International Conference on Computational Science and Engineering
| Hi-index | 0.00 |
Data fragmentation has been proposed as a solution for protecting the confidentiality of sensitive associations when publishing data at external servers. To enrich the utility of the published fragments, a recent approach has put forward the idea of complementing them with loose associations, a sanitized form of the sensitive associations broken by fragmentation. The original proposal considers fragmentations composed of two fragments only, and supports the definition of a loose association between this pair of fragments. In this paper, we extend loose associations to multiple fragments. We first illustrate how the publication of multiple loose associations between pairs of fragments of a generic fragmentation can potentially expose sensitive associations. We then describe an approach for supporting the more general case of publishing a loose association among an arbitrary set of fragments.