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

13th acm symposium on access control models and technologies

作者： Ene, Alina Rao, Prasad Horne, William Schreiber, Robert Milosavljevic, Nikola Tarjan, Robert E. Princeton Univ Dept Comp Sci Princeton NJ 08540 USA

ISBN: (纸本)9781605581293

We describe several new bottom-up approaches to problems in role engineering for Role-Based access control (RBAC). the salient problems are all NP-complete, even to approximate, yet we find that in instances that arise in practice these problems can be solved in minutes. We first consider role minimization, the process of finding a smallest collection of roles that can be used to implement a pre-existing user-to-permission relation. We introduce fast graph reductions that allow recovery of the solution from the solution to a problem on a smaller input graph. For Our test cases, these reductions either solve the problem, or reduce the problem enough that we find the optimum solution with a (worst-case) exponential method. We introduce lower bounds that are sharp for seven of nine test cases and are within 3.4% oil the other two. We introduce and test a new polynormial-time approximation that on average yields 2% more roles than the optimum. We next consider the related problem of minimizing the number of connections between roles and users or permissions, and we develop effective heuristic methods for this problem as well. Finally, we propose methods for several related problems.

关键词： Role mining role-based access control

来源：评论

学校读者我要写书评

暂无评论

New constructions for provably-secure time-bound hierarchical key assignment schemes 07

New constructions for provably-secure time-bound hierarchica...

引用

12th acm symposium on access control models and technologies (SacmAT 2007)

作者： De Santis, Alfredo Ferrara, Anna Lisa Masucci, Barbara Univ Salerno Dipartimento Informat & Applicaz I-84084 Fisciano SA Italy

ISBN: (纸本)9781595937452

A time-bound hierarchical key assignment scheme is a method to assign time-dependent encryption keys to a set of classes in a partially ordered hierarchy, in such a way that each class in the hierarchy can compute the keys of all classes lower down in the hierarchy, according to temporal constraints. In this paper we propose new constructions for time-bound hierarchical key assignment schemes which are provably secure with respect to key indistinguishability. Our constructions use as a building block any provably-secure hierarchical key assignment scheme without temporal constraints and exhibit a tradeoff among the amount of private information held by each class, the amount of public data, the complexity of key derivation, and the computational assumption on which their security is based. Moreover, the proposed schemes support updates to the access hierarchy with local changes to public information and without requiring any private information to be re-distributed. (C) 2008 Elsevier B.V. All rights reserved.

关键词： access control Key assignment Provable security Efficient key derivation

来源：评论

学校读者我要写书评

暂无评论

A rewriting framework for the composition of access control policies 08

A rewriting framework for the composition of access control ...

引用

PPDP 2008: 10th International acm SIGPLAN symposium on Principles and Practice of Declarative Programming

作者： Bertolissi, Clara Fernández, Maribel Laboratoire d'Informatique Fondamentale Université Aix-Marseille 1 Marseille France King's College London Dept. of Computer Science London WC2R 2LS United Kingdom

ISBN: (纸本)9781605581170

In large, and often distributed, environments, where access control information may be shared across multiple sites, the combination of individual specifications in order to define a coherent access control policy is of fundamental importance. In order to ensure non-ambiguous behaviour, formal languages, often relying on first-order logic, have been developed for the description of access control policies. We propose in this paper a formalisation of policy composition by means of term rewriting. We show how, in this setting, we are able to express a wide range of policy combinations and reason about them. Modularity properties of rewrite systems can be used to derive the correctness of the global policy, i.e. that every access request has an answer and this answer is unique. Copyright © 2008 acm.

关键词： access control

来源：评论

学校读者我要写书评

暂无评论

New constructions for provably-secure time-bound hierarchical key assignment schemes

引用

thEORETICAL COMPUTER SCIENCE 2008年第1-3期407卷 213-230页

作者： De Santis, Alfredo Ferrara, Anna Lisa Masucci, Barbara Univ Salerno Dipartimento Informat & Applicaz I-84084 Fisciano SA Italy

关键词： access control Key assignment Provable security Efficient key derivation

来源：评论

学校读者我要写书评

暂无评论

