Show simple item record

dc.contributor.authorChen, Hen_US
dc.contributor.authorMalacaria, Pen_US
dc.date.accessioned2016-07-21T14:56:26Z
dc.date.submitted2016-04-12T12:28:40.000Z
dc.identifier.urihttp://qmro.qmul.ac.uk/xmlui/handle/123456789/13606
dc.description.abstractWhen 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.en_US
dc.relation.ispartofEPTCS 7, 2009, pp. 1-15en_US
dc.rightshttp://arxiv.org/abs/0910.4033v1
dc.subjectcs.CRen_US
dc.subjectcs.CRen_US
dc.subjectcs.ITen_US
dc.subjectcs.LOen_US
dc.subjectcs.PLen_US
dc.subjectmath.ITen_US
dc.titleStudying Maximum Information Leakage Using Karush-Kuhn-Tucker Conditionsen_US
dc.typeArticle
dc.identifier.doi10.4204/EPTCS.7.1en_US
pubs.author-urlhttp://arxiv.org/abs/0910.4033v1en_US
pubs.notesNot knownen_US
pubs.notesInitial upload not completed by author, 12/04/2016; completed on behalf of the author, 14/07/2016, SMen_US
pubs.publisher-urlhttp://dx.doi.org/10.4204/EPTCS.7.1en_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record