Skip to Main content Skip to Navigation
Conference papers

The Complexity of Synchronous Notions of Information Flow Security

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.
Document type :
Conference papers
Complete list of metadata

Cited literature [9 references]  Display  Hide  Download
Contributor : Franck Cassez Connect in order to contact the contributor
Submitted on : Monday, June 21, 2010 - 6:04:19 AM
Last modification on : Thursday, June 6, 2019 - 2:42:14 PM
Long-term archiving on: : Monday, October 22, 2012 - 12:35:49 PM


Files produced by the author(s)


  • HAL Id : inria-00493639, version 1


Franck Cassez, Ron van Der Meyden, Chenyi Zhang. The Complexity of Synchronous Notions of Information Flow Security. International Conference on Foundations of Software Science and Computation Structures (FoSSACS'2010), Apr 2010, Paphos, Cyprus. ⟨inria-00493639⟩



Record views


Files downloads