The complexity of synchronous notions of information flow security

Franck Cassez, Ron van der Meyden, Chenyi Zhang*

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review


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.

Original languageEnglish
Pages (from-to)16-42
Number of pages27
JournalTheoretical Computer Science
Publication statusPublished - 6 Jun 2016


  • Security
  • Information flow
  • Computational complexity


Dive into the research topics of 'The complexity of synchronous notions of information flow security'. Together they form a unique fingerprint.

Cite this