Quantitative information flow under generic leakage functions and adaptive adversaries

M. Boreale; Francesca Pampaloni

doi:10.2168/LMCS-11(4:5)2015

M. Boreale ; Francesca Pampaloni - Quantitative information flow under generic leakage functions and adaptive adversaries

lmcs:1606 - Logical Methods in Computer Science, November 10, 2015, Volume 11, Issue 4 - https://doi.org/10.2168/LMCS-11(4:5)2015

Quantitative information flow under generic leakage functions and adaptive adversariesArticle

Authors: M. Boreale ; Francesca Pampaloni

We put forward a model of action-based randomization mechanisms to analyse quantitative information flow (QIF) under generic leakage functions, and under possibly adaptive adversaries. This model subsumes many of the QIF models proposed so far. Our main contributions include the following: (1) we identify mild general conditions on the leakage function under which it is possible to derive general and significant results on adaptive QIF; (2) we contrast the efficiency of adaptive and non-adaptive strategies, showing that the latter are as efficient as the former in terms of length up to an expansion factor bounded by the number of available actions; (3) we show that the maximum information leakage over strategies, given a finite time horizon, can be expressed in terms of a Bellman equation. This can be used to compute an optimal finite strategy recursively, by resorting to standard methods like backward induction.

https://doi.org/10.2168/LMCS-11(4:5)2015

Source: arXiv.org:1507.05766

Volume: Volume 11, Issue 4

Published on: November 10, 2015

Submitted on: December 9, 2014

Keywords: Computer Science - Logic in Computer Science,Computer Science - Cryptography and Security

Licence: arXiv.org - Non-exclusive license to distribute

Classifications

Mathematics Subject Classification 2020¹

68P30 - Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science)

Sources:

[1] zbMATH Open.

Bibliographic References

10 Documents citing this article

Mário S. Alvim;Konstantinos Chatzikokolakis;Yusuke Kawamoto;Catuscia Palamidessi, 2022, Information Leakage Games: Exploring Information as a Utility Function, ACM Transactions on Privacy and Security, 25, 3, pp. 1-36, 10.1145/3517330, https://doi.org/10.1145/3517330.

Tachio Terauchi;Timos Antonopoulos, 2020, Bucketing and information flow analysis for provable timing attack mitigation, Journal of Computer Security, 28, 6, pp. 607-634, 10.3233/jcs-191356.

David Mestel, arXiv (Cornell University), Quantifying Information Flow in Interactive Systems, 34, pp. 414-41413, 2019, Hoboken, NJ, USA, 10.1109/csf.2019.00035, https://arxiv.org/abs/1905.04332.

Itsaka Rakotonirina;Boris Kopf, 2019 IEEE European Symposium on Security and Privacy (EuroS&P), On Aggregation of Information in Timing Attacks, pp. 387-400, 2019, Stockholm, Sweden, 10.1109/eurosp.2019.00036.

Timos Antonopoulos;Tachio Terauchi, 2019 IEEE 32nd Computer Security Foundations Symposium (CSF), Games for Security Under Adaptive Adversaries, pp. 216-21613, 2019, Hoboken, NJ, USA, 10.1109/csf.2019.00022.

Arthur Américo;Mário S. Alvim;Annabelle McIver, arXiv (Cornell University), An Algebraic Approach for Reasoning About Information Flow, pp. 55-72, 2018, 10.1007/978-3-319-95582-7_4, https://arxiv.org/abs/1801.08090.

Mário S. Alvim;Konstantinos Chatzikokolakis;Annabelle McIver;Carroll Morgan;Catuscia Palamidessi;et al., 2018, An axiomatization of information flow measures, Theoretical Computer Science, 777, pp. 32-54, 10.1016/j.tcs.2018.10.016, https://doi.org/10.1016/j.tcs.2018.10.016.

Mário S. Alvim;Konstantinos Chatzikokolakis;Yusuke Kawamoto;Catuscia Palamidessi, 2018, A Game-Theoretic Approach to Information-Flow Control via Protocol Composition, Entropy, 20, 5, pp. 382, 10.3390/e20050382, https://doi.org/10.3390/e20050382.

Mario S. Alvim;Konstantinos Chatzikokolakis;Annabelle McIver;Carroll Morgan;Catuscia Palamidessi;et al., Axioms for Information Leakage, pp. 77-92, 2016, Lisbon, 10.1109/csf.2016.13, https://inria.hal.science/hal-01330414.

Michele Boreale;Fabio Corradi, 2015, Searching secrets rationally, Florence Research (University of Florence), 69, pp. 133-146, 10.1016/j.ijar.2015.11.010, http://hdl.handle.net/2158/1013529.

Sources : OpenCitations, OpenAlex & Crossref

Share and export

Consultation statistics

This page has been seen 1573 times.

This article's PDF has been downloaded 564 times.