TY - GEN
T1 - A Simple Low Complexity Locally Private Compression Scheme
AU - Jaggi, Sidharth
AU - Vatedka, Shashank
AU - Chandar, Venkat
AU - Tchamkerten, Aslan
N1 - Publisher Copyright:
© 2025 IEEE.
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 -