RCWLBAC - representing role based access control in OWL

RCWLBAC - representing role based access control in OWL

引用

13th acm symposium on access control models and technologies, SacmAT'08

作者： Finin, T. Joshi, A. Kagal, L. Niu, J. Sandhu, R. Winsborough, W. thuraisingham, B. Univ. of Maryland Baltimore United States Massachusetts Institute of Technology Univ. of Texas San Antonio United States Univ. of Texas Dallas

ISBN: (纸本)9781605581293

there have been two parallel themes in access control re-search in recent years. On the one hand there are efforts to develop new access control models to meet the policy needs of real world application domains. In parallel, and almost separately, researchers have developed policy languages for access control. this paper is motivated by the consideration that these two parallel efforts need to develop synergy. A policy language in the abstract without ties to a model gives the designer little guidance. Conversely a model may not have the machinery to express all the policy details of a given system or may deliberately leave important aspects unspecified. Our vision for the future is a world where advanced access control concepts are embodied in models that are supported by policy languages in a natural intuitive manner, while allowing for details beyond the models to be further specified in the policy language. this paper studies the relationship between the Web Ontology Language (OWL) and the Role Based access control (RBAC) model. Although OWL is a web ontology language and not specifically designed for expressing authorization policies, it has been used successfully for this purpose in previous work. OWL is a leading specification language for the Semantic Web, making it a natural vehicle for providing access control in that context. In this paper we show two different ways to support the NIST Standard RBAC model in OWL and then discuss how the OWL constructions can be extended to model attribute-based RBAC or more generally attribute-based access control. We further examine and assess OWL's suitability for two other access control problems: supporting attribute based access control and performing security analysis in a trust-management framework. Copyright 2008 acm.

关键词： Ontology

来源：评论

学校读者我要写书评

暂无评论

Sudoku access: A Sudoku game for people with motor disabilities 08

Sudoku access: A Sudoku game for people with motor disabilit...

引用

10th International acm SIGaccess Conference on Computers and accessibility, ASSETS'08

作者： Norte, Stéphane Lobo, Fernando G. DEEI-FCT University of Algarve Campus de Gambelas 8000-117 Faro Portugal

ISBN: (纸本)9781595939760

Educational games are a beneficial activity motivating a large number of students in our society. Unfortunately, disabled people have reduced opportunities when using a computer game. We have created a new Sudoku game for people whose motion is impaired, called Sudoku access. this special interface allows the control of the game either by voice or by a single switch. We conducted a user study of the Sudoku access that shows that people can play the game quickly and accurately. With this special Sudoku puzzle we can help more people to get involved in computer games and contribute to develop logic thinking and concentration in students. Our research aims at building enabling technologies that increase individuals' functional independence in a game environment. Copyright 2008 acm.

关键词： Computer games

来源：评论

学校读者我要写书评

暂无评论

PPDP'08 Proceedings of the 10th International acm SIGPLAN symposium on Principles and Practice of Declarative Programming

PPDP'08 Proceedings of the 10th International ACM SIGPLAN Sy...

引用

PPDP 2008: 10th International acm SIGPLAN symposium on Principles and Practice of Declarative Programming

ISBN: (纸本)9781605581170

the proceedings contain 25 papers. the topics discussed include: order-sorted dependency pairs;macros for context-free grammars;inferring precise polymorphic type dependencies in logic programs;a type system for safe memory management and its proof of correctness;programming with proofs and explicit contexts;towards execution time estimation in abstract machine-based languages;similarity-based reasoning in qualified logic programming;classifying integrity checking methods with regard to inconsistency tolerance;comprehending finite maps for algorithmic debugging of higher-order functional programs;parallel execution of multi-set constraint rewrite rules;a rewriting framework for the composition of access control policies;global difference constraint propagation for finite domain solvers;and dynamic variable elimination during propagation solving.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Joint routing and power allocation for IDMA applied in multi-hop wireless networks

Joint routing and power allocation for IDMA applied in multi...

引用

2008 IEEE 10th International symposium on Spread Spectrum Techniques and Applications, ISSSTA2008

