the CPS hierarchy of Danvy and Filinski is a hierarchy of continuations that allows for expressing nested control effects characteristic of, e.g., non-deterministic programming or certain instances of normalization by...
详细信息
ISBN:
(纸本)9781450307765
the CPS hierarchy of Danvy and Filinski is a hierarchy of continuations that allows for expressing nested control effects characteristic of, e.g., non-deterministic programming or certain instances of normalization by evaluation. In this article, we present a comprehensive study of a typed version of the CPS hierarchy, where the typing discipline generalizes Danvy and Filinski's type system for control operators shift and reset. To this end, we define a typed family of control operators that give access to delimited continuations in the CPS hierarchy and that are slightly more flexible than Danvy and Filinski's family of control operators shift, and reset,, but, as we show, are equally expressive. For this type system, we prove subject reduction, soundness with respect to the CPS translation, and termination of evaluation. We also show that our results scale to a type system for even more flexible control operators expressible in the CPS hierarchy.
the proceedings contain 19 papers. the topics discussed include: a model of triangulating environments for policy authoring;towards analyzing complex operating system accesscontrol configurations;monitoring security ...
ISBN:
(纸本)9781450300490
the proceedings contain 19 papers. the topics discussed include: a model of triangulating environments for policy authoring;towards analyzing complex operating system accesscontrol configurations;monitoring security policies with metric first-order temporal logic;on the definition of role mining;mining roles with noisy data;StateMiner: an efficient similarity-based approach for optimal mining of role hierarchy;role mining based on weights;accesscontrol in practice: pain points;automated management of network accesscontrol from design to enforcement;role-based accesscontrol (RBAC) in Java via proxy objects using annotations;role updating for assignments;enforcing spatial constraints for mobile RBAC systems;capability-based delegation model in RBAC;and a card requirements language enabling privacy-preserving accesscontrol.
the proceedings contain 57 papers. the topics discussed include: supporting iterative development of robust operation contracts in UML requirements models;improve the effectiveness of test case generation on EFSM via ...
ISBN:
(纸本)9780769546155
the proceedings contain 57 papers. the topics discussed include: supporting iterative development of robust operation contracts in UML requirements models;improve the effectiveness of test case generation on EFSM via automatic path feasibility analysis;regression testing of component-based software: a systematic practise based on state testing;animating the approach of deriving operational semantics from algebraic semantics for web services;combining goal models, expert elicitation, and probabilistic simulation for qualification of new technology;personal health record system and integration techniques with various electronic medical record systems;conflict detection and lifecycle management for accesscontrol in publish/subscribe systems;enumerating software failures to build dependable distributed applications;Monarch: a high-assurance Java-to-Java (J2j) source-code migrator;and a real time window-based local call admission control algorithm for IP networks.
the modern mobile embedded devices support complex distributed applications via heterogeneous multi-core platforms. For the successful deployment of these applications, the scalability and performance analysis must be...
详细信息
Host compromise is a serious security problem for operating systems. Most previous solutions based on integrity protection models are difficult to use: on the other hand, usable integrity protection models can only pr...
详细信息
ISBN:
(纸本)9783642202902
Host compromise is a serious security problem for operating systems. Most previous solutions based on integrity protection models are difficult to use: on the other hand, usable integrity protection models can only provide limited protection. this paper presents SecGuard, a secure and practical integrity protection model. To ensure the security of systems. SecGuard provides provable guarantees for operating systems to defend against three categories of threats: network-based threat, IPC communication threat and contaminative file threat. To ensure practicability, SecGuard introduces several novel techniques. For example, SecGuard leverages the information of existing discretionary accesscontrol information to initialize integrity labels for subjects and objects in the system. We developed the prototype system of SecGuard based on Linux Security Modules framework (LSM), and evaluated the security and practicability of SecGuard.
the use of privacy-enhancing cryptographic protocols, such as anonymous credentials and oblivious transfer, could have a detrimental effect on the ability of providers to effectively implement accesscontrols on their...
详细信息
the use of privacy-enhancing cryptographic protocols, such as anonymous credentials and oblivious transfer, could have a detrimental effect on the ability of providers to effectively implement accesscontrols on their content. In this article, we propose a stateful anonymous credential system that allows the provider to implement nontrivial, real-world accesscontrols on oblivious protocols conducted with anonymous users. Our system modelsthe behavior of users as a state machine and embeds that state within an anonymous credential to restrict access to resources based on the state information. the use of state machine models of user behavior allows the provider to restrict the users' actions according to a wide variety of accesscontrolmodels without learning anything about the users' identities or actions. Our system is secure in the standard model under basic assumptions and, after an initial setup phase, each transaction requires only constant time. As a concrete example, we show how to implement the Brewer-Nash (Chinese Wall) and Bell-La Padula (Multilevel Security) accesscontrolmodels within our credential system. Furthermore, we combine our credential system with an adaptive oblivious transfer scheme to create a privacy-friendly oblivious database with strong accesscontrols.
As distributed applications increase in size and complexity, traditional authorization architectures based on a dedicated authorization server become increasingly fragile because this decision point represents a singl...
详细信息
As distributed applications increase in size and complexity, traditional authorization architectures based on a dedicated authorization server become increasingly fragile because this decision point represents a single point of failure and a performance bottleneck. Authorization caching, which enables the reuse of previous authorization decisions, is one technique that has been used to address these challenges. this article introduces and evaluates the mechanisms for authorization "recycling" in RBAC enterprise systems. the algorithms that support these mechanisms allow making precise and approximate authorization decisions, thereby masking possible failures of the authorization server and reducing its load. We evaluate these algorithms analytically as well as using simulation and a prototype implementation. Our evaluation results demonstrate that authorization recycling can improve the performance of distributed-accesscontrol mechanisms.
the enforcement of accesscontrol policies using cryptography has received considerable attention in recent years and the security of such enforcement schemes is increasingly well understood. Recent work in the area h...
详细信息
the enforcement of accesscontrol policies using cryptography has received considerable attention in recent years and the security of such enforcement schemes is increasingly well understood. Recent work in the area has considered the efficient enforcement of temporal and geo-spatial accesscontrol policies, and asymptotic results for the time and space complexity of efficient enforcement schemes have been obtained. However, for practical purposes, it is useful to have explicit bounds for the complexity of enforcement schemes. In this article we consider interval-based accesscontrol policies, of which temporal and geo-spatial accesscontrol policies are special cases. We define enforcement schemes for interval-based accesscontrol policies for which it is possible, in almost all cases, to obtain exact values for the schemes' complexity, thereby subsuming a substantial body of work in the literature. Moreover, our enforcement schemes are more practical than existing schemes, in the sense that they operate in the same way as standard cryptographic enforcement schemes, unlike other efficient schemes in the literature. the main difference between our approach and earlier work is that we develop techniques that are specific to the cryptographic enforcement of interval-based accesscontrol policies, rather than applying generic techniques that give rise to complex constructions and asymptotic bounds.
暂无评论