Distributed Computing
Logics of time and computation
Logics of time and computation
Building a secure computer system
Building a secure computer system
A Hookup Theorem for Multilevel Security
IEEE Transactions on Software Engineering
A Retrospective on the VAX VMM Security Kernel
IEEE Transactions on Software Engineering
Perfectly secure message transmission
Journal of the ACM (JACM)
A logic for reasoning about security
ACM Transactions on Computer Systems (TOCS)
Knowledge, probability, and adversaries
Journal of the ACM (JACM)
Reasoning about knowledge and probability
Journal of the ACM (JACM)
A lattice model of secure information flow
Communications of the ACM
A note on the confinement problem
Communications of the ACM
Cryptography and data security
Cryptography and data security
The epistemic representation of information flow security in probabilistic systems
CSFW '95 Proceedings of the 8th IEEE workshop on Computer Security Foundations
A Logical Approach to Multilevel Security of Probabilistic Systems
SP '92 Proceedings of the 1992 IEEE Symposium on Security and Privacy
A Logical Analysis of Authorized and Prohibited Information Flows
SP '93 Proceedings of the 1993 IEEE Symposium on Security and Privacy
Mode Security: An Infrastructure for Covert Channel Suppression
SP '94 Proceedings of the 1994 IEEE Symposium on Security and Privacy
On the relationship between strand spaces and multi-agent systems
CCS '01 Proceedings of the 8th ACM conference on Computer and Communications Security
On the relationship between strand spaces and multi-agent systems
ACM Transactions on Information and System Security (TISSEC)
CSFW '02 Proceedings of the 15th IEEE workshop on Computer Security Foundations
ACM SIGACT News
Anonymity and information hiding in multiagent systems
Journal of Computer Security
Assessing security threats of looping constructs
Proceedings of the 34th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Data Anonymity in the FOO Voting Scheme
Electronic Notes in Theoretical Computer Science (ENTCS)
An epistemic framework for privacy protection in database linking
Data & Knowledge Engineering
Quantitative analysis of leakage for multi-threaded programs
Proceedings of the 2007 workshop on Programming languages and analysis for security
ACM Transactions on Information and System Security (TISSEC)
Quantifying information flow with beliefs
Journal of Computer Security - 18th IEEE Computer Security Foundations Symposium (CSF 18)
Granulation as a privacy protection mechanism
Transactions on rough sets VII
Risk assessment of security threats for looping constructs
Journal of Computer Security - Security Issues in Concurrency (SecCo'07)
| Hi-index | 0.00 |
We set out a modal logic for reasoning about multilevel security of probabilistic systems. This logic contains expressions for time, probability, and knowledge. Making use of the Halpern-Tuttle framework for reasoning about knowledge and probability, we give a semantics for our logic and prove it is sound. We give two syntactic definitions of perfect multilevel security and show that their semantic interpretations are equivalent to earlier, independently motivated characterizations. We also discuss the relation between these characterizations of security and between their usefulness in security analysis.