7 research outputs found
MAC Resolvability: First And Second Order Results
Building upon previous work on the relation between secrecy and channel
resolvability, we revisit a secrecy proof for the multiple-access channel from
the perspective of resolvability. We then refine the approach in order to
obtain some novel results on the second-order achievable rates.Comment: Slightly extended version of the paper accepted at the 4th Workshop
on Physical-Layer Methods for Wireless Security during IEEE CNS 2017. v2:
Fixed typos and extended literature section in accordance with reviewers'
recommendation
Compound Multiple Access Channel with Confidential Messages
In this paper, we study the problem of secret communication over a Compound
Multiple Access Channel (MAC). In this channel, we assume that one of the
transmitted messages is confidential that is only decoded by its corresponding
receiver and kept secret from the other receiver. For this proposed setting
(compound MAC with confidential messages), we derive general inner and outer
bounds on the secrecy capacity region. Also, as examples, we investigate 'Less
noisy' and 'Gaussian' versions of this channel, and extend the results of the
discrete memoryless version to these cases. Moreover, providing numerical
examples for the Gaussian case, we illustrate the comparison between achievable
rate regions of compound MAC and compound MAC with confidential messages.Comment: Accepted at IEEE ICC 2014. arXiv admin note: substantial text overlap
with arXiv:1402.479