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.
Type de document :
Communication dans un congrès
International Conference on Foundations of Software Science and Computation Structures (FoSSACS'2010), Apr 2010, Paphos, Cyprus. 2010
Liste complète des métadonnées

Littérature citée [9 références]  Voir  Masquer  Télécharger

https://hal.inria.fr/inria-00493639
Contributeur : Franck Cassez <>
Soumis le : lundi 21 juin 2010 - 06:04:19
Dernière modification le : dimanche 11 février 2018 - 16:56:01
Document(s) archivé(s) le : lundi 22 octobre 2012 - 12:35:49

Fichier

fossacs-2010.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

  • HAL Id : inria-00493639, version 1

Citation

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. 2010. 〈inria-00493639〉

Partager

Métriques

Consultations de la notice

67

Téléchargements de fichiers

78