Skip to Main Content
In this study, the authors consider the secrecy of a one-receiver, two-eavesdropper broadcast channel (BC) with three degraded message sets. Consider a three-receiver BC with three messages, where the first message is decoded by all the receivers. The second message is decoded by the first and the second receivers and is to be kept secret from the third receiver. The third message is decoded by the first receiver and is to be kept secret from the second and the third receivers. The authors consider the imperfect secrecy condition at the second receiver, that is, it is allowed to partially decode the third message. However, the perfect secrecy condition at the third receiver, does not allow it to decode the confidential messages. The coding scheme for this model requires decoding strategy for finding the messages at different destinations. The authors propose a coding scheme which uses indirect decoding. The authors also obtain an outer bound and use it to determine the secrecy capacity region of some classes of one-receiver, two-eavesdropper BCs with three degraded message sets. The authors extend our results to the Gaussian case and evaluate the achievable region.