Compression with Privacy-Preserving Random Access
Information Theory
2025-11-19 v1 Cryptography and Security
Data Structures and Algorithms
math.IT
Abstract
It is shown that an i.i.d. binary source sequence can be losslessly compressed at any rate above entropy such that the individual decoding of any reveals \emph{no} information about the other bits .
Keywords
Cite
@article{arxiv.2511.14524,
title = {Compression with Privacy-Preserving Random Access},
author = {Venkat Chandar and Aslan Tchamkerten and Shashank Vatedka},
journal= {arXiv preprint arXiv:2511.14524},
year = {2025}
}