{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,12]],"date-time":"2025-10-12T04:02:58Z","timestamp":1760241778144,"version":"build-2065373602"},"reference-count":27,"publisher":"MDPI AG","issue":"9","license":[{"start":{"date-parts":[[2018,9,5]],"date-time":"2018-09-05T00:00:00Z","timestamp":1536105600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Entropy"],"abstract":"<jats:p>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\u2019s Bayes\u2013Nash equilibrium strategies are equivalent to the solutions of the convex programming problem. Moreover, the adversary\u2019s equilibrium strategies correspond to a robust inference problem.<\/jats:p>","DOI":"10.3390\/e20090675","type":"journal-article","created":{"date-parts":[[2018,9,6]],"date-time":"2018-09-06T02:55:07Z","timestamp":1536202507000},"page":"675","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Optimal Channel Design: A Game Theoretical Analysis"],"prefix":"10.3390","volume":"20","author":[{"given":"MHR.","family":"Khouzani","sequence":"first","affiliation":[{"name":"School of Electronic Engineering and Computer Science, Queen Mary University of London, Mile End Road, London E1 4NS, UK"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pasquale","family":"Malacaria","sequence":"additional","affiliation":[{"name":"School of Electronic Engineering and Computer Science, Queen Mary University of London, Mile End Road, London E1 4NS, UK"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"1968","published-online":{"date-parts":[[2018,9,5]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","unstructured":"Khouzani, M., and Malacaria, P. (July, January 27). Relative Perfect Secrecy: Universally Optimal Strategies and Channel Design. Proceedings of the 29th Computer Security Foundations Symposium (CSF 2016), Lisbon, Portugal.","DOI":"10.1109\/CSF.2016.12"},{"key":"ref_2","doi-asserted-by":"crossref","unstructured":"Khouzani, M., and Malacaria, P. (2017, January 21\u201325). Leakage-Minimal Design: Universality, Limitations, and Applications. Computer Security Foundations Symposium. Proceedings of the IEEE 30th Computer Security Foundations Symposium, Santa Barbara, CA, USA.","DOI":"10.1109\/CSF.2017.40"},{"key":"ref_3","doi-asserted-by":"crossref","unstructured":"Heusser, J., and Malacaria, P. (2010, January 6\u201310). Quantifying information leaks in software. Proceedings of the 26th Annual Computer Security Applications Conference (ACSAC 2010), Austin, TX, USA.","DOI":"10.1145\/1920261.1920300"},{"key":"ref_4","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/2756550","article-title":"CacheAudit: A tool for the static analysis of cache side channels","volume":"18","author":"Doychev","year":"2015","journal-title":"ACM Trans. Inf. Syst. Secur. (TISSEC)"},{"key":"ref_5","doi-asserted-by":"crossref","unstructured":"McIver, A., Morgan, C., and Rabehaja, T. (2015, January 6\u201310). Abstract hidden Markov models: A monadic account of quantitative information flow. Proceedings of the 30th Annual ACM\/IEEE Symposium on Logic in Computer Science (LICS 2015), Kyoto, Japan.","DOI":"10.1109\/LICS.2015.61"},{"key":"ref_6","doi-asserted-by":"crossref","unstructured":"Alvim, M.S., Chatzikokolakis, K., McIver, A., Morgan, C., Palamidessi, C., and Smith, G. (2014, January 19\u201322). Additive and multiplicative notions of leakage, and their capacities. Proceedings of the 27th Computer Security Foundations Symposium (CSF 2014), Vienna, Austria.","DOI":"10.1109\/CSF.2014.29"},{"key":"ref_7","doi-asserted-by":"crossref","first-page":"965","DOI":"10.1145\/293347.293350","article-title":"Private information retrieval","volume":"45","author":"Chor","year":"1998","journal-title":"J. ACM"},{"key":"ref_8","doi-asserted-by":"crossref","first-page":"720","DOI":"10.1108\/14684520910985693","article-title":"H(k)-Private information retrieval from privacy-uncooperative queryable databases","volume":"33","author":"Solanas","year":"2009","journal-title":"Online Inf. Rev."},{"key":"ref_9","doi-asserted-by":"crossref","unstructured":"Gervais, A., Shokri, R., Singla, A., Capkun, S., and Lenders, V. (2014, January 3\u20137). Quantifying web-search privacy. Proceedings of the 21st ACM SIGSAC Conference on Computer and Communications Security (CCS 2014), Scottsdale, AK, USA.","DOI":"10.1145\/2660267.2660367"},{"key":"ref_10","doi-asserted-by":"crossref","unstructured":"Khoshgozaran, A., and Shahabi, C. (2009). Private information retrieval techniques for enabling location privacy in location-based services. Privacy in Location-Based Applications, Springer.","DOI":"10.1007\/978-3-642-03511-1_3"},{"key":"ref_11","doi-asserted-by":"crossref","unstructured":"Ardagna, C.A., Cremonini, M., Damiani, E., Di Vimercati, S.D.C., and Samarati, P. (2007). Location privacy protection through obfuscation-based techniques. Data and Applications Security XXI, Springer.","DOI":"10.1007\/978-3-540-73538-0_4"},{"key":"ref_12","doi-asserted-by":"crossref","first-page":"838","DOI":"10.1109\/TIFS.2013.2253320","article-title":"Utility-privacy tradeoffs in databases: An information-theoretic approach","volume":"8","author":"Sankar","year":"2013","journal-title":"IEEE Trans. Inf. Forensic Secur."},{"key":"ref_13","doi-asserted-by":"crossref","unstructured":"Alvim, M.S., Chatzikokolakis, K., Kawamoto, Y., and Palamidessi, C. (2017). Information leakage games. International Conference on Decision and Game Theory for Security, Springer.","DOI":"10.1007\/978-3-319-68711-7_23"},{"key":"ref_14","first-page":"1367","article-title":"Game theory, maximum entropy, minimum discrepancy and robust Bayesian decision theory","volume":"32","author":"Dawid","year":"2004","journal-title":"Ann. Stat."},{"key":"ref_15","first-page":"28","article-title":"New non-additive measures of entropy for discrete probability distributions","volume":"10","author":"Sharma","year":"1975","journal-title":"J. Math. Sci."},{"key":"ref_16","first-page":"30","article-title":"Quantification method of classification processes. Concept of structural \u03b1-entropy","volume":"3","author":"Havrda","year":"1967","journal-title":"Kybernetika"},{"key":"ref_17","doi-asserted-by":"crossref","first-page":"479","DOI":"10.1007\/BF01016429","article-title":"Possible generalization of Boltzmann-Gibbs statistics","volume":"52","author":"Tsallis","year":"1988","journal-title":"J. Stat. Phys."},{"key":"ref_18","doi-asserted-by":"crossref","unstructured":"Alvim, M.S., Chatzikokolakis, K., Palamidessi, C., and Smith, G. (2012, January 25\u201327). Measuring Information Leakage Using Generalized Gain Functions. Proceedings of the 25th Computer Security Foundations Symposium (CSF 2012), Cambridge, MA, USA.","DOI":"10.1109\/CSF.2012.26"},{"key":"ref_19","doi-asserted-by":"crossref","unstructured":"Alvim, M.S., Chatzikokolakis, K., McIver, A., Morgan, C., Palamidessi, C., and Smith, G. (July, January 27). Axioms for Information Leakage. Proceedings of the 29th Computer Security Foundations Symposium (CSF 2016), Lisbon, Portugal.","DOI":"10.1109\/CSF.2016.13"},{"key":"ref_20","doi-asserted-by":"crossref","unstructured":"Theodorakopoulos, G., Shokri, R., Troncoso, C., Hubaux, J.P., and Le Boudec, J.Y. (2014, January 3). Prolonging the Hide-and-Seek Game: Optimal Trajectory Privacy for Location-Based Services. Proceedings of the 13th Workshop on Privacy in the Electronic Society, Scottsdale, AZ, USA.","DOI":"10.1145\/2665943.2665946"},{"key":"ref_21","doi-asserted-by":"crossref","unstructured":"K\u00f6pf, B., and Durmuth, M. (2009, January 8\u201310). A provably secure and efficient countermeasure against timing attacks. Proceedings of the 22nd Computer Security Foundations Symposium (CSF 2009), Port Jefferson, NY, USA.","DOI":"10.1109\/CSF.2009.21"},{"key":"ref_22","doi-asserted-by":"crossref","unstructured":"K\u00f6pf, B., and Smith, G. (2010, January 17\u201319). Vulnerability bounds and leakage resilience of blinded cryptography under timing attacks. Proceedings of the 23rd Computer Security Foundations Symposium (CSF 2010), Edinburgh, UK.","DOI":"10.1109\/CSF.2010.11"},{"key":"ref_23","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1007\/s10479-007-0186-0","article-title":"A survey of recent developments in multiobjective optimization","volume":"154","author":"Chinchuluun","year":"2007","journal-title":"Ann. Oper. Res."},{"key":"ref_24","doi-asserted-by":"crossref","unstructured":"Boyd, S., and Vandenberghe, L. (2004). Convex Optimization, Cambridge University Press.","DOI":"10.1017\/CBO9780511804441"},{"key":"ref_25","doi-asserted-by":"crossref","unstructured":"Nesterov, Y., and Nemirovskii, A. (1994). Interior-Point Polynomial Algorithms in Convex Programming, SIAM.","DOI":"10.1137\/1.9781611970791"},{"key":"ref_26","unstructured":"Rockafellar, R.T. (2015). Convex Analysis, Princeton University Press."},{"key":"ref_27","doi-asserted-by":"crossref","first-page":"128","DOI":"10.14311\/AP.2018.58.0128","article-title":"\u017dampa\u2019s System Theory: A Comprehensive Theory of Measurement in Dynamic Systems","volume":"58","author":"Urban","year":"2018","journal-title":"Acta Polytech."}],"container-title":["Entropy"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1099-4300\/20\/9\/675\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T15:18:57Z","timestamp":1760195937000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1099-4300\/20\/9\/675"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,9,5]]},"references-count":27,"journal-issue":{"issue":"9","published-online":{"date-parts":[[2018,9]]}},"alternative-id":["e20090675"],"URL":"https:\/\/doi.org\/10.3390\/e20090675","relation":{},"ISSN":["1099-4300"],"issn-type":[{"type":"electronic","value":"1099-4300"}],"subject":[],"published":{"date-parts":[[2018,9,5]]}}}