安全隔离状态下的身份鉴别和细颗粒度访问控制

本文介绍了一种将网络安全隔离技术和PKI/PMI技术有效地结合的完善的授权访问安全体系,实现了安全隔离状态下进行身份验证和细颗粒度的访问控制,实现了系统的主动安全管理,大大提高的安全性、可控性,促进电子政务建设的健康发展。     

基于HBase的细粒度访问控制方法研究

为增强HBase的安全访问控制能力,提出一种针对HBase的细粒度访问控制方法。该方法通过修改优化HBase源码,扩展访问控制权限、重写访问控制器达到细粒度访问控制的目的。归纳出应用于HBase的RBAC模型,内建数据库角色以解决权限扩展后细粒度权限管理难度增大的问题。通过设计实验测试用例,验证了提出的细粒度访问控制方法能更全面地保护HBase数据,解决了原有方法带来的权限过粗的问题,降低了数据可能被恶意地执行修改、删除等操作所带来的巨大安全风险。     

RBAC中基于信任的细粒度访问控制研究

针对传统的角色访问控制模型权限控制粒度较大,提出一种基于信任的细粒度访问控制模型,该模型在RBAC基础上引入授权信任约束,采用了一种基于忠诚度的信任度计算方法,有效地遏制恶意行为,实现细粒度访问控制。该模型不仅具有RBAC模型的所有优点,而且比RBAC模型具有更好的通用性、灵活性和可扩展性。     

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

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

分布式应用访问控制策略精化冲突分析

随着云技术的发展,分布式应用平台朝着弹性资源和环境动态变迁的方向发展。分布式应用访问控制策略精化计算与资源和环境相关,也需要较强的性能与这种动态性相适应。现有的访问控制策略空间冲突分析方法虽然可以用于分布式访问控制策略精化中的策略冲突分析,但是该类算法以权限赋值单元为单位计算,计算粒度过细导致性能较低。提出了基于集合求交递推算法,以权限赋值单元集合为单位计算策略冲突来提高计算粒度。理论分析与实验结果表明该算法具有较高性能, 适用于云平台策略精化计算的高性能的需求。     

Performance analysis of three multi-radio access control policies in heterogeneous wireless networks

Access control policy in wireless networks has a significant impact on QoS satisfaction and resource utilization efficiency. The design of access control policy in heterogeneous wireless networks （HWNs） becomes more challenging especially for the heterogeneous multiple access protocols of each radio network. In this paper, a Markov model is proposed to analyze the performance of three access control policies for HWNs. The first policy is the optimal radio access technology （O-RAT） selection, where the incoming traffic always tries to access one network with the maximum service rate before admission. The second policy intends to allocate the same data to all networks. And the traffic will leave the system if it is accomplished first by one of these networks, which is formulated as the aggregated multi-radio access （A-MRA） technology. The third policy is named the parallel multi-radio access （P-MRA） transmission, in which the incoming traffic is split into different networks. The traffic is served with the sum of the service rates provided by overall networks. Numerical and simulate results show the effectiveness of our analytical framework and the performance gain of the three access control policies. As illustrated with some representative results, the P-MRA policy shows superior performance gain to the other two policies independent on the specific parameters of the different multiple access protocols due to the multiplexing gain.     

分布式访问控制

信息安全包括机密性、完整性和可用性,涉及到数据加密、访问控制等多个方面.其中访问控制模型从自主访问控制、强制访问控制发展到了基于角色的访问控制模型,提出了多种不同的框架,并对3种访问控制模型进行了比较和分析,指出了它们各自的优缺点,同时对分布式访问控制模型的研究现状进行了分析,并分别给出了自己的一些思想.     

基于RBAC的移动代理安全策略

移动代理是一种新兴的分布式计算模式,具有广泛的应用前景,安全问题是移动代理系统能否成功应用的关键。在分析移动代理系统存在的主要安全需求及基于角色访问控制特性的基础上,利用扩展的X．509公钥证书,提出了基于RBAc的移动代理安全访问策略,通过基于角色的授权实现了对代理服务器资源的访问控制,利用公钥认证协议实现了移动代理与代理服务器之间的安全认证,同时采用数据加密实现了信息的安全传输。     

网格环境下基于属性的访问控制策略合成研究*

为了满足网格环境下资源聚合对访问控制策略合成的需求,达到建立统一的安全策略的目的,提出了一种扩展的基于属性的访问控制（ABAC）策略合成代数来实现安全策略的合成,该合成在策略表达式中引入了环境属性,并结合了一种新的策略合成算子实现访问控制策略的合成。用一个具体的策略合成案例展示了策略的合成,说明策略合成方法有良好的语义表达能力、灵活性以及可扩展性。     

Accountable attribute-based authentication with fine-grained access control and its application to crowdsourcing

We introduce a new notion called accountable attribute-based authentication with fine-grained access control (AccABA), which achieves (i) fine-grained access control that prevents ineligible users from authenticating; (ii) anonymity such that no one can recognize the identity of a user; (iii) public accountability, i.e., as long as a user authenticates two different messages, the corresponding authentications will be easily identified and linked, and anyone can reveal the user’s identity without any help from a trusted third party. Then, we formalize the security requirements in terms of unforgeability, anonymity, linkability and traceability, and give a generic construction to fulfill these requirements. Based on AccABA, we further present the first attribute-based, fair, anonymous and publicly traceable crowdsourcing scheme on blockchain, which is designed to filter qualified workers to participate in tasks, and ensures the fairness of the competition between workers, and finally balances the tension between anonymity and accountability.     

