数据库支持程序的析取策略
Disjunctive Policies for Database-Backed Programs
AI总结:
本文研究数据库支持程序的析取安全策略,提出基于查询的 Determinacy Quantale 结构及类型分析机制,并在工具 DiVerT 中验证其可行性。
摘要:
在为数据库指定安全策略时,通常很自然地会表述析取依赖关系,即一条信息可能最多依赖于两个依赖关系 P1 或 P2 中的一个,但不能同时依赖两者。Hunt 和 Sands 最近引入了这种析取依赖关系的形式语义模型,即 Quantale of Information,作为 Lattice of Information 的推广。在本文中,我们旨在促进对数据库支持程序中析取依赖关系的理解,并引入一个实用框架来静态执行析取安全策略。为此,我们引入了 Determinacy Quantale,这是一种新的基于查询的结构,用于捕获数据库中析取信息的顺序。该结构可以理解为 Quantale of Information 的基于查询的对应物。基于该结构,我们设计了一个可靠的执行机制,用于检查数据库支持程序的析取策略。该机制基于对带有数据库查询的简单命令式语言的类型分析,其精度足以灵活适应各种行级和列级数据库策略,同时跟踪由控制流引起的析取。我们通过在工具 DiVerT 中实现该机制来验证其有效性,并在多个用例上展示了其可行性。
英文摘要:
When specifying security policies for databases, it is often natural to formulate disjunctive dependencies, where a piece of information may depend on at most one of two dependencies P1 or P2, but not both. A formal semantic model of such disjunctive dependencies, the Quantale of Information, was recently introduced by Hunt and Sands as a generalization of the Lattice of Information. In this paper, we seek to contribute to the understanding of disjunctive dependencies in database-backed programs and introduce a practical framework to statically enforce disjunctive security policies. To that end, we introduce the Determinacy Quantale, a new query-based structure which captures the ordering of disjunctive information in databases. This structure can be understood as a query-based counterpart to the Quantale of Information. Based on this structure, we design a sound enforcement mechanism to check disjunctive policies for database-backed programs. This mechanism is based on a type-based analysis for a simple imperative language with database queries, which is precise enough to accommodate a variety of row- and column-level database policies flexibly while keeping track of disjunctions due to control flow. We validate our mechanism by implementing it in a tool, DiVerT, and demonstrate its feasibility on a number of use cases.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。