English
Related papers

Related papers: On the Information Leakage Envelope of the Gaussia…

200 papers

We study privacy guarantees in the framework of pointwise maximal leakage (PML) that satisfy two requirements: they are robust under post-processing and upper bound the failure probability, i.e., the probability that the information leakage…

Cryptography and Security · Computer Science 2026-05-21 Sara Saeidian , Carlos Pinzón , Catuscia Palamidessi

Pointwise maximal leakage (PML) is an operationally meaningful privacy measure that quantifies the amount of information leaking about a secret $X$ to a single outcome of a related random variable $Y$. In this paper, we extend the notion of…

Information Theory · Computer Science 2023-04-18 Sara Saeidian , Giulia Cervia , Tobias J. Oechtering , Mikael Skoglund

Data publishing under privacy constraints can be achieved with mechanisms that add randomness to data points when released to an untrusted party, thereby decreasing the data's utility. In this paper, we analyze this privacy-utility tradeoff…

Information Theory · Computer Science 2024-08-28 Leonhard Grosse , Sara Saeidian , Tobias Oechtering

Pointwise maximal leakage (PML) is a per-outcome privacy measure based on threat models from quantitative information flow. Privacy guarantees with PML rely on knowledge about the distribution that generated the private data. In this work,…

Cryptography and Security · Computer Science 2025-09-29 Leonhard Grosse , Sara Saeidian , Mikael Skoglund , Tobias J. Oechtering

We propose a discrete privacy mechanism exploiting beneficial properties of the novel privacy measure Pointwise Maximal Leakage (PML). Given the utility assignment characterized by every input-output letter pair, we study the mechanism…

Information Theory · Computer Science 2026-05-20 Ci Song , Tobias J. Oechtering

We introduce a privacy measure called pointwise maximal leakage, generalizing the pre-existing notion of maximal leakage, which quantifies the amount of information leaking about a secret $X$ by disclosing a single outcome of a (randomized)…

Information Theory · Computer Science 2023-08-16 Sara Saeidian , Giulia Cervia , Tobias J. Oechtering , Mikael Skoglund

Maximal leakage quantifies the leakage of information from data $X \in \mathcal{X}$ due to an observation $Y$. While fundamental properties of maximal leakage, such as data processing, sub-additivity, and its connection to mutual…

Information Theory · Computer Science 2025-12-24 Anuran Makur , Japneet Singh

We introduce the study of information leakage through \emph{guesswork}, the minimum expected number of guesses required to guess a random variable. In particular, we define \emph{maximal guesswork leakage} as the multiplicative decrease,…

Information Theory · Computer Science 2024-05-07 Gowtham R. Kurri , Malhar Managoli , Vinod M. Prabhakaran

We prove a lower bound on the information leakage of any classical protocol computing the equality function in the simultaneous message passing (SMP) model. Our bound is valid in the finite length regime and is strong enough to demonstrate…

Computational Complexity · Computer Science 2016-07-27 Juan Miguel Arrazola , Dave Touchette

It is often necessary to disclose training data to the public domain, while protecting privacy of certain sensitive labels. We use information theoretic measures to develop such privacy preserving data disclosure mechanisms. Our mechanism…

Information Theory · Computer Science 2019-04-08 Tianrui Xiao , Ashish Khisti

We introduce a privacy measure called statistic maximal leakage that quantifies how much a privacy mechanism leaks about a specific secret, relative to the adversary's prior information about that secret. Statistic maximal leakage is an…

Information Theory · Computer Science 2024-11-28 Shuaiqi Wang , Zinan Lin , Giulia Fanti

This paper explores the implications of guaranteeing privacy by imposing a lower bound on the information density between the private and the public data. We introduce a novel and operationally meaningful privacy measure called pointwise…

Information Theory · Computer Science 2026-03-17 Sara Saeidian , Leonhard Grosse , Parastoo Sadeghi , Mikael Skoglund , Tobias J. Oechtering

A common countermeasure against side-channel attacks on secret key cryptographic implementations is $d$th-order masking, which splits each sensitive variable into $d+1$ random shares. In this paper, maximal leakage bounds on the probability…

Information Theory · Computer Science 2023-05-11 Julien Béguinot , Yi Liu , Olivier Rioul , Wei Cheng , Sylvain Guilley

In this paper, we first introduce the notion of channel leakage as the minimum mutual information between the channel input and channel output. As its name indicates, channel leakage quantifies the minimum information leakage to the…

Information Theory · Computer Science 2020-10-01 Song Fang , Quanyan Zhu

Most methods for publishing data with privacy guarantees introduce randomness into datasets which reduces the utility of the published data. In this paper, we study the privacy-utility tradeoff by taking maximal leakage as the privacy…

Information Theory · Computer Science 2021-05-04 Sara Saeidian , Giulia Cervia , Tobias J. Oechtering , Mikael Skoglund

The problem of publishing privacy-guaranteed data for hypothesis testing is studied using the maximal leakage (ML) as a metric for privacy and the type-II error exponent as the utility metric. The optimal mechanism (random mapping) that…

Information Theory · Computer Science 2017-04-12 Jiachun Liao , Lalitha Sankar , Flavio P. Calmon , Vincent Y. F. Tan

A wiretap channel is served as the fundamental model of physical layer security techniques, where the secrecy capacity of the Gaussian wiretap channel is proven to be achieved by Gaussian input. However, there remains a gap between the…

Information Theory · Computer Science 2024-11-12 Li Shen , Yongpeng Wu , Peihong Yuan , Chengshan Xiao , Xiang-Gen Xia , Wenjun Zhang

This paper introduces a paradigm shift in the way privacy is defined, driven by a novel interpretation of the fundamental result of Dwork and Naor about the impossibility of absolute disclosure prevention. We propose a general model of…

Cryptography and Security · Computer Science 2024-10-28 Sara Saeidian , Giulia Cervia , Tobias J. Oechtering , Mikael Skoglund

The Information Bottleneck (IB) is a conceptual method for extracting the most compact, yet informative, representation of a set of variables, with respect to the target. It generalizes the notion of minimal sufficient statistics from…

Machine Learning · Computer Science 2017-11-08 Amichai Painsky , Naftali Tishby

We introduce a \emph{gain function} viewpoint of information leakage by proposing \emph{maximal $g$-leakage}, a rich class of operationally meaningful leakage measures that subsumes recently introduced leakage measures -- {maximal leakage}…

Information Theory · Computer Science 2023-12-08 Gowtham R. Kurri , Lalitha Sankar , Oliver Kosut
‹ Prev 1 2 3 10 Next ›