Compression with Privacy-Preserving Random Access
Fuente:
arXiv
Gespeichert in:
| Hauptverfasser: | , , |
|---|---|
| Format: | Preprint |
| Veröffentlicht: |
2025
|
| Schlagworte: | |
| Online-Zugang: | |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| _version_ | 1866909911101734912 |
|---|---|
| author | Chandar, Venkat Tchamkerten, Aslan Vatedka, Shashank |
| author_facet | Chandar, Venkat Tchamkerten, Aslan Vatedka, Shashank |
| contents | It is shown that an i.i.d. binary source sequence $X_1, \ldots, X_n$ can be losslessly compressed at any rate above entropy such that the individual decoding of any $X_i$ reveals \emph{no} information about the other bits $\{X_j : j \neq i\}$. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2511_14524 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Compression with Privacy-Preserving Random Access Chandar, Venkat Tchamkerten, Aslan Vatedka, Shashank Information Theory Cryptography and Security Data Structures and Algorithms It is shown that an i.i.d. binary source sequence $X_1, \ldots, X_n$ can be losslessly compressed at any rate above entropy such that the individual decoding of any $X_i$ reveals \emph{no} information about the other bits $\{X_j : j \neq i\}$. |
| title | Compression with Privacy-Preserving Random Access |
| topic | Information Theory Cryptography and Security Data Structures and Algorithms |
| url | https://arxiv.org/abs/2511.14524 |