一种基于UML模型的起源感知访问控制策略分析方法

起源(Provenance)是记录数据演变历史的元数据。最近研究者提出起源感知的访问控制,通过追溯和分析访问者或被访问对象的起源来决定允许或拒绝访问请求。由于起源通常由系统在运行时记录并呈现为复杂的有向图,识别、规约和管理起源感知的访问控制策略非常困难。为此,提出了一个基于UML模型的起源感知访问控制策略分析方法,包括对复杂起源图的抽象建模技术以及一个在面向对象的软件开发过程中系统地建立起源模型、规约起源感知访问控制策略的参考过程指南。最后结合企业在线培训系统案例说明如何应用所提出的方法。     

图书馆门禁管理系统中的光电通道控制技术的实现

本文通过对通道控制方法的介绍,并经过实际应用,提出能满足图书馆门禁管理系统中的通道控制技术的需要,并对通道控制中可能遇到的一些实际问题给出了一种可行的解决方法.     

一个通用的分布式访问控制决策中间件

将各种安全功能从上层应用中抽象出来形成一种通用和标准的安全服务,可以简化应用开发的复杂性和增强安全功能的可重用性。论文设计并实现了一个基于XACML的通用分布式访问控制决策中间件UDACD（Universal Distributed Access Control Decision）,对分布式环境下的访问控制决策过程进行了封装,对外面向各种应用提供通用的决策服务。UDACD支持多种访问控制策略类型和跨管理域的匿名资源访问控制;实现了对策略的缓存和对用户安全属性的两级缓存,显著加快了决策速度。UDACD可以帮助简化策略管理,并提供跨应用的一致策略实施。     

Automated policy generation for testing access control software

Access control systems (ACS) are a critical component of modern information technology systems and require rigorous testing. If the ACS has defects, then the deployment is not secure and is a threat to system security. Firewalls are an important example of an ACS, and formally verifying firewall systems has recently attracted attention. We present an automated software-testing tool, PG, for the production of firewall policies for use in firewall policy enforcement testing. PG utilizes a number of heuristic techniques to improve space coverage over traditional systems based on randomly generated firewall policies. An empirical study is presented demonstrating that PG generates firewall policies with superior coverage compared to traditional policy-generation techniques. The extension of PG beyond firewall systems to other ACS situations is outlined.     

基于模型检测的工作流访问控制策略验证*

访问控制策略的有效性对工作流管理系统的安全稳定运行具有重要影响,针对这一问题,提出了一种基于模型检测的工作流管理系统访问控制策略验证方法。建立了工作流管理系统的访问控制策略模型与工作流执行主体任务权限状态模型,并在此基础上对访问控制策略的有效性进行验证。实验表明该算法具有有效性和合理性,为访问控制策略的验证提供了一条新的解决途径。     

具有细粒度访问控制和低存储空间开销的云存储系统

针对目前公有云存储系统中存在的数据机密性和系统性能问题,提出了一个安全高效的方案,并将其应用于基于密文策略属性基加密(CP-ABE)的具有细粒度访问控制的密码学的云存储系统中。在这个方案中,原始的数据首先会经过一个(k,n)算法分割成小块,然后随机选择其中部分小块进行加密,最后发布到云上,且只保存一份副本。该方案能够提升用户撤销操作的性能和降低存储空间的开销,同时安全性分析也证明了这个系统在计算上是安全的。通过分析对比,实验结果表明:该方案优化了用户撤销,减少了数据拥有者对数据管理的时间,由于只需要保存一份数据副本,因此有效地减少了数据的存储空间。该方案实现了公有云存储中敏感数据的安全共享和高效存储。     

.NET下基于角色的访问控制的应用

以基于角色的访问控制模型(RBAC)为基础,在.NET环境下结合一个具体的实例来分析角色与用户权限之间的关系。根据具体的需求,对RBAC模型进行扩充,引入了对数据权限的控制,并且将不同角色归为两类,分别对粗权限和细权限加以控制。该文详细阐述了该模型的设计和实现。     

Consensus models: Computational complexity aspects in modern approaches to the list coloring problem

In the paper we study new approaches to the problem of list coloring of graphs. In the problem we are given a simple graph G=(V,E) and, for every v∈V, a nonempty set of integers S(v); we ask if there is a coloring c of G such that c(v)∈S(v) for every v∈V. Modern approaches, connected with applications, change the question—we now ask if S can be changed, using only some elementary transformations, to ensure that there is such a coloring and, if the answer is yes, what is the minimal number of changes. In the paper for studying the adding, the trading and the exchange models of list coloring, we use the following transformations:

•

adding of colors (the adding model): select two vertices u, v and a color c∈S(u); add c to S(v), i.e. set S(v):=S(v)∪{c};

•

trading of colors (the trading model): select two vertices u, v and a color c∈S(u); move c from S(u) to S(v), i.e. set S(u):=S(u)?{c} and S(v):=S(v)∪{c};

•

exchange of colors (the exchange model): select two vertices u, v and two colors c∈S(u), d∈S(v); exchange c with d, i.e. set S(u):=(S(u)?{c})∪{d} and S(v):=(S(v)?{d})∪{c}.

Our study focuses on computational complexity of the above models and their edge versions. We consider these problems on complete graphs, graphs with bounded cyclicity and partial k-trees, receiving in all cases polynomial algorithms or proofs of NP-hardness.     

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.