检索结果-内蒙古大学图书馆

11th acm symposium on access control models and technologies, SacmAT 2006

作者： Jin, Jing Ahn, Gail-Joon University of North Carolina Charlotte United States

ISBN: (纸本)1595933549

Under scientific collaborations, resource sharing tends to be highly dynamic and often ad hoc. the dynamic characteristics and sharing patterns of ad-hoc collaborative sharing impose a need for comprehensive and flexible approaches to reflect and cope with the unique access control requirements associated with the ad-hoc collaboration. In this paper, we propose a role-based access management framework to enable secure resource sharing, especially focusing on the digital information sharing in the heterogeneous scientific collaboration environments. Our framework incorporates role-based approach to address distributed access control, delegation and dissemination control involved in the resource sharing within such environments. A set of XacmL-based policy schemas is proposed to specify policies on our framework. To demonstrate the feasibility of our framework, we design and implement a proof-of-concept prototype system called ShareEnabler, which is based on a peer-to-peer information sharing toolkit developed by Lawrence Berkeley National Laboratory. Copyright 2006 acm.

关键词： Management information systems

来源：评论

学校读者我要写书评

暂无评论

Key management for non-tree access hierarchies 06

Key management for non-tree access hierarchies

引用

11th acm symposium on access control models and technologies, SacmAT 2006

作者： Atallah, Mikhail J. Blanton, Marina Frikken, Keith B. Department of Computer Science Purdue University United States

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

关键词： Security of data

来源：评论

学校读者我要写书评

暂无评论

Succinct representation of flexible and privacy-preserving access rights

引用

VLDB JOURNAL 2006年第4期15卷 334-354页

作者： Blanton, Marina Atallah, Mikhail Purdue Univ Dept Comp Sci W Lafayette IN 47907 USA

