Extending the Noninterference Version of MLS for SAT
IEEE Transactions on Software Engineering - Special issue on computer security and privacy
Knowledge, timed precedence and clocks (preliminary report)
PODC '94 Proceedings of the thirteenth annual ACM symposium on Principles of distributed computing
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
What is Intransitive Noninterference?
CSFW '99 Proceedings of the 12th IEEE workshop on Computer Security Foundations
Modelling Downgrading in Information Flow Security
CSFW '04 Proceedings of the 17th IEEE workshop on Computer Security Foundations
Security policies for downgrading
Proceedings of the 11th ACM conference on Computer and communications security
Dimensions and Principles of Declassification
CSFW '05 Proceedings of the 18th IEEE workshop on Computer Security Foundations
A comparison of semantic models for noninterference
FAST'06 Proceedings of the 4th international conference on Formal aspects in security and trust
Noninterference and the composability of security properties
SP'88 Proceedings of the 1988 IEEE conference on Security and privacy
Formal Aspects in Security and Trust
Access Control and Information Flow in Transactional Memory
Formal Aspects in Security and Trust
A comparison of semantic models for noninterference
Theoretical Computer Science
On intransitive non-interference in some models of concurrency
Foundations of security analysis and design VI
ESORICS'11 Proceedings of the 16th European conference on Research in computer security
Dependable and Historic Computing
VECoS'11 Proceedings of the Fifth international conference on Verification and Evaluation of Computer and Communication Systems
Deciding selective declassification of petri nets
POST'12 Proceedings of the First international conference on Principles of Security and Trust
Security correctness for secure nested transactions: position paper
Proceedings of the 7th Workshop on Programming Languages and Analysis for Security
Conditional information flow policies and unwinding relations
TGC'11 Proceedings of the 6th international conference on Trustworthy Global Computing
Intransitive noninterference in nondeterministic systems
Proceedings of the 2012 ACM conference on Computer and communications security
Noninterference for operating system kernels
CPP'12 Proceedings of the Second international conference on Certified Programs and Proofs
Journal of Computer Security - CSF 2010
| Hi-index | 0.00 |
This paper argues that Haigh and Young's definition of noninterference for intransitive security policies admits information flows that are not in accordance with the intuitions it seeks to formalise. Several alternative definitions are discussed, which are shown to be equivalent to the classical definition of noninterference with respect to transitive policies. Rushby's unwinding conditions for intransitive noninterference are shown to be sound and complete for one of these definitions, TA-security. Access control systems compatible with a policy are shown to be TA-secure, and it is also shown that TA-security implies that the system can be interpreted as an access control system.