The transmission of own and partly confidential data to another agent comes along with the risk of enabling the receiver to infer information he is not entitled to learn. We consider a specific countermeasure against unwanted inferences about associations between data values whose combination of attributes are declared to be sensitive. This countermeasure fragments a relation instance into attribute-disjoint and duplicate-preserving projections such that no sensitive attribute combination is contained in any projection. Unfortunately, the intended goal of inference-proofness will not always be accomplished. Inferences might be based on combinatorial reasoning, since duplicate-preservation implies that the frequencies of value associations in visible fragments equals those in the original relation instance. In addition, the receiver might exploit entailment reasoning about functional dependencies, numerical dependencies and tuple-generating dependencies, as presumably known from the underlying database schema. We investigate possible interferences of combinatorial reasoning and entailment reasoning and identify basic conditions for a fragmentation to violate inference-proofness. Moreover, we outline a comprehensive method to effectively check the inference-proofness of a given fragmentation and we experimentally evaluate the computational efficiency of a partial prototype implementation.

中文翻译：

---

检查属性不相交和重复保留碎片的推理证明

将自己的和部分机密的数据传输给另一个代理伴随着使接收者能够推断出他无权学习的信息的风险。我们考虑了一种特定的对策，以防止对属性组合被声明为敏感的数据值之间的关联进行不必要的推断。该对策将关系实例分割为属性不相交和重复保留的投影，这样任何投影中都不包含敏感的属性组合。不幸的是，推理证明的预期目标并不总是能够实现。推断可能基于组合推理，因为重复保留意味着可见片段中值关联的频率等于原始关系实例中的频率。此外，接收者可能会利用关于函数依赖、数值依赖和元组生成依赖的蕴涵推理，这可能是从底层数据库模式中得知的。我们调查了组合推理和蕴涵推理的可能干扰，并确定了碎片违反推理证明的基本条件。此外，我们概述了一种有效检查给定碎片的推理证明的综合方法，并通过实验评估了部分原型实现的计算效率。我们调查了组合推理和蕴涵推理的可能干扰，并确定了碎片违反推理证明的基本条件。此外，我们概述了一种有效检查给定碎片的推理证明的综合方法，并通过实验评估了部分原型实现的计算效率。我们调查了组合推理和蕴涵推理的可能干扰，并确定了碎片违反推理证明的基本条件。此外，我们概述了一种有效检查给定碎片的推理证明的综合方法，并通过实验评估了部分原型实现的计算效率。