Vertical partitioning algorithms for database design
ACM Transactions on Database Systems (TODS)
Graph-Based Algorithms for Boolean Function Manipulation
IEEE Transactions on Computers
Vertical partitioning for database design: a graphical algorithm
SIGMOD '89 Proceedings of the 1989 ACM SIGMOD international conference on Management of data
Algorithms and Data Structures in VLSI Design
Algorithms and Data Structures in VLSI Design
Protecting Respondents' Identities in Microdata Release
IEEE Transactions on Knowledge and Data Engineering
A new algorithm for the maximum-weight clique problem
Nordic Journal of Computing
A fast algorithm for the maximum clique problem
Discrete Applied Mathematics - Sixth Twente Workshop on Graphs and Combinatorial Optimization
Providing Database as a Service
ICDE '02 Proceedings of the 18th International Conference on Data Engineering
Balancing confidentiality and efficiency in untrusted relational DBMSs
Proceedings of the 10th ACM conference on Computer and communications security
IEA/AIE'2004 Proceedings of the 17th international conference on Innovations in applied artificial intelligence
Reducing inference control to access control for normalized database schemas
Information Processing Letters
Privacy-Aware Biometrics: Design and Implementation of a Multimodal Verification System
ACSAC '08 Proceedings of the 2008 Annual Computer Security Applications Conference
Fragmentation Design for Efficient Query Execution over Sensitive Distributed Databases
ICDCS '09 Proceedings of the 2009 29th IEEE International Conference on Distributed Computing Systems
The Art of Computer Programming, Volume 4, Fascicle 1: Bitwise Tricks & Techniques; Binary Decision Diagrams
Combining Consistency and Confidentiality Requirements in First-Order Databases
ISC '09 Proceedings of the 12th International Conference on Information Security
Data protection in outsourcing scenarios: issues and directions
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)
Keep a few: outsourcing data while maintaining confidentiality
ESORICS'09 Proceedings of the 14th European conference on Research in computer security
Fast set bounds propagation using a BDD-SAT hybrid
Journal of Artificial Intelligence Research
Fragments and loose associations: respecting privacy in data publishing
Proceedings of the VLDB Endowment
Horizontal fragmentation for data outsourcing with formula-based confidentiality constraints
IWSEC'10 Proceedings of the 5th international conference on Advances in information and computer security
Theoretical Computer Science
Enforcing confidentiality and data visibility constraints: an OBDD approach
DBSec'11 Proceedings of the 25th annual IFIP WG 11.3 conference on Data and applications security and privacy
An index structure for private data outsourcing
DBSec'11 Proceedings of the 25th annual IFIP WG 11.3 conference on Data and applications security and privacy
On the inference-proofness of database fragmentation satisfying confidentiality constraints
ISC'11 Proceedings of the 14th international conference on Information security
Fragmentation and encryption to enforce privacy in data storage
ESORICS'07 Proceedings of the 12th European conference on Research in Computer Security
Enforcing confidentiality in relational databases by reducing inference control to access control
ISC'07 Proceedings of the 10th international conference on Information Security
| Hi-index | 0.00 |
With the growing needs for data sharing and dissemination, privacy-preserving data publishing is becoming an important issue that still requires further investigation. In this paper, we make a step towards private data publication by proposing a solution based on the release of vertical views fragments over a relational table that satisfy confidentiality and visibility constraints expressing requirements for information protection and release, respectively. We translate the problem of computing a fragmentation composed of the minimum number of fragments into the problem of computing a maximum weighted clique over a fragmentation graph. The fragmentation graph models fragments, efficiently computed using Ordered Binary Decision Diagrams OBDDs, that satisfy all the confidentiality constraints and a subset of the visibility constraints defined in the system. We then show an exact and a heuristic algorithm for computing a minimal and a locally minimal fragmentation, respectively. Finally, we provide experimental results comparing the execution time and the fragmentations returned by the exact and heuristic algorithms. The experiments show that the heuristic algorithm has low computation cost and computes a fragmentation close to optimum.