Information Flow in Interactive Systems - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2010

Information Flow in Interactive Systems


We consider the problem of defining the information leakage in interactive systems where secrets and observables can alternate during the computation. We show that the information-theoretic approach which interprets such systems as (simple) noisy channels is not valid anymore. However, the principle can be retrieved if we consider more complicated types of channels, that in Information Theory are known as channels with memory and feedback. We show that there is a complete correspondence between interactive systems and such kind of channels. Furthermore, we show that the capacity of the channels associated to such systems is a continuous function of the Kantorovich metric.
Fichier principal
Vignette du fichier
concur.pdf (357.77 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

inria-00479672 , version 1 (01-05-2010)
inria-00479672 , version 2 (19-12-2010)
inria-00479672 , version 3 (01-11-2011)



Mário S. Alvim, Miguel E. Andrés, Catuscia Palamidessi. Information Flow in Interactive Systems. 21th International Conference on Concurrency Theory (CONCUR 2010), Aug 2010, Paris, France. pp.102-116, ⟨10.1007/978-3-642-15375-4_8⟩. ⟨inria-00479672v3⟩
554 View
309 Download



Gmail Facebook X LinkedIn More