An automata theoretic decision procedure for the propositional mu-calculus
Information and Computation
ACM Transactions on Information and System Security (TISSEC)
On the Construction of Submodule Specifications and Communication Protocols
ACM Transactions on Programming Languages and Systems (TOPLAS)
Analysis of security protocols as open systems
Theoretical Computer Science
Model Checking and Fault Tolerance
AMAST '97 Proceedings of the 6th International Conference on Algebraic Methodology and Software Technology
Open Systems in Reactive Environments: Control and Synthesis
CONCUR '00 Proceedings of the 11th International Conference on Concurrency Theory
Synthesizing Processes and Schedulers from Temporal Specifications
CAV '90 Proceedings of the 2nd International Workshop on Computer Aided Verification
LICS '95 Proceedings of the 10th Annual IEEE Symposium on Logic in Computer Science
Games for synthesis of controllers with partial observation
Theoretical Computer Science - Logic and complexity in computer science
Fuzzy Multi-Level Security: An Experiment on Quantified Risk-Adaptive Access Control
SP '07 Proceedings of the 2007 IEEE Symposium on Security and Privacy
Through Modeling to Synthesis of Security Automata
Electronic Notes in Theoretical Computer Science (ENTCS)
Access-Control Policies via Belnap Logic: Effective and Efficient Composition and Analysis
CSF '08 Proceedings of the 2008 21st IEEE Computer Security Foundations Symposium
D-algebra for composing access control policy decisions
Proceedings of the 4th International Symposium on Information, Computer, and Communications Security
TrustBus'10 Proceedings of the 7th international conference on Trust, privacy and security in digital business
ESSoS'11 Proceedings of the Third international conference on Engineering secure software and systems
Checking risky events is enough for local policies
ICTCS'05 Proceedings of the 9th Italian conference on Theoretical Computer Science
Gate automata-driven run-time enforcement
Computers & Mathematics with Applications
Risk-based security decisions under uncertainty
Proceedings of the second ACM conference on Data and Application Security and Privacy
Quantitative access control with partially-observable Markov decision processes
Proceedings of the second ACM conference on Data and Application Security and Privacy
Towards an integrated formal analysis for security and trust
FMOODS'05 Proceedings of the 7th IFIP WG 6.1 international conference on Formal Methods for Open Object-Based Distributed Systems
Risk-Based auto-delegation for probabilistic availability
DPM'11 Proceedings of the 6th international conference, and 4th international conference on Data Privacy Management and Autonomous Spontaneus Security
Enforceable security policies revisited
POST'12 Proceedings of the First international conference on Principles of Security and Trust
A quantitative approach for inexact enforcement of security policies
ISC'12 Proceedings of the 15th international conference on Information Security
A framework for automatic generation of security controller
Software Testing, Verification & Reliability
| Hi-index | 0.00 |
The problem of enforcing a security policy has been particularly well studied over the last decade, following Schneider's seminal work on security automata. We first present in this paper this problem through its qualitative aspect, where one tries to specify and to define a "good" runtime monitor. In particular, we recall that under some conditions, a monitor can be automatically synthesized, using partial model checking. We then introduce some of the quantitative challenges of runtime enforcement, which focus on the problem of defining what does it mean for a monitor to be better than another one, and we sketch several directions that could be explored to tackle this issue.