Matrix multiplication via arithmetic progressions
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
Three partition refinement algorithms
SIAM Journal on Computing
A CSP formulation of non-interference and unwinding
Cipher: IEEE Computer Society Technical Committee Newsletter on Security & Privacy
A General Theory of Composition for a Class of "Possibilistic" Properties
IEEE Transactions on Software Engineering
IEEE Transactions on Software Engineering
Communication and Concurrency
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
Proofs Methods for Bisimulation Based Information Flow Security
VMCAI '02 Revised Papers from the Third International Workshop on Verification, Model Checking, and Abstract Interpretation
Non-Interference Through Determinism
ESORICS '94 Proceedings of the Third European Symposium on Research in Computer Security
Unwinding Possibilistic Security Properties
ESORICS '00 Proceedings of the 6th European Symposium on Research in Computer Security
Partial Model Checking and Theorem Proving for Ensuring Security Properties
CSFW '98 Proceedings of the 11th IEEE workshop on Computer Security Foundations
Possibilistic Definitions of Security - An Assembly Kit
CSFW '00 Proceedings of the 13th IEEE workshop on Computer Security Foundations
Information Flow Security in Dynamic Contexts
CSFW '02 Proceedings of the 15th IEEE workshop on Computer Security Foundations
On the Composition of Secure Systems
SP '02 Proceedings of the 2002 IEEE Symposium on Security and Privacy
A General Theory of Composition for Trace Sets Closed under Selective Interleaving Functions
SP '94 Proceedings of the 1994 IEEE Symposium on Security and Privacy
A general theory of security properties
SP '97 Proceedings of the 1997 IEEE Symposium on Security and Privacy
Preserving Information Flow Properties under Refinement
SP '01 Proceedings of the 2001 IEEE Symposium on Security and Privacy
A proof system for information flow security
LOPSTR'02 Proceedings of the 12th international conference on Logic based program synthesis and transformation
Algorithmic Verification of Noninterference Properties
Electronic Notes in Theoretical Computer Science (ENTCS)
An Automata Based Approach for Verifying Information Flow Properties
Electronic Notes in Theoretical Computer Science (ENTCS)
Formal Verification of Differential Privacy for Interactive Systems (Extended Abstract)
Electronic Notes in Theoretical Computer Science (ENTCS)
Possibilistic information flow control in MAKS and action refinement
ETRICS'06 Proceedings of the 2006 international conference on Emerging Trends in Information and Communication Security
The complexity of synchronous notions of information flow security
FOSSACS'10 Proceedings of the 13th international conference on Foundations of Software Science and Computational Structures
Verifying persistent security properties
Computer Languages, Systems and Structures
Information flow in systems with schedulers, Part I: Definitions
Theoretical Computer Science
Information flow in systems with schedulers, Part II: Refinement
Theoretical Computer Science
| Hi-index | 0.00 |
We study bisimulation-based information flow security properties which are persistent, in the sense that if a system is secure, then all states reachable from it are secure too. We show that such properties can be characterized in terms of bisimulation-like equivalence relations between the system and the system itself prevented from performing confidential actions. Moreover, we provide a characterization of such properties in terms of unwinding conditions which demand properties of individual actions. These two different characterizations naturally lead to efficient methods for the verification and construction of secure systems. We also prove several compositionality results and discuss a sufficient condition to define refinement operators preserving security.