Lossy compression with privacy constraints: Optimality of polar codes

Farshid Mokhtarinezhad, Jorg Kliewer, Osvaldo Simeone

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

1 Scopus citations

Abstract

A lossy source coding problem with privacy constraint is studied in which two correlated discrete sources X and Y are compressed into a reconstruction X with some prescribed distortion D. In addition, a privacy constraint is specified as the equivocation between the lossy reconstruction X and Y. This models the situation where a certain amount of source information from one user is provided as utility (given by the fidelity of its reconstruction) to another user or the public, while some other correlated part of the source information Y must be kept private. In this work, we show that polar codes are able, possibly with the aid of time sharing, to achieve any point in the optimal rate-distortion-equivocation region identified by Yamamoto, thus providing a constructive scheme that obtains the optimal tradeoff between utility and privacy in this framework.

Original languageEnglish (US)
Title of host publicationITW 2015 - 2015 IEEE Information Theory Workshop
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages182-186
Number of pages5
ISBN (Electronic)9781467378529
DOIs
StatePublished - Dec 17 2015
EventIEEE Information Theory Workshop, ITW 2015 - Jeju Island, Korea, Republic of
Duration: Oct 11 2015Oct 15 2015

Publication series

NameITW 2015 - 2015 IEEE Information Theory Workshop

Other

OtherIEEE Information Theory Workshop, ITW 2015
CountryKorea, Republic of
CityJeju Island
Period10/11/1510/15/15

All Science Journal Classification (ASJC) codes

  • Information Systems

Cite this