2 research outputs found
Can Marton Coding Alone Ensure Individual Secrecy?
For communications in the presence of eavesdroppers, random components are
often used in code design to camouflage information from eavesdroppers. In
broadcast channels without eavesdroppers, Marton error-correcting coding
comprises random components which allow correlation between auxiliary random
variables representing independent messages. In this paper, we study if Marton
coding alone can ensure individual secrecy in the two-receiver discrete
memoryless broadcast channel with a passive eavesdropper. Our results show that
in accordance to the principle of Wyner secrecy coding, this is possible and
Marton coding alone guarantees individual secrecy. However, this comes with a
penalty of requiring stricter channel conditions
The Secure Two-Receiver Broadcast Channel With One-Sided Receiver Side Information
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.Comment: Change to results in Theorem 1; improved presentatio