A notion of non-interference for timed automata
Fundamenta Informaticae
Analysis of security protocols as open systems
Theoretical Computer Science
Transforming Processes to Check and Ensure Information Flow Security
AMAST '02 Proceedings of the 9th International Conference on Algebraic Methodology and Software Technology
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
Non Interference for the Analysis of Cryptographic Protocols
ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
Probabilistic Information Flow in a Process Algebra
CONCUR '01 Proceedings of the 12th International Conference on Concurrency Theory
Securing Communication in a Concurrent Language
SAS '02 Proceedings of the 9th International Symposium on Static Analysis
Control flow analysis of mobile ambients with security boundaries
FMOODS '02 Proceedings of the IFIP TC6/WG6.1 Fifth International Conference on Formal Methods for Open Object-Based Distributed Systems V
CSFW '02 Proceedings of the 15th IEEE workshop on Computer Security Foundations
A Generic Approach to the Security of Multi-Threaded Programs
CSFW '01 Proceedings of the 14th IEEE workshop on Computer Security Foundations
Noninterference Equations for Nondeterministic Systems
CSFW '01 Proceedings of the 14th IEEE workshop on Computer Security Foundations
A decidable notion of timed non-interference
Fundamenta Informaticae - Concurrency specification and programming
A unifying approach to the security of distributed and multi-threaded programs
Journal of Computer Security - Special issue on CSFW14
Semantic models for information flow
Theoretical Computer Science - Mathematical foundations of programming semantics
Soft constraint programming to analysing security protocols
Theory and Practice of Logic Programming
A process-algebraic approach for the analysis of probabilistic noninterference
Journal of Computer Security
Information flow in hybrid systems
ACM Transactions on Embedded Computing Systems (TECS)
Extending noninterference properties to the timed world
Proceedings of the 2006 ACM symposium on Applied computing
Fundamenta Informaticae - SPECIAL ISSUE ON CONCURRENCY SPECIFICATION AND PROGRAMMING (CS&P 2005) Ruciane-Nide, Poland, 28-30 September 2005
Defining information flow quantity
Journal of Computer Security - Special issue on CSFW15
Information flow security in Boundary Ambients
Information and Computation
Observation Based System Security
Fundamenta Informaticae - Special Issue on Concurrency Specification and Programming (CS&P)
Probabilistic Information Flow Security
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P)
Quantifying Security for Timed Process Algebras
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P)
Unwinding in Information Flow Security
Electronic Notes in Theoretical Computer Science (ENTCS)
A Classification of Time and/or Probability Dependent Security Properties
Electronic Notes in Theoretical Computer Science (ENTCS)
Information-flow attacks based on limited observations
PSI'06 Proceedings of the 6th international Andrei Ershov memorial conference on Perspectives of systems informatics
Synthesis of web services orchestrators in a timed setting
WS-FM'07 Proceedings of the 4th international conference on Web services and formal methods
Process Algebra Contexts and Security Properties
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P)
Component-oriented verification of noninterference
Journal of Systems Architecture: the EUROMICRO Journal
Information flow security for interactive systems
EUC'05 Proceedings of the 2005 international conference on Embedded and Ubiquitous Computing
Secure requirements elicitation through triggered message sequence charts
ICDCIT'04 Proceedings of the First international conference on Distributed Computing and Internet Technology
Bridging language-based and process calculi security
FOSSACS'05 Proceedings of the 8th international conference on Foundations of Software Science and Computation Structures
Enforcing distributed information flow policies architecturally: the SAID approach
COORDINATION'05 Proceedings of the 7th international conference on Coordination Models and Languages
Timing-sensitive information flow analysis for synchronous systems
ESORICS'06 Proceedings of the 11th European conference on Research in Computer 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
Security boundaries in mobile ambients
Computer Languages, Systems and Structures
Gained and Excluded Private Actions by Process Observations
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P)
Quantifying Security for Timed Process Algebras
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P)
Probabilistic Information Flow Security
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P)
Observation Based System Security
Fundamenta Informaticae - Special Issue on Concurrency Specification and Programming (CS&P)
Fundamenta Informaticae - SPECIAL ISSUE ON CONCURRENCY SPECIFICATION AND PROGRAMMING (CS&P 2005) Ruciane-Nide, Poland, 28-30 September 2005
A Decidable Notion of Timed Non-Interference
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P'2002), Part 1
A Notion of Non-Interference for Timed Automata
Fundamenta Informaticae - Concurrency Specification and Programming Workshop (CS&P'2001)
Informational Analysis of Security and Integrity
Fundamenta Informaticae - Concurrency Specification and Programming CS&P
Quantification of Positive and Negative Attacker's Information
Fundamenta Informaticae - Concurrency Specification and Programming CS&P
Fundamenta Informaticae - Concurrency, Specification and Programming
| Hi-index | 0.00 |
Some of the non-interference properties studied in literature for information flow analysis in computer systems, notably BNDC, are reformulated here in a real-time setting. This is done by enhancing the Security Process Algebra with some extra constructs to model real-time systems (in a discrete time setting); and then by studying the natural extensions of those properties in this enriched setting. We prove essentially the same results known for the untimed case: ordering relation among properties, compositionality aspects, and partial model checking techniques. Finally, we illustrate a case study of a system that presents no information flows when analyzed without considering timing constraints. However, when the specification is refined with time, some interesting information flows are detected.