An Operational Approach to Information Leakage
Ibrahim Issa, Aaron B. Wagner, and Sudeep Kamath

TL;DR
This paper introduces maximal leakage, a new measure of information leakage quantifying how observing one variable increases the probability of guessing a function of another, with theoretical properties, encryption applications, and estimation methods.
Contribution
It defines maximal leakage, provides a closed-form for discrete variables, generalizes to various random variables, and applies it to encryption and privacy measures.
Findings
Closed-form expression for discrete variables
Asymptotic optimal encryption schemes derived
Sample complexity for estimating leakage characterized
Abstract
Given two random variables and , an operational approach is undertaken to quantify the ``leakage'' of information from to . The resulting measure is called \emph{maximal leakage}, and is defined as the multiplicative increase, upon observing , of the probability of correctly guessing a randomized function of , maximized over all such randomized functions. A closed-form expression for is given for discrete and , and it is subsequently generalized to handle a large class of random variables. The resulting properties are shown to be consistent with an axiomatic view of a leakage measure, and the definition is shown to be robust to variations in the setup. Moreover, a variant of the Shannon cipher system is studied, in which performance of an encryption scheme is measured using maximal leakage. A…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
