Compression with Privacy-Preserving Random Access
Venkat Chandar, Aslan Tchamkerten, Shashank Vatedka

TL;DR
This paper demonstrates a lossless compression scheme for binary sources that allows individual data retrieval without revealing information about other bits, ensuring privacy during random access.
Contribution
It introduces a novel compression method enabling private, lossless random access to individual bits without compromising the privacy of the entire source.
Findings
Achieves lossless compression above entropy rate
Ensures individual bit privacy during decoding
Supports arbitrary random access to source bits
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 .
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsWireless Communication Security Techniques · Random Matrices and Applications · Algorithms and Data Compression
