96 research outputs found
Privacy-Constrained Remote Source Coding
We consider the problem of revealing/sharing data in an efficient and secure
way via a compact representation. The representation should ensure reliable
reconstruction of the desired features/attributes while still preserve privacy
of the secret parts of the data. The problem is formulated as a remote lossy
source coding with a privacy constraint where the remote source consists of
public and secret parts. Inner and outer bounds for the optimal tradeoff region
of compression rate, distortion, and privacy leakage rate are given and shown
to coincide for some special cases. When specializing the distortion measure to
a logarithmic loss function, the resulting rate-distortion-leakage tradeoff for
the case of identical side information forms an optimization problem which
corresponds to the "secure" version of the so-called information bottleneck.Comment: 10 pages, 1 figure, to be presented at ISIT 201
Optimal Equivocation in Secrecy Systems a Special Case of Distortion-based Characterization
Recent work characterizing the optimal performance of secrecy systems has
made use of a distortion-like metric for partial secrecy as a replacement for
the more traditional metric of equivocation. In this work we use the log-loss
function to show that the optimal performance limits characterized by
equivocation are, in fact, special cases of distortion-based counterparts. This
observation illuminates why equivocation doesn't tell the whole story of
secrecy. It also justifies the causal-disclosure framework for secrecy (past
source symbols and actions revealed to the eavesdropper).Comment: Invited to ITA 2013, 3 pages, no figures, using IEEEtran.cl
Information Masking and Amplification: The Source Coding Setting
The complementary problems of masking and amplifying channel state
information in the Gel'fand-Pinsker channel have recently been solved by Merhav
and Shamai, and Kim et al., respectively. In this paper, we study a related
source coding problem. Specifically, we consider the two-encoder source coding
setting where one source is to be amplified, while the other source is to be
masked. In general, there is a tension between these two objectives which is
characterized by the amplification-masking tradeoff. In this paper, we give a
single-letter description of this tradeoff.
We apply this result, together with a recent theorem by Courtade and Weissman
on multiterminal source coding, to solve a fundamental entropy characterization
problem.Comment: 6 pages, 1 figure, to appear at the IEEE 2012 International Symposium
on Information Theory (ISIT 2012
Interactive Relay Assisted Source Coding
This paper investigates a source coding problem in which two terminals
communicating through a relay wish to estimate one another's source within some
distortion constraint. The relay has access to side information that is
correlated with the sources. Two different schemes based on the order of
communication, \emph{distributed source coding/delivery} and \emph{two cascaded
rounds}, are proposed and inner and outer bounds for the resulting
rate-distortion regions are provided. Examples are provided to show that
neither rate-distortion region includes the other one.Comment: Invited Paper submitted to GlobalSIP: IEEE Global Conference on
Signal and Information Processing 201
- …