Studying Maximum Information Leakage Using Karush-Kuhn-Tucker Conditions

Details Studying Maximum Information Leakage Using Karush-Kuhn-Tucker Conditions Studying Maximum Information Leakage Using Karush-Kuhn-Tucker Conditions

2009-10-21

arxiv.org/abs/0910.4033v1

EPTCS 7, 2009, pp. 1-15

Computer Science

Cryptography and Security

Scientific paper

10.4204/EPTCS.7.1

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.

Affiliated with

Also associated with

No associations

Rating

Studying Maximum Information Leakage Using Karush-Kuhn-Tucker Conditions does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Studying Maximum Information Leakage Using Karush-Kuhn-Tucker Conditions, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Studying Maximum Information Leakage Using Karush-Kuhn-Tucker Conditions will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-143828