A sound and complete model-generation procedure for consistent and confidentiality-preserving databases

作者：Biskup Joachim; Wiese Lena^*

来源：Theoretical Computer Science, 2011, 412(31): 4044-4072.

DOI：10.1016/j.tcs.2011.04.026

• Confidentiality
• Privacy
• Availability
• Model generation
• Databases
• Weakly acyclic dependencies
• Denial constraints
• Herbrand's theorem
• Semantic trees

This article introduces and investigates a new model-theoretic mechanism to enforce confidentiality (or privacy) requirements in a database instance; at the same time it ensures maximum availability of correct database answers. The aim is to materialize and publish a secure view that satisfies the properties of "inference-proofness" and "distortion minimality". A comprehensive class of first-order constraints (representing a user's a priori knowledge and a confidentiality policy) can be handled by the presented algorithm in a sound and complete way: tuple-generating dependencies, denial constraints and existential constraints. The due proof of refutation soundness makes use of Herbrand's theorem and semantic trees.

• 出版日期2011-7-15