Automated Analysis of Java Methods for Confidentiality
CAV '09 Proceedings of the 21st International Conference on Computer Aided Verification
Dynamic Observers for the Synthesis of Opaque Systems
ATVA '09 Proceedings of the 7th International Symposium on Automated Technology for Verification and Analysis
Automatic Testing of Access Control for Security Properties
TESTCOM '09/FATES '09 Proceedings of the 21st IFIP WG 6.1 International Conference on Testing of Software and Communication Systems and 9th International FATES Workshop
A Notion of Biological Diagnosability Inspired by the Notion of Opacity in Systems Security
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P)
Process Algebra Contexts and Security Properties
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P)
Opacity of discrete event systems and its applications
Automatica (Journal of IFAC)
Remodelling the attacker in voting protocols
Security'08 Proceedings of the 16th International conference on Security protocols
Synthesis of opaque systems with static and dynamic masks
Formal Methods in System Design
Opacity generalised to transition systems
FAST'05 Proceedings of the Third international conference on Formal Aspects in Security and Trust
Probing attacks on multi-agent systems using electronic institutions
DALT'11 Proceedings of the 9th international conference on Declarative Agent Languages and Technologies
Verification of initial-state opacity in security applications of discrete event systems
Information Sciences: an International Journal
Comparative analysis of related notions of opacity in centralized and coordinated architectures
Discrete Event Dynamic Systems
Information flow in trust management systems
Journal of Computer Security - CSF 2010
| Hi-index | 0.00 |
Recently, opacity has proved a promising technique for describing security properties. Much of the work has been couched in terms of Petri nets. Here, we extend the notion of opacity to the model of labelled transition systems and generalise opacity in order to better represent concepts from the literature on information flow. In particular, we establish links between opacity and the information flow concepts of anonymity and non-inference. We also investigate ways of verifying opacity when working with Petri nets. Our work is illustrated by two examples, one describing anonymity in a commercial context, and the other modelling requirements upon a simple voting system.