Abstract
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.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Alvim, M.S., Andrés, M.E., Palamidessi, C.: Information Flow in Interactive Systems (2010), http://hal.archives-ouvertes.fr/inria-00479672/en/
Andrés, M.E., Palamidessi, C., van Rossum, P., Smith, G.: Computing the leakage of information-hiding systems. In: Esparza, J., Majumdar, R. (eds.) TACAS 2010. LNCS, vol. 6015, pp. 373–389. Springer, Heidelberg (2010)
Bohannon, A., Pierce, B.C., Sjöberg, V., Weirich, S., Zdancewic, S.: Reactive noninterference. In: Proc. of CCS, pp. 79–90. ACM, New York (2009)
Chatzikokolakis, K., Palamidessi, C., Panangaden, P.: Anonymity protocols as noisy channels. Inf. and Comp. 206(2-4), 378–401 (2008)
Clark, D., Hunt, S., Malacaria, P.: Quantified interference for a while language. In: Proc. of QAPL 2004. ENTCS, vol. 112, pp. 149–166. Elsevier, Amsterdam (2005)
Cover, T.M., Thomas, J.A.: Elements of Information Theory. J. Wiley & Sons, Inc., Chichester (1991)
Deng, Y., Chothia, T., Palamidessi, C., Pang, J.: Metrics for action-labelled quantitative transition systems. In: Proc. of QAPL. ENTCS, vol. 153, pp. 79–96. Elsevier, Amsterdam (2006)
Desharnais, J., Jagadeesan, R., Gupta, V., Panangaden, P.: The metric analogue of weak bisimulation for probabilistic processes. In: Proc. of LICS, pp. 413–422. IEEE, Los Alamitos (2002)
Ebay website, http://www.ebay.com/
Ebid website, http://www.ebid.net/
Kantorovich, L.: On the transfer of masses (in Russian). Doklady Akademii Nauk 5(1), 1–4 (1942); Translated in Management Science 5(1), 1–4 (1958)
Malacaria, P.: Assessing security threats of looping constructs. In: Proc. of POPL, pp. 225–235. ACM, New York (2007)
Massey, J.L.: Causality, feedback and directed information. In: Proc. of the 1990 Intl. Symposium on Information Theory and its Applications (1990)
Mercadolibre website, http://www.mercadolibre.com/
Segala, R.: Modeling and Verification of Randomized Distributed Real-Time Systems. PhD thesis. Tech. Rep. MIT/LCS/TR-676 (1995)
Smith, G.: On the foundations of quantitative information flow. In: de Alfaro, L. (ed.) FOSSACS 2009. LNCS, vol. 5504, pp. 288–302. Springer, Heidelberg (2009)
Stajano, F., Anderson, R.J.: The cocaine auction protocol: On the power of anonymous broadcast. In: Information Hiding, pp. 434–447 (1999)
Subramanian, S.: Design and verification of a secure electronic auction protocol. In: Proc. of SRDS, pp. 204–210. IEEE, Los Alamitos (1998)
Tatikonda, S., Mitter, S.K.: The capacity of channels with feedback. IEEE Transactions on Information Theory 55(1), 323–349 (2009)
van Breugel, F., Worrell, J.: Towards quantitative verification of probabilistic transition systems. In: Orejas, F., Spirakis, P.G., van Leeuwen, J. (eds.) ICALP 2001. LNCS, vol. 2076, pp. 421–432. Springer, Heidelberg (2001)
Vickrey, W.: Counterspeculation, Auctions, and Competitive Sealed Tenders. The Journal of Finance 16(1), 8–37 (1961)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Alvim, M.S., Andrés, M.E., Palamidessi, C. (2010). Information Flow in Interactive Systems. In: Gastin, P., Laroussinie, F. (eds) CONCUR 2010 - Concurrency Theory. CONCUR 2010. Lecture Notes in Computer Science, vol 6269. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-15375-4_8
Download citation
DOI: https://doi.org/10.1007/978-3-642-15375-4_8
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-15374-7
Online ISBN: 978-3-642-15375-4
eBook Packages: Computer ScienceComputer Science (R0)