English
Related papers

Related papers: Privacy-Utility Trade-offs Under Multi-Level Point…

200 papers

Differential privacy is a notion of privacy that has become very popular in the database community. Roughly, the idea is that a randomized query mechanism provides sufficient privacy protection if the ratio between the probabilities that…

Cryptography and Security · Computer Science 2014-06-18 Mário S. Alvim , Miguel E. Andrés , Konstantinos Chatzikokolakis , Pierpaolo Degano , Catuscia Palamidessi

A scheme that publishes aggregate information about sensitive data must resolve the trade-off between utility to information consumers and privacy of the database participants. Differential privacy is a well-established definition of…

Cryptography and Security · Computer Science 2010-01-18 Mangesh Gupte , Mukund Sundararajan

Each agent in a network makes a local observation that is linearly related to a set of public and private parameters. The agents send their observations to a fusion center to allow it to estimate the public parameters. To prevent leakage of…

Systems and Control · Electrical Eng. & Systems 2020-08-12 Chong Xiao Wang , Yang Song , Wee Peng Tay

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

The privacy-utility tradeoff problem is formulated as determining the privacy mechanism (random mapping) that minimizes the mutual information (a metric for privacy leakage) between the private features of the original dataset and a…

Information Theory · Computer Science 2026-05-12 Kousha Kalantari , Oliver Kosut , Lalitha Sankar

A mechanism for releasing information about a statistical database with sensitive data must resolve a trade-off between utility and privacy. Privacy can be rigorously quantified using the framework of {\em differential privacy}, which…

Databases · Computer Science 2009-03-20 Arpita Ghosh , Tim Roughgarden , Mukund Sundararajan

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 examine the relationship between privacy metrics that utilize information density to measure information leakage between a private and a disclosed random variable. Firstly, we prove that bounding the information density from above or…

Information Theory · Computer Science 2024-02-21 Leonhard Grosse , Sara Saeidian , Parastoo Sadeghi , Tobias J. Oechtering , Mikael Skoglund

The problem of private data disclosure is studied from an information theoretic perspective. Considering a pair of dependent random variables $(X,Y)$, where $X$ and $Y$ denote the private and useful data, respectively, the following problem…

Information Theory · Computer Science 2021-01-25 Borzoo Rassouli , Deniz Gunduz

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

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

In the last years we have witnessed the appearance of a variety of strategies to design optimal location privacy-preserving mechanisms, in terms of maximizing the adversary's expected error with respect to the users' whereabouts. In this…

Cryptography and Security · Computer Science 2017-08-25 Simon Oya , Carmela Troncoso , Fernando Pérez-González

Consider a data publishing setting for a dataset composed by both private and non-private features. The publisher uses an empirical distribution, estimated from $n$ i.i.d. samples, to design a privacy mechanism which is applied to new fresh…

Information Theory · Computer Science 2020-03-23 Mario Diaz , Hao Wang , Flavio P. Calmon , Lalitha Sankar

The pervasiveness of Internet of Things results in vast volumes of personal data generated by smart devices of users (data producers) such as smart phones, wearables and other embedded sensors. It is a common requirement, especially for Big…

Cryptography and Security · Computer Science 2018-05-08 Thomas Asikis , Evangelos Pournaras

A privacy-utility tradeoff is developed for an arbitrary set of finite-alphabet source distributions. Privacy is quantified using differential privacy (DP), and utility is quantified using expected Hamming distortion maximized over the set…

Information Theory · Computer Science 2018-08-02 Kousha Kalantari , Lalitha Sankar , Anand Sarwate

We investigate the tradeoff between privacy and utility in a situation where both privacy and utility are measured in terms of mutual information. For the binary case, we fully characterize this tradeoff in case of perfect privacy and also…

Information Theory · Computer Science 2015-10-09 Shahab Asoodeh , Fady Alajaji , Tamás Linder

Ensuring the usefulness of electronic data sources while providing necessary privacy guarantees is an important unsolved problem. This problem drives the need for an analytical framework that can quantify the safety of personally…

Information Theory · Computer Science 2016-11-18 Lalitha Sankar , S. Raj Rajagopalan , H. Vincent Poor

We introduce a tunable measure for information leakage called maximal alpha-leakage. This measure quantifies the maximal gain of an adversary in inferring any (potentially random) function of a dataset from a release of the data. The…

Information Theory · Computer Science 2019-08-21 Jiachun Liao , Oliver Kosut , Lalitha Sankar , Flavio du Pin Calmon

This paper introduces a multi-round interaction problem with privacy constraints between two agents that observe correlated data. The agents alternately share data with one another for a total of K rounds such that each agent initiates…

Information Theory · Computer Science 2016-10-04 Bahman Moraffah , Lalitha Sankar

Privacy-preserving data release mechanisms aim to simultaneously minimize information-leakage with respect to sensitive data and distortion with respect to useful data. Dependencies between sensitive and useful data results in a…

Information Theory · Computer Science 2017-10-26 Ye Wang , Yuksel Ozan Basciftci , Prakash Ishwar