Skip to main content

TS

The complexity of synchronous notions of information flow security

Authors

Franck Cassez, Ron van der Meyden and Chenyi Zhang

NICTA

CNRS

UNSW

University of Luxembourg

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.

BibTeX Entry

  @inproceedings{Cassez_MZ_10,
    publisher        = {Lecture Notes in Computer Science},
    author           = {Cassez, Franck and van der Meyden, Ron and Zhang, Chenyi},
    month            = jun,
    year             = {2010},
    title            = {The Complexity of Synchronous Notions of Information Flow Security},
    booktitle        = {13th International Conference on Foundations of Software Science and Computation Structures},
    pages            = {282-296},
    address          = {Paphos, Cyprus}
  }

Download

Served by Apache on Linux on seL4.