accesscontrolmodels are usually static, i.e., permissions are granted based on a policy that only changes seldom. Especially for scenarios in health care and disaster management, a more flexible support of access co...
详细信息
ISBN:
(纸本)9781605585376
accesscontrolmodels are usually static, i.e., permissions are granted based on a policy that only changes seldom. Especially for scenarios in health care and disaster management, a more flexible support of accesscontrol, L e., the underlying policy, is needed. Break-glass is one approach for such a flexible support of policies which helps to prevent system stagnation that could harm lives or otherwise result in losses. Today, break-glass techniques axe usually added on top of standard accesscontrol solutions in an ad-hoc manner and, therefore, lack an integration into the underlying accesscontrol paradigm and the systems' accesscontrol enforcement architecture. We present an approach for integrating, in a fine-grained manner, break-glass strategies into standard accesscontrolmodels and their accompanying enforcement architecture. this integration provides means for specifying break-glass policies precisely and supporting model-driven development techniques based on such policies.
We address the distributed setting for enforcement of a centralized Role-Based accesscontrol (RBAC) protection state. We present a new approach for time- and space-efficient access enforcement. Underlying our approac...
详细信息
ISBN:
(纸本)9781605585376
We address the distributed setting for enforcement of a centralized Role-Based accesscontrol (RBAC) protection state. We present a new approach for time- and space-efficient access enforcement. Underlying our approach is a data structure that we call a cascade Bloom filter. We describe our approach, provide details about the cascade Bloom filter, its associated algorithms, soundness and completeness properties for those algorithms, and provide an empirical validation for distributed access enforcement of RBAC. We demonstrate that even in low-capability devices such as WiFi network access points, we can perform thousands of access checks in a second.
the existence of on-line social networks that include person specific information creates interesting opportunities for various applications ranging from marketing to community organization. On the other hand, securit...
详细信息
ISBN:
(纸本)9781605585376
the existence of on-line social networks that include person specific information creates interesting opportunities for various applications ranging from marketing to community organization. On the other hand, security and privacy concerns need to be addressed for creating such applications. Improving social network accesscontrol systems appears as the first step toward addressing the existing security and privacy concerns related to on-line social networks. To address some of the current limitations, we propose an extensible fine grained accesscontrol model based on semantic web tools. In addition, we propose authorization, admin and filtering policies that depend on trust relationships among various users, and are modeled using OWL and SWRL. Besides describing the model, we present the architecture of the framework in its support.
Collaborative and distributed applications, such as dynamic coalitions and virtualized grid computing, often require integrating accesscontrol policies of collaborating parties. Such an integration must be able to su...
详细信息
ISBN:
(纸本)9781605585376
Collaborative and distributed applications, such as dynamic coalitions and virtualized grid computing, often require integrating accesscontrol policies of collaborating parties. Such an integration must be able to support complex authorization specifications and the fine-grained integration requirements that the various parties may have. In this paper, we introduce an algebra for fine-grained integration of sophisticated policies. the algebra, which consists of three binary and two unary operations, is able to support the specification of a large variety of integration constraints. To assess the expressive power of our algebra, we introduce a notion of completeness and prove that our algebra is complete with respect to this notion. We then propose a framework that uses the algebra for the fine-grained integration of policies expressed in XacmL. We also present a methodology for generating the actual integrated XacmL policy, based on the notion of Multi-Terminal Binary Decision Diagrams.
the User Authorization Query (UAQ) Problem for RBAC, introduced by Zhang and Joshi [9], is to determine the set of roles to be activated in a single session for a particular set of permissions requested by the user. T...
详细信息
ISBN:
(纸本)9781605585376
the User Authorization Query (UAQ) Problem for RBAC, introduced by Zhang and Joshi [9], is to determine the set of roles to be activated in a single session for a particular set of permissions requested by the user. this set of roles must satisfy constraints that prevent certain combinations of roles to be activated in one session, and should follow the least privilege principle. We show that the existing approach to the UAQ problem is inadequate, and propose two approaches for solving the UAQ problem. In the first approach, we develop algorithms that use the backtracking-based search techniques developed in the artificial intelligence community. In the second approach, we reduce the problem to the MAXSAT problem which can be solved using available SAT solvers. We have implemented both approaches and experimentally evaluated them.
Publish-subscribe (pub-sub) systems are useful for many applications, including pervasive environments. In the latter context, however, great care must be taken to preserve the privacy of sensitive information, such a...
详细信息
ISBN:
(纸本)9781605585376
Publish-subscribe (pub-sub) systems are useful for many applications, including pervasive environments. In the latter context, however, great care must be taken to preserve the privacy of sensitive information, such as users' location and activities. Traditional accesscontrol schemes provide at best a partial solution, since they do not capture potential inference regarding sensitive data that a subscriber may make. We propose a logic-based pub-sub system, where inference rules are used to both derive high-level events for use in applications as well as specify potentially harmful inferences that could be made regarding data. We provide a formal definition of safety in such a system that captures the possibility of indirect information flows. We show that the safety problem is co-NP-complete;however, problems of realistic size can be reduced to a satisfiability problem that can be efficiently decided by a SAT solver.
Securing access to files is an important and growing concern in corporate environments. Employees are increasingly accessing files from untrusted devices, including personal home computers and mobile devices, such as ...
详细信息
ISBN:
(纸本)9781605585376
Securing access to files is an important and growing concern in corporate environments. Employees are increasingly accessing files from untrusted devices, including personal home computers and mobile devices, such as smart phones, which are not under the control of the corporation, and may be infected with viruses, worms, and other malware. In such cases, it is crucial to protect the confidentiality and integrity of corporate data from malicious accesses. this paper proposes a novel scheme called Working Set-Based accesscontrol (WSBAC) to restrict network file system accesses from untrusted devices. the key idea is to continuously observe and extract working sets for users when they access files from trusted devices and use the working sets to restrict user file accesses from untrusted devices. this paper reports on the design and implementation of tools to automatically extract working sets, and transparently enforce WSBAC without requiring changes to the file system. Our experiments with realistic network file system traces lead us to conclude that WSBAC offers a flexible yet secure way to restrict access from untrusted devices, and that the runtime overheads of WSBAC enforcement are negligible.
Traditional accesscontrolmodels, such as Role-Based accesscontrol (RBAC), do not take into account contextual information, such as location and time, for making access decisions. Consequently, they are inadequate f...
详细信息
ISBN:
(纸本)9781605585376
Traditional accesscontrolmodels, such as Role-Based accesscontrol (RBAC), do not take into account contextual information, such as location and time, for making access decisions. Consequently, they are inadequate for specifying the accesscontrol needs of many complex real-world applications, such as the Dengue Decision Support (DDS) that we discuss in this paper. We need to ensure that such applications are adequately protected using emerging accesscontrolmodels. this requires us to represent the application and its accesscontrol requirements in a formal specification language. We choose the Unified Modeling Language (UML) for this purpose, since UML is becoming the defacto specification language in the software industry. We need to analyze this formal specification to get assurance that the application is adequately protected. Manual analysis is error-prone and tedious. thus, we need automated tools for verification of UML models. Towards this end, we propose that the UML models be converted to Alloy. Alloy is based on first-order logic, has a software infrastructure that supports automated analysis, and has been used for the verification of real-world applications. We show how to convert the UML models to Alloy and verify the resulting model using the Alloy Analyzer which has embedded SAT-solvers. the results from the Alloy Analyzer will help uncover the flaws in the specification and help us refine the application and its accesscontrol requirements.
Role based accesscontrol (RBAC) is a widely used accesscontrol paradigm. In large organizations, the RBAC policy is managed by multiple administrators. An administrative role based accesscontrol (ARBAC) policy spec...
详细信息
ISBN:
(纸本)9781605585376
Role based accesscontrol (RBAC) is a widely used accesscontrol paradigm. In large organizations, the RBAC policy is managed by multiple administrators. An administrative role based accesscontrol (ARBAC) policy specifies how each administrator may change the RBAC policy. It is often difficult to fully understand the effect of an ARBAC policy by simple inspection, because sequences of changes by different administrators may interact in unexpected ways. ARBAC policy analysis algorithms can help by answering questions, such as user-role reachability, which asks whether a given user can be assigned to given roles by given administrators. Allowing roles and permissions to have parameters significantly enhances the scalability, flexibility, and expressiveness of ARBAC policies. this paper defines PARBAC, which extends the classic ARBAC97 model to support parameters, and presents an analysis algorithm for PARBAC. To the best of our knowledge, this is the first analysis algorithm specifically for parameterized ARBAC policies. We evaluate its efficiency by analyzing its parameterized complexity and benchmarking it on case studies and synthetic policies.
Many accesscontrol policy languages, e.g., XacmL, allow a policy to contain multiple sub-policies, and the result of the policy on a request is determined by combining the results of the sub-policies according to som...
详细信息
ISBN:
(纸本)9781605585376
Many accesscontrol policy languages, e.g., XacmL, allow a policy to contain multiple sub-policies, and the result of the policy on a request is determined by combining the results of the sub-policies according to some policy combining algorithms (PCAs). Existing accesscontrol policy languages, however, do not provide a formal language for specifying PCAs. As a result, it is difficult to extend them with new PCAs. While several formal policy combining algebras have been proposed, they did not address important practical issues such as policy evaluation errors and obligations;furthermore, they cannot express PCAs that consider all sub-policies as a whole (e.g., weak majority or strong majority). We propose a policy combining language PCL, which can succinctly and precisely express a variety of PCAs. PCL represents an advancement both in terms of theory and practice. It is based on automata theory and linear constraints, and is more expressive than existing approaches. We have implemented PCL and integrated it with SUN's XacmL implementation. With PCL, a policy evaluation engine only needs to understand PCL to evaluate any PCA specified in it.
暂无评论