We explore the problem of portable and flexible privacy preserving access rights that permit access to a large collection of digital goods. Privacy-preserving access control means that the service provider can neither learn what access rights a customer has nor link a request to access an item to a particular customer, thus maintaining privacy of both customer activity and customer access rights. Flexible access rights allow a customer to choose a subset of items or groups of items from the repository, obtain access to and be charged only for the items selected. And portability of access rights means that the rights themselves can be stored on small devices of limited storage space and computational capabilities such as smartcards or sensors, and therefore the rights must be enforced using the limited resources available. In this paper, we present and compare two schemes that address the problem of such access rights. We show that much can be achieved if one allows for even a negligible amount of false positives - items that were not requested by the customer, but inadvertently were included in the customer access right representation due to constrained space resources. But minimizing false positives is one of many other desiderata that include protection against sharing of false positives information by unscrupulous users, providing the users with transaction untraceability and unlinkability, and forward compatibility of the scheme. Our first scheme does not place any constraints on the amount of space available on the limited-capacity storage device, and searches for the best representation that meets the requirements. the second scheme, on the other hand, has (modest) requirements on the storage space available, but guarantees a low rate of false positives: with O(mc) storage space available on the smartcard (where m is the number of items or groups of items included in the subscription and c is a selectable parameter), it achieves a rate of false positives of m(

关键词： compact representation privacy-preserving access rights flexible access rights

来源：评论

学校读者我要写书评

暂无评论

Quorum placement in networks: Minimizing network congestion

Quorum placement in networks: Minimizing network congestion

引用

25th Annual acm symposium on Principles of Distributed Computing 2006

作者： Golovin, Daniel Gupta, Anupam Maggs, Bruce M. Oprea, Florian Reiter, Michael K. Computer Science Department Carnegie Mellon University Pittsburgh PA United States Electrical and Computer Engineering Department Carnegie Mellon University Pittsburgh PA United States Akamai Technologies Cambridge MA United States

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.

关键词： Congestion control (communication)

来源：评论

学校读者我要写书评

暂无评论

Searchable symmetric encryption: Improved definitions and efficient constructions

Searchable symmetric encryption: Improved definitions and ef...

引用

CCS 2006: 13th acm Conference on Computer and Communications Security

作者： Curtmola, Reza Garay, Juan Kamara, Seny Ostrovsky, Rafail Department of Computer Science Johns Hopkins University Baltimore MD Bell Labs - Lucent Technologies Murray Hill NJ Department of Computer Science UCLA Los Angeles CA

Searchable symmetric encryption (SSE) allows a party to outsource the storage of its data to another party (a server) in a private manner, while maintaining the ability to selectively search over it. this problem has been the focus of active research in recent years. In this paper we show two solutions to SSE that simultaneously enjoy the following properties: Both solutions are more efficient than all previous constant-round schemes. In particular, the work performed by the server per returned document is constant as opposed to linear in the size of the data. Both solutions enjoy stronger security guarantees than previous constant-round schemes. In fact, we point out subtle but serious problems with previous notions of security for SSE, and show how to design constructions which avoid these pitfalls. Further, our second solution also achieves what we call adaptive SSE security, where queries to the server can be chosen adaptively (by the adversary) during the execution of the search;this notion is both important in practice and has not been previously ***, despite being more secure and more efficient, our SSE schemes are remarkably simple. We consider the simplicity of both solutions as an important step towards the deployment of SSE *** an additional contribution, we also consider multi-user SSE. All prior work on SSE studied the setting where only the owner of the data is capable of submitting search queries. We consider the natural extension where an arbitrary group of parties other than the owner can submit search queries. We formally define SSE in the multi-user setting, and present an efficient construction that achieves better performance than simply using access control mechanisms. Copyright 2006 acm.

关键词： Public key cryptography

来源：评论

学校读者我要写书评

暂无评论

SacmAT 2005: Proceedings of 10th acm symposium on access control models and technologies

SACMAT 2005: Proceedings of 10th ACM Symposium on Access Con...

引用

SacmAT 2005: Proceedings of 10th acm symposium on access control models and technologies

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 access control models, architectures, and technologies;supporting conditional delegation in secure workflow management systems;a fine-grained, controllable, user-to-user delegation method in RBAC;relevancy based access control of versioned XML documents;provable bounds for portable and flexible privacy-preserving access rights;verifiable composition of access control and application features;adaptive trust negotiation and access control;and role mining with ORCA.

关键词： control system analysis

来源：评论

学校读者我要写书评

暂无评论

Proceedings of acm symposium on access control models and technologies, SacmAT: Foreword

Proceedings of ACM Symposium on Access Control Models and Te...

引用

Proceedings of acm symposium on access control models and technologies, SacmAT 2005年 iii页

作者： Ferrari, Elena Ahn, Gail-Joon

No abstract available

关键词：

来源：评论

学校读者我要写书评

暂无评论

Future direction of access control models, architectures, and technologies 05

Future direction of access control models, architectures, an...

引用

SacmAT 2005: Proceedings of 10th acm symposium on access control models and technologies

作者： Beznosov, Konstantin University of British Columbia Canada

No abstract available

ISBN: (纸本)9781595930453

No abstract available

关键词： access control ARCHITECTURE Building construction

来源：评论

学校读者我要写书评

暂无评论

Verifiable composition of access control and application features 05

Verifiable composition of access control and application fea...

引用

SacmAT 2005: Proceedings of 10th acm symposium on access control models and technologies

作者： Song, Eunjee Reddy, Raghu France, Robert Ray, Indrakshi Georg, Geri Alexander, Roger Computer Science Dept. Colorado State University Fort Collins CO 80523

ISBN: (纸本)9781595930453

access control 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 access control concerns from other application design concerns. Using an AOM approach, access control 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 access control 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 access control 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.

关键词： control system analysis

来源：评论

学校读者我要写书评

暂无评论

Peer-to-peer access control architecture using trusted computing technology 05

Peer-to-peer access control architecture using trusted compu...

引用

SacmAT 2005: Proceedings of 10th acm symposium on access control models and technologies

作者： Sandhu, Ravi Zhang, Xinwen George Mason University

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 access control 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 access control models such as lattice-based access control, role-based access control, and usage control. Copyright 2005 acm.

关键词： control system analysis

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：