On Desing of Access Control for Database Systems

数据库系统访问控制的设计

基本信息

批准号：
07455163
负责人：
TSUJII Shigeo
金额：
$ 3.46万
依托单位：
Chuo University
依托单位国家：
日本
项目类别：
Grant-in-Aid for Scientific Research (B)
财政年份：
1995
资助国家：
日本
起止时间：
1995 至 1996
项目状态：
已结题

来源：
https://kaken.nii.ac.jp/grant/KAKENHI-PROJECT-07455163/
关键词：
data base access control information security 隠れチャンネル

项目摘要

To control the access right of users to data base systems concentrically is one of the approaches for solving to the problem. A systematic model for the approach is called the security model. Typical security models are a mandatory model of the Bell and LaPadula model (summarize BLP) and a discretionaly model using an access matrix. The BLP is defined security levels for information and users. An access right of users is controlled by comparing the security levels of the users and the information. Direction of the information flows are defined by the security levels.On the other haid, the discretionaly model using an access matrix an access matrix has an advantage to be able to look aroud information flows all over the users. But there is a problem that the indirect information flows are caused by writing any information to the other information, and consequently, confidentiality and integrity for the information are damaged. And if access right is changed, we have a further problem th … More at the access matrix which has been secure before changing access right is not secure. But reports of this type of research have apparently not been published to date.This research proposes a security model and reification method to detect the indirect information flows and to verify whether information is secure or not. For the security model proposed, a Hierarchical Time Petri Net (H-TPN), which is an extended not of the Hierarchical Petri Net, is defimed. The H-TPN is introduced time parameter and colored tokens in the Hierarchical Petri Net. The information flows in the access matrix are described by the paths on the H-TPN whose places describe users and information. The time parameter is defined in the transitions of the H-TPN.Colored tokens, which are divided into two types, are introduced to reduce complexity of toke'n propagation paths, The one type of the colored tokens describes information to be verified, the others describe information not to be verified. Operation rules between colored tokens are defined.In the proposed security model, we will show very interesting properties for the security with regard to the time. The properites are a condition to be secure till a certain time and a condition to be secure from a certain time to a certain future time. Less

要密集地控制用户对数据库系统的访问权，这是解决问题的方法之一。该方法的系统模型称为安全模型。典型的安全模型是使用访问矩阵的Bell和Lapadula模型（总结BLP）的强制模型（总结BLP）。 BLP定义为信息和用户的安全级别。通过比较用户的安全级别和信息来控制用户的访问权。信息流的方向由安全级别定义。在另一个HAID上，使用Access矩阵的离散模型Access矩阵具有优势，可以在整个用户中查看Aromad信息流。但是存在一个问题，即间接信息流是通过将任何信息写入其他信息引起的，因此，信息的机密性和完整性受到损害。而且，如果更改访问权限，我们将在访问矩阵上有更多问题……在更改访问权限之前已经安全的问题是不安全的。但是，迄今为止，有关此类研究的报告显然还没有发表。这项研究提出了一种安全模型和重新化方法，以检测间接信息流并验证信息是否安全。对于提出的安全模型，分层时间培养皿网（H-TPN）是不扩展的，而不是分层培养皿网的扩展。 H-TPN引入了时间参数，并在分层培养皿网中引入了彩色令牌。访问矩阵中的信息流由H-TPN上的路径描述，其位置描述了用户和信息。在H-tpn.olo的代币的过渡中定义了时间参数，该代币被引入两种类型，以降低Toke'n繁殖路径的复杂性，其中一种彩色令牌描述了要验证的信息，其他信息则描述了信息。定义了彩色令牌之间的操作规则。在提议的安全模型中，我们将在时间上显示非常有趣的属性。这些属性是一个条件，直到一定时间到一定时间到一定时间到未来的时间。较少的