The complexity of synchronous notions of information flow security
From MaRDI portal
Abstract: The paper considers the complexity of verifying that a finite state system satisfies a number of definitions of information flow security. The systems model considered is one in which agents operate synchronously with awareness of the global clock. This enables timing based attacks to be captured, whereas previous work on this topic has dealt primarily with asynchronous systems. Versions of the notions of nondeducibility on inputs, nondeducibility on strategies, and an unwinding based notion are formulated for this model. All three notions are shown to be decidable, and their computational complexity is characterised.
Recommendations
Cites work
- scientific article; zbMATH DE number 3560737 (Why is no real title available?)
- A comparison of semantic models for noninterference
- A theory of timed automata
- Control and synthesis of non-interferent timed systems
- Controlling information release in the \(\pi\)-calculus
- Information flow in systems with schedulers. I: Definitions
- Probabilistic opacity for Markov decision processes
- Provably Difficult Combinatorial Games
- Synthesis of Non-Interferent Timed Systems
- The complexity of quantitative information flow in recursive programs
- The complexity of synchronous notions of information flow security
- The complexity of two-player games of incomplete information
- Timing attacks on implementations of Diffie-Hellman, RSA, DSS, and other systems
- Timing-sensitive information flow analysis for synchronous systems
- Transforming out timing leaks
- Unwinding Possibilistic Security Properties
- Verifying persistent security properties
Cited in
(4)
This page was built for publication: The complexity of synchronous notions of information flow security
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q278742)