作者： Schoneich, Hendrik Dekorsy, Armin Qualcomm CDMA Technologies GmbH Nuremberg Germany

ISBN: (纸本)9781424422043

Efficiently transmitting data in wireless mesh networks requires an integrated routing, scheduling, and power control strategy. Extending previous work on fast distributed routing and power allocation in multi-hop wireless networks we present an algorithmic solution taking the transceiver structure based on interleave-division multiple access and the resulting combinatorial structure of the overall problem explicitly into account. the algorithm offers fast convergence to an optimum solution while providing robust capacity-achieving transmission in each link of a given network. © 2008 IEEE.

关键词： MESH networking

来源：评论

学校读者我要写书评

暂无评论

How to make Discretionary access control secure against trojan horses

How to make Discretionary Access Control secure against troj...

引用

10th Workshop on Advances in Parallel and Distributed Computational models/22nd IEEE International Parallel and Distributed Processing symposium

作者： Li, Ninghui Purdue Univ CERIAS W Lafayette IN 47907 USA

ISBN: (纸本)9781424416936

Modern commercial of the shelf operating systems use Discretionary access control (DAC) to protect files and other operating system resources. According to the Trusted Computer System Evaluation Criteria (TCSEC) (often referred to as the Orange Book) [1], Discretionary access control is "a means of restricting access to objects based on the identity of subjects and/or groups to which they belong. the controls are discretionary in the sense that a subject with a certain access permission is capable of passing that permission (perhaps indirectly) on to any other subject (unless restrained by mandatory access control)." A familiar example of DAC is the UNIX access control system. In UNIX (and UNIX-based OSes such as Solaris and Linux), each file has an owner and a number of permission bits controlling which users can read/write/execute the file. the owner of a file can update these permission bits. In addition, each process has an associated user id (the effective user id) that is used to determine this process's access privileges. Intuitively, this process is considered to be acting on behalf of the user identified by its effective user id, and can access anything that user is authorized to access. It has been known since 1970's that DAC is vulnerable to trojan horses. A Trojan horse, or simply trojan, is a piece of malicious software which in addition to performing some apparently benign and useful actions, also performs hidden, malicious actions. When a user runs a trojan, the operating system treats the resulting process as acting on behalf of the user and allows it to access anything the user is authorized to access. Such trojans may be email attachments, programs downloaded from the Internet, or obtained from removable media such as USB thumb drives. By planting a trojan, an attacker can get access to resources the attacker is not authorized under the DAC policy, and is often able to abuse such privileges to take over the host or to obtain private information. DA

关键词： access control

来源：评论

学校读者我要写书评

暂无评论

Countering phishing threats with trust-by-wire in packet-switched IP networks - A conceptual framework

Countering phishing threats with trust-by-wire in packet-swi...

引用

10th Workshop on Advances in Parallel and Distributed Computational models/22nd IEEE International Parallel and Distributed Processing symposium

作者： Kubisch, Stephan Widiger, Harald Danielis, Peter Schulz, Jens Timmermann, Dirk Bahls, thomas Duchow, Daniel Univ Rostock Inst Appl Microelect & Comp Engn D-18051 Rostock Germany Broadband Access Div Nokia Siemens Networks D-17489 Greifswald Germany

ISBN: (纸本)9781424416936

During the last years, the Internet has grown into a mass-medium for communication and information exchange. Millions of people are using the Internet for business and in social life. Users can be reached easily and cost-effectively. Unfortunately the Internet's open structure is the reason for its frequent misuse for illegal and criminal actions such as dissembling phishing attacks. thus, anti-phishing techniques are needed to recognize potential phishing threats. But mostly these techniques are only of reactive nature, are soon circumvented by expert frauds, or are not efficient enough. this paper describes an anti-phishing framework. A concept for trust management and a mechanism called IPclip are presented. the main idea of IPclip is to guarantee trust-by-wire in packet-switched networks by providing trustworthy location information along with every IP packet. this information is used as supplementary and trustworthy trigger to identify potential phishing threats. Besides, the proposed framework allows for tracing the threat's origin by using a set of location information.

关键词： (anti-)phishing Internet protocol Internet security trust-by-wire trust management

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：