English
Related papers

Related papers: Lossy Compression with Privacy Constraints: Optima…

200 papers

The problem of preserving privacy when a multivariate source is required to be revealed partially to multiple users is modeled as a Gray-Wyner source coding problem with K correlated sources at the encoder and K decoders in which the kth…

Information Theory · Computer Science 2011-06-13 Ravi Tandon , Lalitha Sankar , H. Vincent Poor

We study lossy compression of a finite statement source generated in a fixed deductive environment. The source symbols are statements in a knowledge base endowed with a shared proof system, and reconstruction fidelity is measured by…

Information Theory · Computer Science 2026-05-29 Jianfeng Xu

I investigate the generic problem of lossy compression of a fluctuating stochastic signal $X$ into a discrete representation $Z$ through optimal thresholding. The signal modulates transition rates of a two-state system described by a binary…

Statistical Mechanics · Physics 2025-11-07 Jonas Berx

This paper studies a Shannon-theoretic version of the generalized distribution preserving quantization problem where a stationary and memoryless source is encoded subject to a distortion constraint and the additional requirement that the…

Information Theory · Computer Science 2015-07-10 Naci Saldi , Tamás Linder , Serdar Yüksel

Perception-aware lossy source coding has attracted significant recent interest. It augments the classical distortion criterion with an explicit perception constraint, thereby enabling more refined control over fidelity and perceptual…

Information Theory · Computer Science 2026-04-22 Ali Hussein , Jun Chen , Chao Tian , S. Sandeep Pradhan

We study a lossy source coding problem for a memoryless remote source. The source data is broadcast over an arbitrarily varying channel (AVC) controlled by an adversary. One output of the AVC is received as input at the encoder, and another…

Information Theory · Computer Science 2017-04-26 Amitalok J. Budkuley , Bikash Kumar Dey , Vinod M. Prabhakaran

In this work, a likelihood encoder is studied in the context of lossy source compression. The analysis of the likelihood encoder is based on a soft-covering lemma. It is demonstrated that the use of a likelihood encoder together with the…

Information Theory · Computer Science 2014-04-24 Eva C. Song , Paul Cuff , H. Vincent Poor

A new approach to data compression is developed and applied to multimedia content. This method separates messages into components suitable for both lossless coding and 'lossy' or statistical coding techniques, compressing complex objects by…

Information Theory · Computer Science 2011-12-26 John Scoville

We study the problem of maximizing privacy of data sets by adding random vectors generated via synchronized chaotic oscillators. In particular, we consider the setup where information about data sets, queries, is sent through public…

Systems and Control · Computer Science 2019-07-17 Carlos Murguia , Iman Shames , Farhad Farokhi , Dragan Nesic

The problem of private information "leakage" (inadvertently or by malicious design) from the myriad large centralized searchable data repositories drives the need for an analytical framework that quantifies unequivocally how safe private…

Information Theory · Computer Science 2010-02-09 Lalitha Sankar , S. Raj Rajagopalan , H. Vincent Poor

We study a multi-task private semantic communication problem, in which an encoder has access to an information source arbitrarily correlated with some latent private data. A user has $L$ tasks with priorities. The encoder designs a message…

Information Theory · Computer Science 2024-05-15 Amirreza Zamani , Sajad Daei , Tobias J. Oechtering , Mikael Skoglund

The design of a statistical signal processing privacy problem is studied where the private data is assumed to be observable. In this work, an agent observes useful data $Y$, which is correlated with private data $X$, and wants to disclose…

Information Theory · Computer Science 2023-09-19 Amirreza Zamani , Tobias J. Oechtering , Mikael Skoglund

Integer data is typically made differentially private by adding noise from a Discrete Laplace (or Discrete Gaussian) distribution. We study the setting where differential privacy of a counting query is achieved using bit-wise randomized…

Information Theory · Computer Science 2023-11-17 David Rasmussen Lolck , Rasmus Pagh

We consider the distributed source coding problem in which correlated data picked up by scattered sensors has to be encoded separately and transmitted to a common receiver, subject to a rate-distortion constraint. Although near-tooptimal…

Information Theory · Computer Science 2008-09-09 G. Maierbacher , J. Barros

In this work, fundamental limits and optimal mechanisms of privacy-preserving data release that aims to minimize the privacy leakage under utility constraints of a set of multiple tasks are investigated. While the private feature to be…

Information Theory · Computer Science 2024-09-04 Ta-Yuan Liu , I-Hsiang Wang

Achieving information-theoretic security using explicit coding scheme in which unlimited computational power for eavesdropper is assumed, is one of the main topics is security consideration. It is shown that polar codes are capacity…

We consider a setup in which confidential i.i.d. samples $X_1,\dotsc,X_n$ from an unknown finite-support distribution $\boldsymbol{p}$ are passed through $n$ copies of a discrete privatization channel (a.k.a. mechanism) producing outputs…

Machine Learning · Computer Science 2018-11-30 Adriano Pastore , Michael Gastpar

This paper takes a rate-distortion approach to understanding the information-theoretic laws governing cache-aided communications systems. Specifically, we characterise the optimal tradeoffs between the delivery rate, cache capacity and…

Information Theory · Computer Science 2016-10-25 Roy Timo , Shirin Saeedi Bidokhti , Michèle Wigger , Bernhard C. Geiger

Barcodes like QR Codes have made that encoded messages have entered our everyday life, what suggests to attach them a second layer of information: directly available to human receiver for informational or marketing purposes. We will discuss…

Information Theory · Computer Science 2012-12-04 Jarek Duda

Secure data compression in the presence of side information at both a legitimate receiver and an eavesdropper is explored. A noise-free, limited rate link between the source and the receiver, whose output can be perfectly observed by the…

Information Theory · Computer Science 2016-11-17 Deniz Gunduz , Elza Erkip , H. Vincent Poor