基于知识依赖关系的查询安全评估，实现高效精确的隐私保护查询。
CQE under Epistemic Dependencies: Algorithms and Experiments (extended version)
- 用最优全局可公开原子集交集定义安全查询框架
- 对特定依赖类型和DL-Lite_R本体，在数据复杂度下达到AC^0
- 提出可落地的一阶重写算法，实验验证实际可行性
我们研究在本体上进行受控查询评估（CQE），其中信息披露受认知依赖（EDs）约束，这是一种近期提出的用于CQE框架的逻辑规则族。特别地，我们将EDs与最优全局可公开（GA）遮蔽器概念结合，即能被本体推导出且可安全披露的原子项最大集合。针对布尔型合取查询并集（BUCQs），我们以所有最优GA遮蔽器的交集为语义基础——该方法在其他情境中已被证明能提供强安全保证且计算行为良好。首先，我们刻画了该交集方法的安全性，并识别出一类保持安全的EDs（即完整EDs）。接着，对于某一子类EDs及DL-Lite_R本体，我们证明在此CQE语义下回答BUCQs具有数据复杂度下的AC^0性质，并给出一个详细的一阶重写算法。最后，我们在两种不同评估场景中报告实验结果，展示了该重写函数的实用性。
原文摘要 · Abstract (English)
We investigate Controlled Query Evaluation (CQE) over ontologies, where information disclosure is regulated by epistemic dependencies (EDs), a family of logical rules recently proposed for the CQE framework. In particular, we combine EDs with the notion of optimal GA censors, i.e. maximal sets of ground atoms that are entailed by the ontology and can be safely revealed. We focus on answering Boolean unions of conjunctive queries (BUCQs) with respect to the intersection of all optimal GA censors - an approach that has been shown in other contexts to ensure strong security guarantees with favorable computational behavior. First, we characterize the security of this intersection-based approach and identify a class of EDs (namely, full EDs) for which it remains safe. Then, for a subclass of EDs and for DL-Lite_R ontologies, we show that answering BUCQs in the above CQE semantics is in AC^0 in data complexity by presenting a suitable, detailed first-order rewriting algorithm. Finally, we report on experiments conducted in two different evaluation scenarios, showing the practical feasibility of our rewriting function.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品；中文卡片由大模型生成，请以原文为准。