A Coding Theorem for Secret Sharing Communication Systems with Two Gaussian Wiretap Channels
Hirosuke Yamamoto
IEEE Trans. on Information Theory, Vol. 37, No.3, pp.634-638, May 1991
- 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 GWC's is described by the capacities and secrecy capacities of two GWC's
- Index Terms: Secret sharing communication system, wiretap channel, coding theorem
- DOI: 10.1109/18.79919