A Simple Low Complexity Locally Private Compression Scheme

Sidharth Jaggi; Shashank Vatedka; Venkat Chandar; Aslan Tchamkerten

doi:10.1109/ISIT63088.2025.11195450

A Simple Low Complexity Locally Private Compression Scheme

Sidharth Jaggi
, Shashank Vatedka
, Venkat Chandar
, Aslan Tchamkerten

University of Bristol
Indian Institute of Technology Hyderabad
D. E. Shaw and Co.

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

Abstract

It is shown that a memoryless source can be compressed arbitrarily close to its entropy rate while guaranteeing the private local decoding of any source symbol. This is achieved through a remarkably simple compression scheme that effectively separates compression and privacy.

Original language	English
Title of host publication	ISIT 2025 - 2025 IEEE International Symposium on Information Theory, Proceedings
Publisher	Institute of Electrical and Electronics Engineers Inc.
ISBN (Electronic)	9798331543990
DOIs	https://doi.org/10.1109/ISIT63088.2025.11195450
Publication status	Published - 1 Jan 2025
Event	2025 IEEE International Symposium on Information Theory, ISIT 2025 - Ann Arbor, United States Duration: 22 Jun 2025 → 27 Jun 2025

Publication series

Name	IEEE International Symposium on Information Theory - Proceedings
ISSN (Print)	2157-8095

Conference

Conference	2025 IEEE International Symposium on Information Theory, ISIT 2025
Country/Territory	United States
City	Ann Arbor
Period	22/06/25 → 27/06/25

Access to Document

10.1109/ISIT63088.2025.11195450

Cite this

Jaggi, S., Vatedka, S., Chandar, V., & Tchamkerten, A. (2025). A Simple Low Complexity Locally Private Compression Scheme. In ISIT 2025 - 2025 IEEE International Symposium on Information Theory, Proceedings (IEEE International Symposium on Information Theory - Proceedings). Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/ISIT63088.2025.11195450

@inproceedings{b5e567d855824d58aa335996e7808c5c,

title = "A Simple Low Complexity Locally Private Compression Scheme",

abstract = "It is shown that a memoryless source can be compressed arbitrarily close to its entropy rate while guaranteeing the private local decoding of any source symbol. This is achieved through a remarkably simple compression scheme that effectively separates compression and privacy.",

author = "Sidharth Jaggi and Shashank Vatedka and Venkat Chandar and Aslan Tchamkerten",

note = "Publisher Copyright: {\textcopyright} 2025 IEEE.; 2025 IEEE International Symposium on Information Theory, ISIT 2025 ; Conference date: 22-06-2025 Through 27-06-2025",

year = "2025",

month = jan,

day = "1",

doi = "10.1109/ISIT63088.2025.11195450",

language = "English",

series = "IEEE International Symposium on Information Theory - Proceedings",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

booktitle = "ISIT 2025 - 2025 IEEE International Symposium on Information Theory, Proceedings",

}

Jaggi, S, Vatedka, S, Chandar, V & Tchamkerten, A 2025, A Simple Low Complexity Locally Private Compression Scheme. in ISIT 2025 - 2025 IEEE International Symposium on Information Theory, Proceedings. IEEE International Symposium on Information Theory - Proceedings, Institute of Electrical and Electronics Engineers Inc., 2025 IEEE International Symposium on Information Theory, ISIT 2025, Ann Arbor, United States, 22/06/25. https://doi.org/10.1109/ISIT63088.2025.11195450

A Simple Low Complexity Locally Private Compression Scheme. / Jaggi, Sidharth; Vatedka, Shashank; Chandar, Venkat et al.
ISIT 2025 - 2025 IEEE International Symposium on Information Theory, Proceedings. Institute of Electrical and Electronics Engineers Inc., 2025. (IEEE International Symposium on Information Theory - Proceedings).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - A Simple Low Complexity Locally Private Compression Scheme

AU - Jaggi, Sidharth

AU - Vatedka, Shashank

AU - Chandar, Venkat

AU - Tchamkerten, Aslan

PY - 2025/1/1

Y1 - 2025/1/1

N2 - It is shown that a memoryless source can be compressed arbitrarily close to its entropy rate while guaranteeing the private local decoding of any source symbol. This is achieved through a remarkably simple compression scheme that effectively separates compression and privacy.

AB - It is shown that a memoryless source can be compressed arbitrarily close to its entropy rate while guaranteeing the private local decoding of any source symbol. This is achieved through a remarkably simple compression scheme that effectively separates compression and privacy.

UR - https://www.scopus.com/pages/publications/105021922203

U2 - 10.1109/ISIT63088.2025.11195450

DO - 10.1109/ISIT63088.2025.11195450

M3 - Conference contribution

AN - SCOPUS:105021922203

T3 - IEEE International Symposium on Information Theory - Proceedings

BT - ISIT 2025 - 2025 IEEE International Symposium on Information Theory, Proceedings

PB - Institute of Electrical and Electronics Engineers Inc.

T2 - 2025 IEEE International Symposium on Information Theory, ISIT 2025

Y2 - 22 June 2025 through 27 June 2025

ER -

A Simple Low Complexity Locally Private Compression Scheme

Abstract

Publication series

Conference

Access to Document

Other files and links

Fingerprint

Cite this