Secure Source Coding With a Helper.

We consider a secure lossless source coding problem with a rate-limited helper. In particular, Alice observes an independent and identically distributed (i.i.d.) source X^n and wishes to transmit this source losslessly to Bob over a rate-limited link of capacity not exceeding Rx. A helper, say Helen, observes an i.i.d. correlated source Y^n and can transmit information to Bob over another link of capacity not exceeding Ry. A passive eavesdropper (say Eve) can observe the coded output of Alice, i.e., the link from Alice to Bob is public. The uncertainty about the source X^n at Eve (denoted by \Delta) is measured by the conditional entropy H(X^n\vert Jx)\over{n}, where Jx is the coded output of Alice and n is the block length. We completely characterize the rate-equivocation region for this secure source coding model, where we show that Slepian–Wolf binning of X^n with respect to the coded side information received at Bob is optimal. We next consider a modification of this model in which Alice also has access to the coded output of Helen. We call this model as the two-sided helper model. For the two-sided helper model, we characterize the rate-equivocation region. While the availability of side information at Alice does not reduce the rate of transmission from Alice, it significantly enhances the resulting equivocation at Eve. In particular, the resulting equivocation for the two-sided helper case is shown to be \min (H(X),Ry), i.e., one bit from the two-sided helper provides one bit of uncertainty at Eve. From this result, we infer that Slepian–Wolf binning of X is suboptimal and one can further decrease the information leakage to the eavesdropper by utilizing the side information at Alice. We, finally, generalize both of these results to the case in which there is additional uncoded side information W^n available at Bob and characterize the rate-equivocation regions under the assumption that Y^n\rightarrow X^n\rightarrow W^n forms a Markov chain. [ABSTRACT FROM PUBLISHER]