Rate-distortion theory for the Shannon cipher system

Considers Shannon's cipher system with a memoryless broadcast channel. The source output sequence {S/sub l/}/sub t//sup /spl infin//=1 is independent drawings of a random variable S taking values in S, and the key W/sub k/ is a random variable which is independent of S. For simplicity, we assume that the main channel (X/spl rarr/Y) is less noisy than the wiretap channel (X/spl rarr/Z). The security of the system can be measured by the uncertainty or the attainable minimum distortion of the wiretapper who gets only Z/sup N/. For each case, we define the admissible region. >

[1]  Martin E. Hellman,et al.  The Gaussian wire-tap channel , 1978, IEEE Trans. Inf. Theory.

[2]  R. Ahlswede.  Remarks on Shannon's secrecy systems , 1982 .

[3]  Martin E. Hellman,et al.  An extension of the Shannon theory approach to cryptography , 1977, IEEE Trans. Inf. Theory.

[4]  Claude E. Shannon,et al.  Communication theory of secrecy systems , 1949, Bell Syst. Tech. J..

[5]  Rudolf Ahlswede,et al.  Bad codes are good ciphers , 1982 .

[6]  Hirosuke Yamamoto.  Coding theorems for Shannon's cipher system with correlated source outputs, and common information , 1994, IEEE Trans. Inf. Theory.

[7]  Hirosuke Yamamoto.  A rate-distortion problem for a communication system with a secondary decoder to be hindered , 1988, IEEE Trans. Inf. Theory.

[8]  Hirosuke Yamamoto.  Coding theorem for secret sharing communication systems with two noisy channels , 1989, IEEE Trans. Inf. Theory.

[9]  Rolf J. Blom.  Sounds on key equivocation for simple substitution ciphers , 1979, IEEE Trans. Inf. Theory.

[10]  Shyue-Ching Lu,et al.  Addition to 'The Existence of Good Cryptosystems for Key Rates Greater Than the Message Redundancy' , 1980, IEEE Trans. Inf. Theory.

[11]  James George Dunham.  Bounds on message equivocation for simple substitution ciphers , 1980, IEEE Trans. Inf. Theory.

[12]  Hirosuke Yamamoto,et al.  A coding theorem for secret sharing communication systems with two Gaussian wiretap channels , 1991, IEEE Trans. Inf. Theory.

[13]  Shyue-Ching Lu.  Random ciphering bounds on a class of secrecy systems and discrete message sources , 1979, IEEE Trans. Inf. Theory.

[14]  Rolf J. Blom.  An Upper Bound on the Key Equivocation for Pure Ciphers , 1984, IEEE Trans. Inf. Theory.

[15]  Hirosuke Yamamoto,et al.  A source coding problem for sources with additional outputs to keep secret from the receiver or wiretappers , 1983, IEEE Trans. Inf. Theory.

[16]  M. van Dijk.  Broadcast channels with confidential messages, with tampering : the binary symmetric case , 1994 .

[17]  Hirosuke Yamamoto,et al.  Information theory in cryptology , 1991 .

[18]  Andrea Sgarro.  Error probabilities for simple substitution ciphers , 1983, IEEE Trans. Inf. Theory.