A logic for reasoning about security
ACM Transactions on Computer Systems (TOCS)
Reasoning about knowledge
Mathematical Models of Computer Security
FOSAD '00 Revised versions of lectures given during the IFIP WG 1.7 International School on Foundations of Security Analysis and Design on Foundations of Security Analysis and Design: Tutorial Lectures
Classification of Security Properties (Part I: Information Flow)
FOSAD '00 Revised versions of lectures given during the IFIP WG 1.7 International School on Foundations of Security Analysis and Design on Foundations of Security Analysis and Design: Tutorial Lectures
ESORICS '96 Proceedings of the 4th European Symposium on Research in Computer Security: Computer Security
Reconciling Two Views of Cryptography (The Computational Soundness of Formal Encryption)
TCS '00 Proceedings of the International Conference IFIP on Theoretical Computer Science, Exploring New Frontiers of Theoretical Informatics
Opacity generalised to transition systems
International Journal of Information Security
Modelling Opacity Using Petri Nets
Electronic Notes in Theoretical Computer Science (ENTCS)
Compiling and verifying security protocols
LPAR'00 Proceedings of the 7th international conference on Logic for programming and automated reasoning
Observation Based System Security
Fundamenta Informaticae - Special Issue on Concurrency Specification and Programming (CS&P)
Probabilistic Information Flow Security
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P)
Security in a Model for Long-running Transactions
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P)
The Dark Side of Timed Opacity
ISA '09 Proceedings of the 3rd International Conference and Workshops on Advances in Information Security and Assurance
Quantifying Security for Timed Process Algebras
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P)
Verification and synthesis for secrecy in discrete-event systems
ACC'09 Proceedings of the 2009 conference on American Control Conference
Deriving bisimulations by simplifying partitions
VMCAI'08 Proceedings of the 9th international conference on Verification, model checking, and abstract interpretation
Quantifying Security for Timed Process Algebras
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P)
Probabilistic Information Flow Security
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P)
Security in a Model for Long-running Transactions
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P)
Observation Based System Security
Fundamenta Informaticae - Special Issue on Concurrency Specification and Programming (CS&P)
Informational Analysis of Security and Integrity
Fundamenta Informaticae - Concurrency Specification and Programming CS&P
Quantification of Positive and Negative Attacker's Information
Fundamenta Informaticae - Concurrency Specification and Programming CS&P
| 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 an example modelling requirements upon a simple voting system.