Information Hiding in Probabilistic Concurrent Systems - Laboratoire d'informatique de l'école polytechnique Accéder directement au contenu
Communication Dans Un Congrès Année : 2010

Information Hiding in Probabilistic Concurrent Systems

Résumé

Information hiding is a general concept which refers to the goal of preventing an adversary to infer secret information from the observables. Anonymity and Information Flow are examples of this notion. We study the problem of information hiding in systems characterized by the presence of randomization and concurrency. It is well known that the raising of nondeterminism, due to the possible interleavings and interactions of the parallel components, can cause unintended information leaks. One way to solve this problem is to fix the strategy of the scheduler beforehand. In this work, we propose a milder restriction on the schedulers, and we define the notion of strong (probabilistic) information hiding under various notions of observables. Furthermore, we propose a method, based on the notion of automorphism, to verify that a system satisfies the property of strong information hiding, namely strong anonymity or no-interference, depending on the context.
Fichier principal
Vignette du fichier
SAuN.pdf (314.04 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-00548187 , version 1 (19-12-2010)

Identifiants

Citer

Miguel E. Andrés, Catuscia Palamidessi, Peter van Rossum, Ana Sokolova. Information Hiding in Probabilistic Concurrent Systems. 7th IEEE International Conference on Quantitative Evaluation of SysTems (QEST 2010), Sep 2010, Williamsburg, VA, United States. pp.17-26, ⟨10.1109/QEST.2010.11⟩. ⟨hal-00548187⟩
379 Consultations
221 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More