access hierarchies are useful in many applications and are modeled as a set of access classes organized by a partial order. A user who obtains access to a class in such a hierarchy is entitled to access objects stored...
详细信息
ISBN:
(纸本)1595933549
access hierarchies are useful in many applications and are modeled as a set of access classes organized by a partial order. A user who obtains access to a class in such a hierarchy is entitled to access objects stored at that class, as well as objects stored at its descendant classes. Efficient schemes for this framework assign only one key to a class and use key derivation to permit access to descendant classes. Ideally, the key derivation uses simple primitives such as cryptographic hash computations and modular additions. A straightforward key derivation time is then linear in the length of the path between the user's class and the class of the object that the user wants to access. Recently, work presented in [2] has given an efficient solution that significantly lowers this key derivation time, while using only hash functions and modular additions. Two fast-key-derivation techniques in that paper were given for trees, achieving O(log log n) and O(1) key derivation times, respectively, where n is the number of access classes. The present paper presents efficient key derivation techniques for hierarchies that are not trees, using a scheme that is very different from the above-mentioned paper. The construction we give in the present paper is recursive and uses the one-dimensional case solution as its base. It makes a novel use of the notion of the dimension d of an access graph, and provides a solution through which no key derivation requires more than 2d+1 hash function computations, even for "unbalanced" hierarchies whose depth is linear in their number of access classes n. The significance of this result is strengthened by the fact that many access graphs have a low d value (e.g., trees correspond to the case d = 2). Our scheme has the desirable property (as did [2] for trees) that addition and deletion of edges and nodes in the access hierarchy can be "contained" in the node and do not result in modification of keys at other nodes (no wholesale re-keying as cha
A quorum system over a universe of logical elements is a collection of subsets (quorums) of elements, any two of which intersect. In numerous distributed algorithms, the elements of the universe reside on the nodes of...
详细信息
ISBN:
(纸本)1595933840
A quorum system over a universe of logical elements is a collection of subsets (quorums) of elements, any two of which intersect. In numerous distributed algorithms, the elements of the universe reside on the nodes of a physical network and the participating nodes access the system by contacting every element in some quorum, potentially causing the added network congestion induced by these quorum accesses to play a limiting factor in the performance of the algorithm. In this paper we initiate the study of algorithms to place universe elements on the nodes of a physical network so as to minimize the network congestion that results from quorum accesses, while also ensuring that no physical node is overloaded by access requests from clients. We consider two models, one in which communication routes can be chosen arbitrarily and one in which they are fixed in advance. We show that in either model, the optimal congestion (with respect to the load constraints) cannot be approximated to any factor (unless P=NP). However, we show that at most doubling the load on nodes allows us to achieve a congestion that is close to this optimal value. We also shed some light on the extent to which element migration can reduce congestion in this context. Copyright 2006 acm.
Conventional accesscontrol are suitable for regulating access to resources by known ***,these models have often found to be inadequate for open and decentralized multi-centric systems where the user population is dyn...
详细信息
ISBN:
(纸本)9781595933539
Conventional accesscontrol are suitable for regulating access to resources by known ***,these models have often found to be inadequate for open and decentralized multi-centric systems where the user population is dynamic and the identity of all users are not known in *** such systems, credential based accesscontrol has been proposed. Credential based systems achieve accesscontrol by implementing a binary notion of *** a user is trusted by virtue of successful evaluation of its credentials it is allowed access, otherwise not. However,such credential based models have also been found to be lacking because of certain inherent drawbacks with the notion of *** this work,we propose a trust based accesscontrol model called TrustBAC. It extends the conventional role based accesscontrol model with the notion of trust *** are assigned to trust levels instead of roles based on a number of factors like user credentials,user behavior history,user recommendation etc. Trust levels are assigned to roles which are assigned to permissions as in role based access *** TrustBAC model thus incorporates the advantages of both the role based accesscontrol model and credential based accesscontrolmodels.
In this paper we propose an accesscontrol model for the Resource Description Framework (RDF). We argue that existing accesscontrolmodels, like the ones developed for securing eXtensible Markup Language (XML) docume...
详细信息
ISBN:
(纸本)9781595933539
In this paper we propose an accesscontrol model for the Resource Description Framework (RDF). We argue that existing accesscontrolmodels, like the ones developed for securing eXtensible Markup Language (XML) documents, do not provide sufficient protection for RDF data. Our security model incorporates RDF and RDF Schema (RDFS) entailments. RDF protection objects are represented as RDF-patterns that are mapped to RDF and RDFS statements to determine their security requirements. We develop methods to assign security classification to entailed statements and to detect unauthorized inferences. We propose a two-level conflict resolution strategy. Simple conflict resolution addresses the problem when more than one pattern can be mapped to the same RDF statement, resulting in conflicting classification. Inference conflict resolution addresses inconsistencies that occur due to entailment.
The proceedings contain 19 papers. The topics discussed include: integrity constraints in trust management;declaration and enforcement of fine-grained access restrictions for a service-based geospatial data infrastruc...
详细信息
The proceedings contain 19 papers. The topics discussed include: integrity constraints in trust management;declaration and enforcement of fine-grained access restrictions for a service-based geospatial data infrastructure;future direction of accesscontrolmodels, architectures, and technologies;supporting conditional delegation in secure workflow management systems;a fine-grained, controllable, user-to-user delegation method in RBAC;relevancy based accesscontrol of versioned XML documents;provable bounds for portable and flexible privacy-preserving access rights;verifiable composition of accesscontrol and application features;adaptive trust negotiation and accesscontrol;and role mining with ORCA.
In recent years, trust negotiation (TN) has been proposed as a novel accesscontrol solution for use in open system environments in which resources are shared across organizational boundaries. Researchers have shown t...
详细信息
ISBN:
(纸本)9781595933539
In recent years, trust negotiation (TN) has been proposed as a novel accesscontrol solution for use in open system environments in which resources are shared across organizational boundaries. Researchers have shown that TN is indeed a viable solution for these environments by developing a number of policy languages and strategies for TN which have desirable theoretical properties. Further, existing protocols, such as TLS, have been altered to interact with prototype TN systems, thereby illustrating the utility of TN. Unfortunately, modifying existing protocols is often a time-consuming and bureaucratic process which can hinder the adoption of this promising *** this paper, we present Traust, a third-party authorization service that leverages the strengths of existing proto-type TN systems. Traust acts as an authorization broker that issues access tokens for resources in an open system after entities use TN to satisfy the appropriate resource access policies. The Traust architecture was designed to allow Traust to be integrated either directly with newer trust-aware applications or indirectly with existing legacy applications; this exibility paves the way for the incremental adoption of TN technologies without requiring widespread software or protocol upgrades. We discuss the design and implementation of Traust, the communication protocol used by the Traust system, and its performance. We also discuss our experiences using Traust to broker access to legacy resources, our proposal for a Traust-aware version of the GridFTP protocol, and Traust's resilience to attack.
accesscontrol features are often spread across and tangled with other functionality in a design. This makes modifying and replacing these features in a design difficult. Aspect-oriented modeling (AOM) techniques can ...
详细信息
ISBN:
(纸本)9781595930453
accesscontrol features are often spread across and tangled with other functionality in a design. This makes modifying and replacing these features in a design difficult. Aspect-oriented modeling (AOM) techniques can be used to support separation of accesscontrol concerns from other application design concerns. Using an AOM approach, accesscontrol features are described by aspect models and other application features are described by a primary model. Composition of aspect and primary models yields a design model in which accesscontrol features are integrated with other application features. In this paper, we present, through an example, an AOM approach that supports verifiable composition of behaviors described in accesscontrol aspect models and primary models. Given an aspect model, a primary model, and a specified property, the composition technique produces proof obligations as the behavioral descriptions in the aspect and primary models are composed. One has to discharge the proof obligations to establish that the composed model has the specified property. Copyright 2005 acm.
It has been recognized for some lime that software alone does not provide an adequate foundation for building a high-assurance trusted platform. The emergence of industry-standard trusted computing technologies promis...
详细信息
ISBN:
(纸本)9781595930453
It has been recognized for some lime that software alone does not provide an adequate foundation for building a high-assurance trusted platform. The emergence of industry-standard trusted computing technologies promises a revolution in this respect by providing roots of trust upon which secure applications can be developed. These technologies offer a particularly attractive platform for security in peer-to-peer environments. In this paper we propose a trusted computing architecture to enforce accesscontrol policies in such applications. Our architecture is based on an abstract layer of trusted hardware which can be constructed with emerging trusted computing technologies. A trusted reference monitor (TRM) is introduced beyond the trusted hardware. By monitoring and verifying the integrity and properties of running applications in a platform using the functions of trusted computing, the TRM can enforce various policies on behalf of object owners. We further extend this platform-based architecture to support user-based control policies, cooperating with existing services for user identity and attributes. This architecture and its refinements can be extended in future work to support general accesscontrolmodels such as lattice-based accesscontrol, role-based accesscontrol, and usage control. Copyright 2005 acm.
暂无评论