Verifying secrets and relative secrecy
Proceedings of the 27th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Basic research in information privacy
ACM SIGSOFT Software Engineering Notes
Noninterference for concurrent programs and thread systems
Theoretical Computer Science
A Per Model of Secure Information Flow in Sequential Programs
Higher-Order and Symbolic Computation
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
The Impact of Synchronisation on Secure Information Flow in Concurrent Programs
PSI '02 Revised Papers from the 4th International Andrei Ershov Memorial Conference on Perspectives of System Informatics: Akademgorodok, Novosibirsk, Russia
Securing Communication in a Concurrent Language
SAS '02 Proceedings of the 9th International Symposium on Static Analysis
Noninterference for Concurrent Programs
ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
Using Replication and Partitioning to Build Secure Distributed Systems
SP '03 Proceedings of the 2003 IEEE Symposium on Security and Privacy
A Generic Approach to the Security of Multi-Threaded Programs
CSFW '01 Proceedings of the 14th IEEE workshop on Computer Security Foundations
A New Type System for Secure Information Flow
CSFW '01 Proceedings of the 14th IEEE workshop on Computer Security Foundations
Statically assuring secrecy for dynamic concurrent processes
Proceedings of the 5th ACM SIGPLAN international conference on Principles and practice of declaritive programming
A unifying approach to the security of distributed and multi-threaded programs
Journal of Computer Security - Special issue on CSFW14
Formally verifying information flow type systems for concurrent and thread systems
Proceedings of the 2004 ACM workshop on Formal methods in security engineering
Enforcing robust declassification and qualified robustness
Journal of Computer Security - Special issue on CSFW17
Improved typings for probabilistic noninterference in a multi-threaded language
Journal of Computer Security
Fast probabilistic simulation, nontermination, and secure information flow
Proceedings of the 2007 workshop on Programming languages and analysis for security
State-oriented Noninterference for CCS
Electronic Notes in Theoretical Computer Science (ENTCS)
Compositional information flow security for concurrent programs
Journal of Computer Security
Secure information flow for a concurrent language with scheduling
Journal of Computer Security - Formal Methods in Security Engineering Workshop (FMSE 04)
A security domain model to assess software for exploitable covert channels
Proceedings of the third ACM SIGPLAN workshop on Programming languages and analysis for security
Automated Analysis of Java Methods for Confidentiality
CAV '09 Proceedings of the 21st International Conference on Computer Aided Verification
Security for multithreaded programs under cooperative scheduling
PSI'06 Proceedings of the 6th international Andrei Ershov memorial conference on Perspectives of systems informatics
Probabilistic anonymity via coalgebraic simulations
ESOP'07 Proceedings of the 16th European conference on Programming
Probabilistic anonymity via coalgebraic simulations
Theoretical Computer Science
Locality-based security policies
FAST'06 Proceedings of the 4th international conference on Formal aspects in security and trust
Closing internal timing channels by transformation
ASIAN'06 Proceedings of the 11th Asian computing science conference on Advances in computer science: secure software and related issues
Security of multithreaded programs by compilation
ACM Transactions on Information and System Security (TISSEC)
Flexible scheduler-independent security
ESORICS'10 Proceedings of the 15th European conference on Research in computer security
Flexible dynamic information flow control in Haskell
Proceedings of the 4th ACM symposium on Haskell
Timed abstract non-interference
FORMATS'05 Proceedings of the Third international conference on Formal Modeling and Analysis of Timed Systems
Non-termination and secure information flow
Mathematical Structures in Computer Science - Programming Language Interference and Dependence
Model-checking secure information flow for multi-threaded programs
TOSCA'11 Proceedings of the 2011 international conference on Theory of Security and Applications
Addressing covert termination and timing channels in concurrent information flow systems
Proceedings of the 17th ACM SIGPLAN international conference on Functional programming
Decidability of parameterized probabilistic information flow
CSR'07 Proceedings of the Second international conference on Computer Science: theory and applications
Security of multithreaded programs by compilation
ESORICS'07 Proceedings of the 12th European conference on Research in Computer Security
Information flow in systems with schedulers, Part I: Definitions
Theoretical Computer Science
Confidentiality for probabilistic multi-threaded programs and its verification
ESSoS'13 Proceedings of the 5th international conference on Engineering Secure Software and Systems
Effective verification of confidentiality for multi-threaded programs
Journal of Computer Security - Foundational Aspects of Security
| Hi-index | 0.00 |
In previous work (Smith and Volpano, Proceedings 25th Symposiumon Principles of Programming Languages, San Diego, CA, 1998, pp.355-364), we give a type system that guarantees that well-typedmulti-threaded programs are possibilistically noninterfering. Ifthread scheduling is probabilistic, however, then well-typedprograms may have probabilistic timing channels. We describe howthey can be eliminated without making the type system morerestrictive. We show that well-typed concurrent programs areprobabilistically noninterfering if every total command with aguard containing high variables executes atomically. The proof usesthe notion of a probabilistic state of a computation from Kozenswork in the denotational semantics of probabilistic programs(Kozen, Journal of Computer and System Sciences 22 (1981),328-350).^{2}