A Game-Theoretic Approach to Information-Flow Control via Protocol Composition
@article{Alvim2018AGA, title={A Game-Theoretic Approach to Information-Flow Control via Protocol Composition}, author={M{\'a}rio S. Alvim and Konstantinos Chatzikokolakis and Yusuke Kawamoto and Catuscia Palamidessi}, journal={Entropy}, year={2018}, volume={20} }
In the inference attacks studied in Quantitative Information Flow (QIF), the attacker typically tries to interfere with the system in the attempt to increase its leakage of secret information. The defender, on the other hand, typically tries to decrease leakage by introducing some controlled noise. This noise introduction can be modeled as a type of protocol composition, i.e., a probabilistic choice among different protocols, and its effect on the amount of leakage depends heavily on whether or…
8 Citations
Leakage and Protocol Composition in a Game-Theoretic Perspective
- Computer SciencePOST
- 2018
This work considers operators for modeling visible and invisible choice in protocol composition, and studies their algebraic properties, and formalizes the interplay between defender and adversary in a game-theoretic framework adapted to the specific issues of QIF, where the payoff is information leakage.
Information Leakage Games: Exploring Information as a Utility Function
- Computer ScienceACM Transactions on Privacy and Security
- 2022
This article proposes a game-theoretic framework to formalize strategies of attacker and defender in the context of information leakage, and provide a basis for developing optimal defense methods.
10 46 5 v 2 [ cs . C R ] 3 0 M ar 2 01 8 Leakage and Protocol Composition in a Game-Theoretic Perspective ⋆
- Computer Science
- 2018
This work considers operators for modeling visible and invisible choice in protocol composition, and studies their algebraic properties, and formalizes the interplay between defender and adversary in a game-theoretic framework adapted to the specific issues of QIF, where the payoff is information leakage.
Verification and Control of Turn-Based Probabilistic Real-Time Games
- Computer ScienceThe Art of Modelling Computational Systems
- 2019
This work shows how to compute the key measures that underlie quantitative verification, namely the probability and expected cumulative price to reach a target, for the model of turn-based probabilistic timed multi-player games.
Hybrid statistical estimation of mutual information and its application to information flow
- Computer ScienceFormal Aspects of Computing
- 2018
A hybrid statistical estimation method that combines precise and statistical analyses to estimate mutual information, Shannon entropy, and conditional entropy, together with their confidence intervals is proposed and demonstrated with case studies that the new method outperforms the state of the art in quantifying information leakage.
Information Theory in Game Theory
- Computer ScienceEntropy
- 2018
Information theory, as the mathematics of communication and storage of information, and game theory, are each successful fields of research on their own.
Future Security Challenges for Smart Societies: Overview from Technical and Societal Perspectives
- Computer Science2020 International Conference on Smart Grid and Clean Energy Technologies (ICSGCE)
- 2020
This paper stimulates a new concept of societal security, along with a review of various kinds of threats to Society 5.0, to shed light on the risks and threats facing future societies.
Catuscia Palamidessi
- MedicineACM SIGLOG News
- 2020
On the 4th of November 2019, Catuscia was celebrated with an LNCS volume written in her honor, entitled The Art of Modelling Computational Systems: A Journey from Logic and Concurrency to Security and Privacy.
References
SHOWING 1-10 OF 35 REFERENCES
Leakage and Protocol Composition in a Game-Theoretic Perspective
- Computer SciencePOST
- 2018
This work considers operators for modeling visible and invisible choice in protocol composition, and studies their algebraic properties, and formalizes the interplay between defender and adversary in a game-theoretic framework adapted to the specific issues of QIF, where the payoff is information leakage.
Information Leakage Games
- Computer ScienceGameSec
- 2017
This seems the first work to prove formally that in certain cases the optimal attack strategy is necessarily probabilistic, for both the attacker and the defender.
Security Games with Information Leakage: Modeling and Computation
- Computer ScienceIJCAI
- 2015
This work starts with an LP formulation to compute the defender's optimal strategy in the presence of leakage and shows that a key subproblem to solve this LP (more precisely, the defender oracle) is NP-hard even for the simplest of security game models.
Adversarial Leakage in Games
- Computer ScienceSIAM J. Discret. Math.
- 2010
The notion of adversarial leakage in games is introduced, namely, the ability of a player to learn the value of $b$ binary predicates about the strategy instantiation of her opponent.
On the Foundations of Quantitative Information Flow
- Computer ScienceFoSSaCS
- 2009
This paper argues that the consensus definitions of Shannon entropy actually fail to give good security guarantees, and explores an alternative foundation based on a concept of vulnerability and which measures uncertainty using Renyi's min-entropy , rather than Shannon entropy.
On the Compositionality of Quantitative Information Flow
- Computer Science, MathematicsLog. Methods Comput. Sci.
- 2017
This paper studies the case in which the channel associated to the system can be decomposed into simpler channels, which typically happens when the observables consist of multiple components, and derivation of bounds on the (multiplicative version of) $g$-leakage of the whole system in terms of the $g-leaks of its components.
Bridging Game Theory and Cryptography: Recent Results and Future Directions
- Computer Science, MathematicsTCC
- 2008
This work surveys known results in combining the approaches and techniques of game theory and cryptography with those of cryptographic protocol design, and suggests some new definitions along with avenues for future research.
Quantitative information flow under generic leakage functions and adaptive adversaries
- Computer ScienceLog. Methods Comput. Sci.
- 2015
This model subsumes many of the qif models proposed so far and shows that the maximum information leakage over strategies, given a finite time horizon, can be expressed in terms of a Bellman equation.
Relative Perfect Secrecy: Universally Optimal Strategies and Channel Design
- Computer Science, Mathematics2016 IEEE 29th Computer Security Foundations Symposium (CSF)
- 2016
This paper addresses the fundamental question of what is the lowest leakage of information that can be achieved when some of the secrets have to be eliminated by deriving the minimum leakage in closed-form, and explicitly providing "universally optimal" randomized strategies, in the sense that they guarantee the Minimum leakage irrespective of the measure of entropy used to quantify the leakage.
Secure or insure?: a game-theoretic analysis of information security games
- Computer Science, EconomicsWWW
- 2008
In the weakest-target game, an interesting result is that, for almost all parameter settings, more effort is exerted at Nash equilibrium than at the social optimum, which may be attributed to the "strategic uncertainty" of players seeking to self-protect at just slightly above the lowest protection level.