The Secure Two-Receiver Broadcast Channel With One-Sided Receiver Side Information
Jin Yeong Tan, Lawrence Ong, Behzad Asadi

TL;DR
This paper introduces a secure coding scheme for a two-receiver broadcast channel with one-sided receiver side information, enhancing secrecy and rate regions, especially when the side information is at the weaker receiver.
Contribution
It proposes a superposition-Marton based coding scheme that achieves capacity in some degraded cases and leverages one-sided receiver side information for improved rates.
Findings
The scheme achieves capacity for certain degraded channels.
One-sided receiver side information improves the rate region.
The approach combines multiple secrecy techniques for enhanced security.
Abstract
This paper studies the problem of secure communcation over the two-receiver discrete memoryless broadcast channel with one-sided receiver side information and with a passive eavesdropper. We proposed a coding scheme which is based upon the superposition-Marton framework. Secrecy techniques such as the one-time pad, Carleial-Hellman secrecy coding and Wyner serecy coding are applied to ensure individual secrecy. This scheme is shown to be capacity achieving for some cases of the degraded broadcast channel. We also notice that one-sided receiver side information provides the advantage of rate region improvement, in particular when it is available at the weaker legitimate receiver.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
