A coding theorem for secret sharing communication systems with two Gaussian wiretap channels

1 May 1991

journal article
Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory

Vol. 37 (3) , 634-638
https://doi.org/10.1109/18.79919

Abstract

A coding theorem is proved for the secret sharing communication system (SSCS) with two Gaussian wiretap channels. This communication system is an extension of both the SSCS with two noiseless channels and the Gaussian wiretap channel (GWC). The admissible region of rates and security levels for the SSCS with two GWCs is described by the capacities and secrecy capacities of two GWCs. The following three cases are considered: two wiretappers cannot cooperate with each other: they can cooperate to decipher the transmitted information; and it is not known whether they can cooperate or not.

Keywords

This publication has 5 references indexed in Scilit:

Coding theorem for secret sharing communication systems with two noisy channels
IEEE Transactions on Information Theory, 1989
On secret sharing communication systems with two or three channels
IEEE Transactions on Information Theory, 1986
On secret sharing systems
IEEE Transactions on Information Theory, 1983
The Gaussian wire-tap channel
IEEE Transactions on Information Theory, 1978
Communication Theory of Secrecy Systems*
Bell System Technical Journal, 1949