基于上下文相关属性的主动访问控制的安全逻辑模式及分解算法
Secure Logical Schema and Decomposition Algorithm for Proactive Context Dependent Attribute Based Access Control
摘要:
传统的数据库访问控制机制采用基于角色的方法,一般采用基于行和基于属性的粒度约束,隐私主要通过视图来实现。但是,如果只有一组符合策略的视图可供用户访问,则应针对整个可能的查询历史记录对照策略检查该组视图。这项工作的目的是根据基于属性的策略规则定义一个主动分解算法,并建立一个安全的逻辑模式,其中关系被分解成几个,以抑制连接或推理,可能违反预定义的隐私约束。将不应被推断出关联的属性定义为它们之间具有安全依赖关系,并将它们组成一种新的基于上下文依赖属性的策略规则,称为安全依赖集。分解算法的工作原理与给定的安全依赖集的逻辑模式,并旨在禁止这些集合的元素之间的关联的推断。它也被证明,分解技术产生一个安全的逻辑模式,是在给定的安全依赖集约束。
英文摘要:
Traditional database access control mechanisms use role based methods, with generally row based and attribute based constraints for granularity, and privacy is achieved mainly by using views. However if only a set of views according to policy are made accessible to users, then this set should be checked against the policy for the whole probable query history. The aim of this work is to define a proactive decomposition algorithm according to the attribute based policy rules and build a secure logical schema in which relations are decomposed into several ones in order to inhibit joins or inferences that may violate predefined privacy constraints. The attributes whose association should not be inferred, are defined as having security dependency among them and they form a new kind of context dependent attribute based policy rule named as security dependent set. The decomposition algorithm works on a logical schema with given security dependent sets and aims to prohibit the inference of the association among the elements of these sets. It is also proven that the decomposition technique generates a secure logical schema that is in compliance with the given security dependent set constraints.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。