Introduction to algorithms
A complete axiomatization for functional and multivalued dependencies in database relations
SIGMOD '77 Proceedings of the 1977 ACM SIGMOD international conference on Management of data
Controlling FD and MVD Inferences in Multilevel Relational Database Systems
IEEE Transactions on Knowledge and Data Engineering
Inference in MLS Database Systems
IEEE Transactions on Knowledge and Data Engineering
Secure Databases: Constraints, Inference Channels, and Monitoring Disclosures
IEEE Transactions on Knowledge and Data Engineering
VLDB '02 Proceedings of the 28th international conference on Very Large Data Bases
Limiting disclosure in hippocratic databases
VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30
Auditing compliance with a Hippocratic database
VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30
Detecting privacy violations in sensitive XML databases
SDM'05 Proceedings of the Second VDLB international conference on Secure Data Management
Malafide intension based detection of privacy violation in information system
ICISS'06 Proceedings of the Second international conference on Information Systems Security
PRINDA: Architecture and design of non-disclosure agreements in privacy policy framework
Data & Knowledge Engineering
Precomputation of privacy policy parameters for auditing SQL queries
Proceedings of the 2nd international conference on Ubiquitous information management and communication
A Unified Audit Expression Model for Auditing SQL Queries
Proceeedings of the 22nd annual IFIP WG 11.3 working conference on Data and Applications Security
Disclosure detection over data streams in database publishing
Proceedings of the 2011 Joint EDBT/ICDT Ph.D. Workshop
Malafide intension based detection of privacy violation in information system
ICISS'06 Proceedings of the Second international conference on Information Systems Security
| Hi-index | 0.00 |
When a privacy violation is detected the intension behind the violation is revealed. We refer to this as a malafide intension and the information revealed as the target. The target can be expressed using an SQL-like syntax. In sophisticated privacy attacks the target of the attack may not have been directly accessed but inferred from other pieces of information by exploiting functional dependencies present in the application domain. In this paper we present an efficient algorithm to rewrite the malafide intension query attributes which will return the minimal set of attribute from which the target can be derived. The attribute sets returned by algorithm can derive the target using functional dependencies (algorithm is sound) and furthermore if any minimal set can derive the target using functional dependencies then it will be returned by the algorithm (algorithm is complete).