The complexity of mean payoff games on graphs
Theoretical Computer Science
ACM Transactions on Information and System Security (TISSEC)
Towards a completeness result for model checking of security protocols
Journal of Computer Security
Word problems requiring exponential time(Preliminary Report)
STOC '73 Proceedings of the fifth annual ACM symposium on Theory of computing
Automated Verification of Selected Equivalences for Security Protocols
LICS '05 Proceedings of the 20th Annual IEEE Symposium on Logic in Computer Science
Discrete Event Dynamic Systems
Opacity generalised to transition systems
International Journal of Information Security
Fault Diagnosis with Static and Dynamic Observers
Fundamenta Informaticae - Application of Concurrency to System Design, the Sixth Special Issue
Model checking on trees with path equivalences
TACAS'07 Proceedings of the 13th international conference on Tools and algorithms for the construction and analysis of systems
Information flow testing: the third path towards confidentiality guarantee
ASIAN'07 Proceedings of the 12th Asian computing science conference on Advances in computer science: computer and network security
Test generation for network security rules
TestCom'06 Proceedings of the 18th IFIP TC6/WG6.1 international conference on Testing of Communicating Systems
Preserving secrecy under refinement
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part II
On the verification of intransitive noninterference in mulitlevel security
IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
Synthesis of opaque systems with static and dynamic masks
Formal Methods in System Design
Comparative analysis of related notions of opacity in centralized and coordinated architectures
Discrete Event Dynamic Systems
Predictability of event occurrences in timed systems
FORMATS'13 Proceedings of the 11th international conference on Formal Modeling and Analysis of Timed Systems
| Hi-index | 0.00 |
In this paper, we address the problem of synthesizing opaque systems by selecting the set of observable events. We first investigate the case of static observability where the set of observable events is fixed a priori. In this context, we show that checking whether a system is opaque and computing an optimal static observer ensuring opacity are both PSPACE-complete problems. Next, we introduce dynamic partial observability where the set of observable events can change over time. We show how to check that a system is opaque w.r.t. a dynamic observer and also address the corresponding synthesis problem: given a system G and secret states S , compute the set of dynamic observers under which S is opaque. Our main result is that the synthesis problem can be solved in EXPTIME.