On the shannon cipher system with a capacity-limited key-distribution channel

DOI10.1109/TIT.2005.864448zbMATH Open1317.94127arXivcs/0505012WikidataQ121009168 ScholiaQ121009168MaRDI QIDQ3547374

Neri Merhav

Publication date: 21 December 2008

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Abstract: 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.

Full work available at URL: https://arxiv.org/abs/cs/0505012

Mathematics Subject Classification ID

Cryptography (94A60) Coding theorems (Shannon theory) (94A24) Rate-distortion theory in information and communication theory (94A34)

Related Items (1)

Title not available (Why is that?)

This page was built for publication: On the shannon cipher system with a capacity-limited key-distribution channel

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3547374)