Studying Maximum Information Leakage Using Karush-Kuhn-Tucker Conditions

Han Chen, Pasquale Malacaria
2009 Electronic Proceedings in Theoretical Computer Science  
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
more » ... cal contexts of programs and anonymity protocols, and how this solution generalizes previous approaches to this problem.
doi:10.4204/eptcs.7.1 fatcat:jthqnxfpdzh6ljvvbuzyfzqery