访问权限实时更新的模型与实现

为了保证在动态环境下信息系统的安全性，需要一个良好的访问控制模型，对访问控制策略的实时变化立即作出反映，并采取必要的措施。描述了一种支持访问权限实时更新的访问控制模型和实现，并进行了并发性分析。在这种模型中，访问权限实时更新的并发控制算法简单且易于实现。在并发环境中，多个主体读写数据和修改访问控制策略并互相影响时，可直接应用该模型与算法。     

基于区块链和策略分级的访问控制模型

为应对当前访问控制动态变化、策略合约安全性以及策略检索效率的需求,以属性访问控制模型(ABAC)为基础,提出一种基于区块链和策略分级访问控制模型BP-ABAC。结合ABAC和区块链技术,使访问控制策略通过智能合约的方式储存在区块链,合约中对访问控制策略进行策略分级;用户根据等级评估获得相应策略集的访问权限;当请求属性和策略集中的策略相匹配时,获得访问资源权限。实验结果表明,该模型实现了对不同用户访问权限控制和提高访问控制的效率与灵活性,加强了访问控制策略的安全性和隐私性。     

基于角色的Web服务的授权与访问控制

提出了一个授权与访问控制系统的设计,它以PMI为基本架构,分为授权服务和访问控制两个子系统.权限管理子系统通过各种模块制定全局所需的各种策略,由AA/SOA签发各种策略属性证书;管理员通过注册服务器ARA,为用户分配权限,向AA申请签发用户的属性证书.在访问控制子系统中,策略决策实施点(AEF)截获用户的访问请求及用户身份并发送给访问控制决策点中的ADF,ADF根据权限管理子系统制定好的策略和用户的属性证书计算出用户被授予的访问权限,作出"允许/拒绝"的决策.这样就实现了对Web资源的授权与访问控制,保证了后端Web服务器上共享数据的安全.     

基于角色的Web服务的授权与访问控制

提出了一个授权与访问控制系统的设计，它以PMI为基本架构，分为授权服务和访问控制两个子系统，权限管理子系统通过各种模块制定全局所需的各种策略，由AA／SOA签发各种策略属性证书；管理员通过注册服务器ARA，为用户分配权限，向AA申清签发用户的属性证书．在访问控制子系统中，策略决策实施点(AEF)截获用户的访问请求及用户身份并发送给访问控制决策点中的ADF，ADF根据权限管理子系统制定好的策略和用户的属性证书计算出用户被授予的访问权限，作出“允许／拒绝”的决策。这样就实现了对Web资源的授权与访问控制，保证了后端Web服务器上共享数据的安全。     

基于环境属性的访问控制系统设计与实现

目前研究的访问控制机制大多将访问策略与主客体相关联,访问权限相对固定,但在实际应用中,访问控制权限需要根据服务环境变化而实时调整。为此,构建一种基于环境属性的访问控制模型,在Linux系统下设计并实现基于该模型的访问控制系统。在访问控制的判定过程中增加环境属性因素,实现根据环境属性动态调整访问控制权限。测试结果表明,该模型对系统开销少,不会降低Linux平台的正常运行效率,能有效提升系统的安全性和可用性。     

XML数据模式下基于purpose的隐私访问控制策略研究与实现

