TY - GEN
T1 - Information flow in interactive systems
AU - Alvim, Mário S.
AU - Andrés, Miguel E.
AU - Palamidessi, Catuscia
PY - 2010/1/1
Y1 - 2010/1/1
N2 - 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 recovered 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.
AB - 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 recovered 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.
UR - https://www.scopus.com/pages/publications/78249253926
U2 - 10.1007/978-3-642-15375-4_8
DO - 10.1007/978-3-642-15375-4_8
M3 - Conference contribution
AN - SCOPUS:78249253926
SN - 3642153747
SN - 9783642153747
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 102
EP - 116
BT - CONCUR 2010 - Concurrency Theory - 21st International Conference, CONCUR 2010, Proceedings
PB - Springer Verlag
ER -