On the Shannon cipher system with a capacity-limited key-distribution channel
<|reference_start|>On the Shannon cipher system with a capacity-limited key-distribution channel: We consider the Shannon cipher system in a setting where the secret key is delivered to the legitimate receiver via a channel with limited capacity. For this setting, we characterize the achievable region in the space of three figures of merit: the security (measured in terms of the equivocation), the compressibility of the cryptogram, and the distortion associated with the reconstruction of the plaintext source. Although lossy reconstruction of the plaintext does not rule out the option that the (noisy) decryption key would differ, to a certain extent, from the encryption key, we show, nevertheless, that the best strategy is to strive for perfect match between the two keys, by applying reliable channel coding to the key bits, and to control the distortion solely via rate-distortion coding of the plaintext source before the encryption. In this sense, our result has a flavor similar to that of the classical source-channel separation theorem. Some variations and extensions of this model are discussed as well.<|reference_end|>
@article{merhav2005on,
    title={On the Shannon cipher system with a capacity-limited key-distribution
  channel},
    author={Neri Merhav},
    journal={arXiv preprint arXiv:cs/0505012},
    year={2005},
    number={CCIT Report #530, Department of Electrical Engineering, Technion,
  May 2005},
    archivePrefix={arXiv},
    eprint={cs/0505012},
    primaryClass={cs.IT math.IT}
}