Results 1 - 10 of 421

Extending The Take-Grant Protection System

by Jeremy Frank, Matt Bishop , 1996
"... . The Take-Grant Model is used to analyze systems in order to determine how information and access rights can be passed from one subject to another. However, the Take-Grant model does not contain enough power to discriminate between two different flows. We propose a method of extending Take-Grant t ..."
Abstract - Cited by 11 (2 self) - Add to MetaCart
. The Take-Grant Model is used to analyze systems in order to determine how information and access rights can be passed from one subject to another. However, the Take-Grant model does not contain enough power to discriminate between two different flows. We propose a method of extending Take-Grant

Extending The Take-Grant Protection System 1. Abstract.

by Jeremy Frank, Matt Bishop , 1996
"... The Take-Grant Model is used to analyze systems in order to determine how information and access rights can be passed from one subject to another. However, the Take-Grant model does not contain enough power to discriminate between two different flows. We propose a method of extending Take-Grant to g ..."
Abstract - Add to MetaCart
The Take-Grant Model is used to analyze systems in order to determine how information and access rights can be passed from one subject to another. However, the Take-Grant model does not contain enough power to discriminate between two different flows. We propose a method of extending Take-Grant

Conspiracy and Information Flow in the Take-Grant Protection Model

by Matt Bishop - Journal of Computer Security , 1996
"... The Take Grant Protection Model is a theoretic model of access control that captures the notion of information flow throughout the modelled system. This paper analyzes the problem of sharing information in the context of paths along which information can flow, and presents the number of actors neces ..."
Abstract - Cited by 12 (2 self) - Add to MetaCart
The Take Grant Protection Model is a theoretic model of access control that captures the notion of information flow throughout the modelled system. This paper analyzes the problem of sharing information in the context of paths along which information can flow, and presents the number of actors

A Hierarchical CPU Scheduler for Multimedia Operating Systems

by Pawan Goyal, Xingang Guo, Harrick M. Vin , 1996
"... The need for supportingvariety of hard and soft real-time, as well as best effort applications in a multimedia computing environment requires an operating system framework that: (1) enables different schedulers to be employed for different application classes, and (2) provides protection between the ..."
Abstract - Cited by 324 (6 self) - Add to MetaCart
The need for supportingvariety of hard and soft real-time, as well as best effort applications in a multimedia computing environment requires an operating system framework that: (1) enables different schedulers to be employed for different application classes, and (2) provides protection between

Network Vulnerability Analysis Through Vulnerability Take-Grant Model (VTG)

by Hamid Reza Shahriari, Reza Sadoddin, Rasool Jalili, Reza Zakeri, Ali Reza Omidian
"... Abstract. Modeling and analysis of information system vulnerabilities helps us to predict possible attacks to networks using the network configuration and vulnerabilities information. As a fact, exploiting most of vulnerabilities result in access rights alteration. In this paper, we propose a new vu ..."
Abstract - Cited by 3 (3 self) - Add to MetaCart
vulnerability analysis method based on the Take-Grant protection model. We extend the initial Take-Grant model to address the notion of vulnerabilities and introduce the vulnerabilities rewriting rules to specify how the protection state of the system can be changed by exploiting vulnerabilities. Our analysis

The HP AutoRAID hierarchical storage system

by John Wilkes, Richard Golding, Carl Staelin, Tim Sullivan - ACM Transactions on Computer Systems , 1995
"... Configuring redundant disk arrays is a black art. To configure an array properly, a system administrator must understand the details of both the array and the workload it will support. Incorrect understanding of either, or changes in the workload over time, can lead to poor performance. We present a ..."
Abstract - Cited by 263 (15 self) - Add to MetaCart
Configuring redundant disk arrays is a black art. To configure an array properly, a system administrator must understand the details of both the array and the workload it will support. Incorrect understanding of either, or changes in the workload over time, can lead to poor performance. We present

Unequal Loss Protection: Graceful Degradation of Image Quality over Packet Erasure Channels throught Forward Error Correction

by Alexander E. Mohr, Eve A. Riskin, Richard E. Ladner - IN DCC , 2000
"... We present the unequal loss protection (ULP) framework in which unequal amounts of forward error correction are applied to progressive data to provide graceful degradation of image quality as packet losses increase. We develop a simple algorithm that can find a good assignment within the ULP framew ..."
Abstract - Cited by 146 (7 self) - Add to MetaCart
framework. We use the Set Partitioning in Hierarchical Trees coder in this work, but our algorithm can protect any progressive compression scheme. In addition, we promote the use of a PMF of expected channel conditions so that our system can work with almost any model or estimate of packet losses. We find

Anonymous Hierarchical Identity-Based Encryption (Without Random Oracles). In: Dwork

by Xavier Boyen , Brent Waters - CRYPTO 2006. LNCS, , 2006
"... Abstract We present an identity-based cryptosystem that features fully anonymous ciphertexts and hierarchical key delegation. We give a proof of security in the standard model, based on the mild Decision Linear complexity assumption in bilinear groups. The system is efficient and practical, with sm ..."
Abstract - Cited by 119 (10 self) - Add to MetaCart
Abstract We present an identity-based cryptosystem that features fully anonymous ciphertexts and hierarchical key delegation. We give a proof of security in the standard model, based on the mild Decision Linear complexity assumption in bilinear groups. The system is efficient and practical

Overshadow: A Virtualization-Based Approach to Retrofitting Protection in Commodity Operating Systems

by Xiaoxin Chen, Tal Garfinkel, E. Christopher Lewis, Pratap Subrahmanyam, Carl A. Waldspurger, Dan Boneh, Jeffrey Dwoskin, Dan R. K. Ports - IN: PROC. OF THE 13TH CONFERENCE ON ARCHITECTURAL SUPPORT FOR PROGRAMMING LANGUAGES AND OPERATING SYSTEMS (ASPLOS , 2008
"... Commodity operating systems entrusted with securing sensitive data are remarkably large and complex, and consequently, frequently prone to compromise. To address this limitation, we introduce a virtual-machine-based system called Overshadow that protects the privacy and integrity of application data ..."
Abstract - Cited by 106 (1 self) - Add to MetaCart
the hierarchical protection domains implemented by traditional operating systems and processor architectures. We present the design and implementation of Overshadow and show how its new protection semantics can be integrated with existing systems. Our design has been fully implemented and used to protect a wide

A linear time algorithm for deciding subject security

by R. J. Lipton, L. Snyder - J. ACM , 1977
"... ABSTRACT A particular protection mechanism from the protection hterature-the take and grant system--is presented For this particular mechanism, it is shown that the safety problem can be solved in linear time Moreover the security policies that this mechanism can enforce are characterized ..."
Abstract - Cited by 97 (0 self) - Add to MetaCart
ABSTRACT A particular protection mechanism from the protection hterature-the take and grant system--is presented For this particular mechanism, it is shown that the safety problem can be solved in linear time Moreover the security policies that this mechanism can enforce are characterized
Results 1 - 10 of 421