Lossy compression with privacy constraints: Optimality of polar codes

Document Type

Conference Proceeding

Publication Date

12-17-2015

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.

Identifier

84962712950 (Scopus)

ISBN

[9781467378529]

Publication Title

Itw 2015 2015 IEEE Information Theory Workshop

External Full Text Location

https://doi.org/10.1109/ITWF.2015.7360759

First Page

182

Last Page

186

Grant

CCF-1439465

Fund Ref

National Sleep Foundation

This document is currently not available here.

Share

COinS