Studying Maximum Information Leakage Using Karush-Kuhn-Tucker Conditions

Han Chen
(School of Electronic Engineering and Computer Science, Queen Mary University of London)
Pasquale Malacaria
(School of Electronic Engineering and Computer Science, Queen Mary University of London)

When studying the information leakage in programs or protocols, a natural question arises: "what is the worst case scenario?". This problem of identifying the maximal leakage can be seen as a channel capacity problem in the information theoretical sense. In this paper, by combining two powerful theories: Information Theory and Karush-Kuhn-Tucker conditions, we demonstrate a very general solution to the channel capacity problem. Examples are given to show how our solution can be applied to practical contexts of programs and anonymity protocols, and how this solution generalizes previous approaches to this problem.

In Michele Boreale and Steve Kremer: Proceedings 7th International Workshop on Security Issues in Concurrency (SECCO 2009), Bologna, Italy, 5th September 2009, Electronic Proceedings in Theoretical Computer Science 7, pp. 1–15.
Published: 23rd October 2009.

ArXived at: http://dx.doi.org/10.4204/EPTCS.7.1 bibtex PDF

Comments and questions to: eptcs@eptcs.org
For website issues: webmaster@eptcs.org