On information-theoretic privacy with general distortion cost functions

Kousha Kalantari, Lalitha Sankar, Oliver Kosut

Research output: Chapter in Book/Report/Conference proceedingConference contribution

6 Citations (Scopus)

Abstract

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 released version. The minimization is subject to a constraint on the average distortion cost defined as a function f evaluated for every distortion d between the public features and the released version of dataset. The asymptotic optimal leakage is derived both for general and stationary memoryless privacy mechanisms. It is shown that for convex cost functions there is no asymptotic loss in using stationary memoryless mechanisms. Of independent interest are the proof techniques developed here for arbitrary cost functions.

Original languageEnglish (US)
Title of host publication2017 IEEE International Symposium on Information Theory, ISIT 2017
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages2865-2869
Number of pages5
ISBN (Electronic)9781509040964
DOIs
StatePublished - Aug 9 2017
Event2017 IEEE International Symposium on Information Theory, ISIT 2017 - Aachen, Germany
Duration: Jun 25 2017Jun 30 2017

Other

Other2017 IEEE International Symposium on Information Theory, ISIT 2017
CountryGermany
CityAachen
Period6/25/176/30/17

Fingerprint

Cost functions
Privacy
Cost Function
Leakage
Random Mapping
Mutual Information
Convex function
Costs
Trade-offs
Minimise
Metric
Arbitrary

Keywords

  • Distortion cost function
  • Mutual information leakage
  • Privacy utility tradeoff

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Information Systems
  • Modeling and Simulation
  • Applied Mathematics

Cite this

Kalantari, K., Sankar, L., & Kosut, O. (2017). On information-theoretic privacy with general distortion cost functions. In 2017 IEEE International Symposium on Information Theory, ISIT 2017 (pp. 2865-2869). [8007053] Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/ISIT.2017.8007053

On information-theoretic privacy with general distortion cost functions. / Kalantari, Kousha; Sankar, Lalitha; Kosut, Oliver.

2017 IEEE International Symposium on Information Theory, ISIT 2017. Institute of Electrical and Electronics Engineers Inc., 2017. p. 2865-2869 8007053.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Kalantari, K, Sankar, L & Kosut, O 2017, On information-theoretic privacy with general distortion cost functions. in 2017 IEEE International Symposium on Information Theory, ISIT 2017., 8007053, Institute of Electrical and Electronics Engineers Inc., pp. 2865-2869, 2017 IEEE International Symposium on Information Theory, ISIT 2017, Aachen, Germany, 6/25/17. https://doi.org/10.1109/ISIT.2017.8007053
Kalantari K, Sankar L, Kosut O. On information-theoretic privacy with general distortion cost functions. In 2017 IEEE International Symposium on Information Theory, ISIT 2017. Institute of Electrical and Electronics Engineers Inc. 2017. p. 2865-2869. 8007053 https://doi.org/10.1109/ISIT.2017.8007053
Kalantari, Kousha ; Sankar, Lalitha ; Kosut, Oliver. / On information-theoretic privacy with general distortion cost functions. 2017 IEEE International Symposium on Information Theory, ISIT 2017. Institute of Electrical and Electronics Engineers Inc., 2017. pp. 2865-2869
@inproceedings{e17cbe6466dc4ee3b23c75052e6d7965,
title = "On information-theoretic privacy with general distortion cost functions",
abstract = "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 released version. The minimization is subject to a constraint on the average distortion cost defined as a function f evaluated for every distortion d between the public features and the released version of dataset. The asymptotic optimal leakage is derived both for general and stationary memoryless privacy mechanisms. It is shown that for convex cost functions there is no asymptotic loss in using stationary memoryless mechanisms. Of independent interest are the proof techniques developed here for arbitrary cost functions.",
keywords = "Distortion cost function, Mutual information leakage, Privacy utility tradeoff",
author = "Kousha Kalantari and Lalitha Sankar and Oliver Kosut",
year = "2017",
month = "8",
day = "9",
doi = "10.1109/ISIT.2017.8007053",
language = "English (US)",
pages = "2865--2869",
booktitle = "2017 IEEE International Symposium on Information Theory, ISIT 2017",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
address = "United States",

}

TY - GEN

T1 - On information-theoretic privacy with general distortion cost functions

AU - Kalantari, Kousha

AU - Sankar, Lalitha

AU - Kosut, Oliver

PY - 2017/8/9

Y1 - 2017/8/9

N2 - 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 released version. The minimization is subject to a constraint on the average distortion cost defined as a function f evaluated for every distortion d between the public features and the released version of dataset. The asymptotic optimal leakage is derived both for general and stationary memoryless privacy mechanisms. It is shown that for convex cost functions there is no asymptotic loss in using stationary memoryless mechanisms. Of independent interest are the proof techniques developed here for arbitrary cost functions.

AB - 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 released version. The minimization is subject to a constraint on the average distortion cost defined as a function f evaluated for every distortion d between the public features and the released version of dataset. The asymptotic optimal leakage is derived both for general and stationary memoryless privacy mechanisms. It is shown that for convex cost functions there is no asymptotic loss in using stationary memoryless mechanisms. Of independent interest are the proof techniques developed here for arbitrary cost functions.

KW - Distortion cost function

KW - Mutual information leakage

KW - Privacy utility tradeoff

UR - http://www.scopus.com/inward/record.url?scp=85034020135&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85034020135&partnerID=8YFLogxK

U2 - 10.1109/ISIT.2017.8007053

DO - 10.1109/ISIT.2017.8007053

M3 - Conference contribution

AN - SCOPUS:85034020135

SP - 2865

EP - 2869

BT - 2017 IEEE International Symposium on Information Theory, ISIT 2017

PB - Institute of Electrical and Electronics Engineers Inc.

ER -