Extending the Noninterference Version of MLS for SAT
IEEE Transactions on Software Engineering - Special issue on computer security and privacy
Communication and Concurrency
Unwinding Possibilistic Security Properties
ESORICS '00 Proceedings of the 6th European Symposium on Research in Computer Security
What is Intransitive Noninterference?
CSFW '99 Proceedings of the 12th 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
Intransitive Non-Interference for Cryptographic Purposes
SP '03 Proceedings of the 2003 IEEE Symposium on Security and Privacy
CSP and determinism in security modelling
SP '95 Proceedings of the 1995 IEEE Symposium on Security and Privacy
Secure Information Flow by Self-Composition
CSFW '04 Proceedings of the 17th IEEE workshop on Computer Security Foundations
Modelling Downgrading in Information Flow Security
CSFW '04 Proceedings of the 17th IEEE workshop on Computer Security Foundations
Dimensions and Principles of Declassification
CSFW '05 Proceedings of the 18th IEEE workshop on Computer Security Foundations
Algorithmic Verification of Noninterference Properties
Electronic Notes in Theoretical Computer Science (ENTCS)
On the Decidability of Model-Checking Information Flow Properties
ICISS '08 Proceedings of the 4th International Conference on Information Systems Security
Controlling the what and where of declassification in language-based security
ESOP'07 Proceedings of the 16th European conference on Programming
A comparison of semantic models for noninterference
Theoretical Computer Science
The Complexity of Intransitive Noninterference
SP '11 Proceedings of the 2011 IEEE Symposium on Security and Privacy
A theorem proving approach to analysis of secure information flow
SPC'05 Proceedings of the Second international conference on Security in Pervasive Computing
Secure information flow as a safety problem
SAS'05 Proceedings of the 12th international conference on Static Analysis
On the verification of intransitive noninterference in mulitlevel security
IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
What, indeed, is intransitive noninterference?
ESORICS'07 Proceedings of the 12th European conference on Research in Computer Security
| Hi-index | 0.00 |
Noninterference provides a control over information flow in systems for ensuring confidentiality and integrity security properties. In general, user A is not allowed to interfere with user B if A's behaviour cannot cause any difference in B's observation. Unwinding relations are useful verification techniques for noninterference-based properties. This paper defines a framework for the notion of conditional noninterference, which allows to specify information flow policies based on the semantics of action channels. To verify the properties, we present unwinding relations that are both sound and complete for the new policies.