Efficient checking of temporal integrity constraints using bounded history encoding
ACM Transactions on Database Systems (TODS)
Flexible support for multiple access control policies
ACM Transactions on Database Systems (TODS)
Non-Markovian control in the situation calculus
Eighteenth national conference on Artificial intelligence
Beyond proof-of-compliance: security analysis in trust management
Journal of the ACM (JACM)
Analyzing web access control policies
Proceedings of the 16th international conference on World Wide Web
AMUSE: autonomic management of ubiquitous e-Health systems
Concurrency and Computation: Practice & Experience - Selected Papers from the 2005 U.K. e-Science All Hands Meeting (AHM 2005)
DKAL: Distributed-Knowledge Authorization Language
CSF '08 Proceedings of the 2008 21st IEEE Computer Security Foundations Symposium
Authorization and Obligation Policies in Dynamic Systems
ICLP '08 Proceedings of the 24th International Conference on Logic Programming
Expressive policy analysis with enhanced system dynamicity
Proceedings of the 4th International Symposium on Information, Computer, and Communications Security
High speed and robust event correlation
IEEE Communications Magazine
Rule-based policy representation and reasoning for the semantic web
RW'07 Proceedings of the Third international summer school conference on Reasoning Web
| Hi-index | 0.00 |
We propose an efficient method to evaluate a large class of history-based policies written as logic programs. To achieve this, we dynamically compute, from a given policy set, a finite subset of the history required and sufficient to evaluate the policies. We maintain this history by monitoring rules and transform the policies into a non history-based form. We further formally prove that evaluating history-based policies can be reduced to an equivalent, but more efficient, evaluation of the non history-based policies together with the monitoring rules.