Compression with Privacy-Preserving Random Access

It is shown that an i.i.d. binary source sequence $X_1,\dots ,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\mathrm{\ne }i\}$.