Sciweavers

116 search results - page 3 / 24
» Reasoning about XACML policies using CSP
Sort
View
IEEEARES
2010
IEEE
14 years 16 days ago
Strategies for Reducing Risks of Inconsistencies in Access Control Policies
—Managing access control policies is a complex task. We argue that much of the complexity is unnecessary and mostly due to historical reasons. There are number of legacy policy s...
Bernard Stepien, Stan Matwin, Amy P. Felty
ICDCS
2002
IEEE
13 years 10 months ago
Reasoning about Joint Administration of Access Policies for Coalition Resources
We argue that joint administration of access policies for a dynamic coalition formed by autonomous domains requires that these domains set up a coalition authority that distribute...
Himanshu Khurana, Virgil D. Gligor, John Linn
CSL
2007
Springer
13 years 11 months ago
On the Complexity of Reasoning About Dynamic Policies
We study the complexity of satisfiability for DLP+ dyn , an expressive logic introduced by Demri that allows to reason about dynamic policies. DLP+ dyn extends the logic DLPdyn of...
Stefan Göller
IAT
2008
IEEE
14 years 3 days ago
Privacy Guarantees through Distributed Constraint Satisfaction
The reason for using distributed constraint satisfaction algorithms is often to allow agents to find a solution while revealing as little as possible about their variables and co...
Boi Faltings, Thomas Léauté, Adrian ...
RAID
2004
Springer
13 years 11 months ago
Formal Reasoning About Intrusion Detection Systems
We present a formal framework for the analysis of intrusion detection systems (IDS) that employ declarative rules for attack recognition, e.g. specification-based intrusion detect...
Tao Song, Calvin Ko, Jim Alves-Foss, Cui Zhang, Ka...