Optimal Channel Design: A Game Theoretical Analysis

This paper studies the problem of optimal channel design. For a given input probability distribution and for hard and soft design constraints, the aim here is to design a (probabilistic) channel whose output leaks minimally from its input. To analyse this problem, general notions of entropy and information leakage are introduced. It can be shown that, for all notions of leakage here defined, the optimal channel design problem can be solved using convex programming with zero duality gap. Subsequently, the optimal channel design problem is studied in a game-theoretical framework: games allow for analysis of optimal strategies of both the defender and the adversary. It is shown that all channel design problems can be studied in this game-theoretical framework, and that the defender’s Bayes–Nash equilibrium strategies are equivalent to the solutions of the convex programming problem. Moreover, the adversary’s equilibrium strategies correspond to a robust inference problem.

[1]  H. Vincent Poor,et al.  Utility-Privacy Tradeoffs in Databases: An Information-Theoretic Approach , 2011, IEEE Transactions on Information Forensics and Security.

[2]  丸山 徹.  Convex Analysisの二,三の進展について , 1977 .

[3]  Geoffrey Smith,et al.  Vulnerability Bounds and Leakage Resilience of Blinded Cryptography under Timing Attacks , 2010, 2010 23rd IEEE Computer Security Foundations Symposium.

[4]  Mário S. Alvim,et al.  Measuring Information Leakage Using Generalized Gain Functions , 2012, 2012 IEEE 25th Computer Security Foundations Symposium.

[5]  Mário S. Alvim,et al.  Information Leakage Games , 2017, GameSec.

[6]  Markus Dürmuth,et al.  A Provably Secure and Efficient Countermeasure against Timing Attacks , 2009, 2009 22nd IEEE Computer Security Foundations Symposium.

[7]  A. Dawid,et al.  Game theory, maximum entropy, minimum discrepancy and robust Bayesian decision theory , 2004, math/0410076.

[8]  Eyal Kushilevitz,et al.  Private information retrieval , 1998, JACM.

[9]  Ernesto Damiani,et al.  Location Privacy Protection Through Obfuscation-Based Techniques , 2007, DBSec.

[10]  Annabelle McIver,et al.  Abstract Hidden Markov Models: A Monadic Account of Quantitative Information Flow , 2015, 2015 30th Annual ACM/IEEE Symposium on Logic in Computer Science.

[11]  Stephen P. Boyd,et al.  Convex Optimization , 2004, Algorithms and Theory of Computation Handbook.

[12]  Jan Reineke,et al.  CacheAudit: A Tool for the Static Analysis of Cache Side Channels , 2013, TSEC.

[13]  Mário S. Alvim,et al.  Axioms for Information Leakage , 2016, 2016 IEEE 29th Computer Security Foundations Symposium (CSF).

[14]  Pasquale Malacaria,et al.  Quantifying information leaks in software , 2010, ACSAC '10.

[15]  Carmela Troncoso,et al.  Prolonging the Hide-and-Seek Game: Optimal Trajectory Privacy for Location-Based Services , 2014, WPES.

[16]  Cyrus Shahabi,et al.  Private Information Retrieval Techniques for Enabling Location Privacy in Location-Based Services , 2009, Privacy in Location-Based Applications.

[17]  Pasquale Malacaria,et al.  Relative Perfect Secrecy: Universally Optimal Strategies and Channel Design , 2016, 2016 IEEE 29th Computer Security Foundations Symposium (CSF).

[18]  Srdjan Capkun,et al.  Quantifying Web-Search Privacy , 2014, CCS.

[19]  Jan Havrda,et al.  Quantification method of classification processes. Concept of structural a-entropy , 1967, Kybernetika.

[20]  Panos M. Pardalos,et al.  A survey of recent developments in multiobjective optimization , 2007, Ann. Oper. Res..

[21]  Mário S. Alvim,et al.  Additive and Multiplicative Notions of Leakage, and Their Capacities , 2014, 2014 IEEE 27th Computer Security Foundations Symposium.

[22]  C. Tsallis.  Possible generalization of Boltzmann-Gibbs statistics , 1988 .

[23]  Jan Urban,et al.  Žampa's systems theory: a comprehensive theory of measurement in dynamic systems , 2017, ArXiv.

[24]  Josep Domingo-Ferrer,et al.  H(k)-private Information Retrieval from Privacy-uncooperative Queryable Databases.">h(k)-private Information Retrieval from Privacy-uncooperative Queryable Databases , 2009, Online Inf. Rev..

[25]  Yurii Nesterov,et al.  Interior-point polynomial algorithms in convex programming , 1994, Siam studies in applied mathematics.

[26]  Pasquale Malacaria,et al.  Leakage-Minimal Design: Universality, Limitations, and Applications , 2017, 2017 IEEE 30th Computer Security Foundations Symposium (CSF).