A coding theorem for secret sharing communication systems with two Gaussian wiretap channels
Generate an AI Snapshot to get a quick, structured summary of this paper.
A concise AI-generated summary of the paper will appear here once you click Generate AI Snapshot.
TL;DR
A coding theorem is proved for the secret sharing communication system (SSCS) with two Gaussian wiretap channels and the admissible region of rates and security levels for the SSCS with twoGWCs is described by the capacities and secrecy capacities of two GWCs.
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.>