提出构建基于purpose的对XML数据模式的隐私访问控制策略模型,解决由路径传递引起的查询隐私数据泄漏问题。基于purpose的隐私访问控制策略是一棵最小安全访问树模型。最小安全访问树是一组无冗余路径的以XPath{/,//,[]}片段表示的路径表达式,XPath{/,//,[]}是一组允许访问的隐私结点路径。实验表明最小安全树生成时间取决于隐私结点在一个XML文档中的标注时间和冗余路径的判别时间,而隐私结点的标注时间与隐私数据在XML文档中的分布位置有关。最小安全访问树模型能控制隐私数据的查询泄漏。     

具有特征判断能力的使用控制模型研究

传统访问控制的研究重点是授权策略,关注的是如何为主体分配权限以及如何限制主体使用分配得到的权限.目前绝大多数访问控制策略仍无法识别与控制具有访问权限的非法用户.在分析传统访问控制策略不足的基础上,提出了一种基于UCON的具有访问特征判断能力的使用控制模型--C_UCON.该模型通过在UCON的基础上引入既定义务、待定义务、即定条件、待定条件以及特征和激活规则来对访问进行主观判断,从而降低或者排除具有访问权限的非法用户所带来的安全威胁.     

预算管理信息系统访问控制策略的研究与设计

针对预算管理的特点,讨论了一种在预算管理信息系统中的角色、权限的表示法,并据此给出了一个预算管理信息系统的访问控制策略。将权限分为功能模块访问权限和数据访问权限,将角色分为系统角色和自定义角色,并将功能模块访问权限与系统角色关联,将数据访问权限与自定义角色关联,简化了访问控制机构的实现,提高了访问控制机构的工作效率。     

基于双数组有限状态机的URL访问控制算法

业务选择网关（SSG）中的访问控制模块从用户请求数据包中解析出URL,并且根据用户的URL访问权限进行访问控制和路由选择。首先提出了改进的有限状态机模型,然后用双数组表示该有限状态机,并提出了优先处理分支结点较多的结点的优化策略。实验证明该算法不仅提高了查询速度,而且占用的存储空间也较少,进一步减少了数据的稀疏。最后将该算法应用在访问控制模块上,实践证明此算法可行、高效。     

基于T-RBAC的PMI模型

在工作流系统应用中,权限管理基础设施(PMI)模型存在数据冗余、动态适应性差的缺陷。针对该问题,提出一个基于任务-角色的访问控制的PMI模型。该模型通过增加任务规范角色证书与任务分配属性证书、PMI任务管理器与策略库,将访问权限与任务关联。应用结果证明该模型能够对访问控制进行动态、灵活的管理,实现基于角色、任务、角色和任务这3种访问控制,为企业信息安全管理提供保障。     

Applying semantic knowledge to real-time update of access control policies

Real-time update of access control policies, that is, updating policies while they are in effect and enforcing the changes immediately, is necessary for many security-critical applications. In this paper, we consider real-time update of access control policies in a database system. Updating policies while they are in effect can lead to potential security problems, such as, access to database objects by unauthorized users. In this paper, we propose several algorithms that not only prevent such security breaches but also ensure the correctness of execution. The algorithms differ from each other in the degree of concurrency provided and the semantic knowledge used. Of the algorithms presented, the most concurrency is achieved when transactions are decomposed into atomic steps. Once transactions are decomposed, the atomicity, consistency, and isolation properties no longer hold. Since the traditional transaction processing model can no longer be used to ensure the correctness of the execution, we use an alternate semantic-based transaction processing model. To ensure correct behavior, our model requires an application to satisfy a set of necessary properties, namely, semantic atomicity, consistent execution, sensitive transaction isolation, and policy-compliant. We show how one can verify an application statically to check for the existence of these properties.     

Real-time update of access control policies

Access control policies are security policies that govern access to resources. The need for real-time update of such policies while they are in effect and enforcing the changes immediately, arise in many scenarios. Consider, for example, a military environment responding to an international crisis, such as a war. In such situations, countries change strategies necessitating a change of policies. Moreover, the changes to policies must take place in real-time while the policies are in effect. In this paper we address the problem of real-time update of access control policies in the context of a database system. Access control policies, governing access to the data objects, are specified in the form of policy objects. The data objects and policy objects are accessed and modified through transactions. We consider an environment in which different kinds of transactions execute concurrently some of which may be policy update transactions. We propose algorithms for the concurrent and real-time update of security policies. The algorithms differ on the basis of the concurrency provided and the semantic knowledge used.     

An enhanced concurrency control scheme for multidimensional index structures

We propose an enhanced concurrency control algorithm that maximizes the concurrency of multidimensional index structures. The factors that deteriorate the concurrency of index structures are node splits and minimum bounding region (MBR) updates in multidimensional index structures. The properties of our concurrency control algorithm are as follows: First, to increase the concurrency by avoiding lock coupling during MBR updates, we propose the PLC (partial lock coupling) technique. Second, a new MBR update method is proposed. It allows searchers to access nodes where MBR updates are being performed. Finally, our algorithm holds exclusive latches not during whole split time but only during physical node split time that occupies the small part of a whole split process. For performance evaluation, we implement the proposed concurrency control algorithm and one of the existing link technique-based algorithms on MIDAS-III that is a storage system of a BADA-IV DBMS. We show through various experiments that our proposed algorithm outperforms the existing algorithm in terms of throughput and response time. Also, we propose a recovery protocol for our proposed concurrency control algorithm. The recovery protocol is designed to assure high concurrency and fast recovery.     

Building access control policy model for privacy preserving and testing policy conflicting problems

This paper proposes a purpose-based access control model in distributed computing environment for privacy preserving policies and mechanisms, and describes algorithms for policy conflicting problems. The mechanism enforces access policy to data containing personally identifiable information. The key component is purpose involved access control models for expressing highly complex privacy-related policies with various features. A policy refers to an access right that a subject can have on an object, based on attribute predicates, obligation actions, and system conditions. Policy conflicting problems may arise when new access policies are generated that are possible to be conflicted to existing policies. As a result of the policy conflicts, private information cannot be well protected. The structure of purpose involved access control policy is studied, and efficient conflict-checking algorithms are developed and implemented. Finally a discussion of our work in comparison with other related work such as EPAL is presented.     

Maintaining temporal consistency: pessimistic vs. optimisticconcurrency control

We study the performance of concurrency control algorithms in maintaining temporal consistency of shared data in hard real time systems. In our model, a hard real time system consists of periodic tasks which are either write only, read only or update transactions. Transactions may share data. Data objects are temporally inconsistent when their ages and dispersions are greater than the absolute and relative thresholds allowed by the application. Real time transactions must read temporally consistent data in order to deliver correct results. Based on this model, we have evaluated the performance of two well known classes of concurrency control algorithms that handle multiversion data: the two phase locking and the optimistic algorithms, as well as the rate monotonic and earliest deadline first scheduling algorithms. The effects of using the priority inheritance and stack based protocols with lock based concurrency control are also studied     

概念格的快速渐进式构造算法

概念格作为形式概念分析理论中的核心数据结构，已经在知识工程和软件工程等领域得到了广泛的应用。概念格的快速构造在其应用过程中具有重要的意义，研究人员已经提出了一系列构造概念格的算法，其中渐进式算法是很有前途的一类。该文通过对概念格渐进式构造过程的分析，识别出要解决的基本问题，提出了采用树结构对概念格节点进行组织，研究了基于这种树状组织的概念格快速渐进式算法，并给出了算法的伪码。概念格节点的树结构组织有利于识别出格节点的类型以及约束新生格节点的父节点和子节点的搜索范围，从而可以有效地减少算法的执行时间。实验结果表明，基于这种树状索引的渐进式构造算法的时间性能要明确优于著名的Godin算法。     

A Causal Model for Analyzing Distributed Concurrency Control Algorithms

An event order based model for specifying and analyzing concurrency control algorithms for distributed database systems has been presented. An expanded notion of history that includes the database access events as well as synchronization events is used to study the correctness, degree of concurrency, and other aspects of the algorithms such as deadlocks and reliability. The algorithms are mapped into serializable classes that have been defined based on the order of synchronization events such as lock points, commit point, arrival of a transaction, etc,.     

基于二元关系消减的概念格维护算法

针对有限空间下如何快速维护概念格的问题,提出一种消减形式背景中冗余二元关系的概念格维护算法。传统的算法删除冗余关系后需要重新构造概念格,这种方式较为费时。而所提算法能够在原始概念格的基础上直接调整得到新概念格的方法,可以处理任意位置的二元关系消减的情况。它采用自底向上广度优先方式遍历格节点,首先根据当前节点是否同时包含冗余关系对象和冗余关系属性,将当前节点分为受影响的节点和不变节点;然后根据当前节点与父子节点的外延和内涵的关系,再将受影响的节点细分为4类,即减对象节点、减属性节点、分割节点、删除节点;最后根据父子节点的类型更新边。实验结果表明,在一定程度上与传统算法相比,所提算法能够获得更好的时间性能。     

考虑工程图形协同应用特点的并发控制研究

并发控制是CSCW系统的关键技术，没有统一标准，通常要根据协同应用的特点来构造。文中以CAD系统内部数据库拓扑结构的一致性作为显示一致性的基础，适时放宽整体一致性模型中的事件定义条件和一致性判定条件，提出一种改进的整体一致性模型。按照该模型的事件关系定义，通过图形对象全局ID标识的一致性维护和添加操作的相关性分析，提出一种添加操作优先的并发控制策略。基于上述模型和策略，研究了一种偏复制式混合体系结构下的悲观和有限乐观的并发控制方法，以及相应的并发控制协议实施技术。工程实践证明，这些并发控制模型、策略、方法和技术充分考虑了工程图形数据结构及其协同应用特点，从而有效地支持设计过程中的人人交互。