Achieving Secrecy Capacity of the Wiretap Channel and Broadcast Channel With a Confidential Component

DOI10.1109/TIT.2016.2631223zbMATH Open1364.94578arXiv1410.3422MaRDI QIDQ2989660FDOQ2989660

Authors: T. C. Gülcü, Alexander Barg 

Publication date: 8 June 2017

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Abstract: The wiretap channel model of Wyner is one of the first communication models with both reliability and security constraints. Capacity-achieving schemes for various models of the wiretap channel have received considerable attention in recent literature. In this paper, we show that capacity of the general (not necessarily degraded or symmetric) wiretap channel under a "strong secrecy constraint" can be achieved using a transmission scheme based on polar codes. We also extend our construction to the case of broadcast channels with confidential messages defined by Csisz{'a}r and K{"orner}, achieving the entire capacity region of this communication model.

Full work available at URL: https://arxiv.org/abs/1410.3422

Mathematics Subject Classification ID

Channel models (including quantum) in information and communication theory (94A40) Authentication, digital signatures and secret sharing (94A62)

Cited In (9)

• Title not available (Why is that?)
• Polar codes for distributed hierarchical source coding
• Title not available (Why is that?)
• Secure Multiplex Coding Attaining Channel Capacity in Wiretap Channels
• A source coding problem for sources with additional outputs to keep secret from the receiver or wiretappers (Corresp.)
• A Broadcast Approach for Fading Wiretap Channels
• A New Wiretap Channel Model and Its Strong Secrecy Capacity
• The Secrecy Capacity of Cost-Constrained Wiretap Channels
• Capacity Bounds for Broadcast Channels With Confidential Messages

This page was built for publication: Achieving Secrecy Capacity of the Wiretap Channel and Broadcast Channel With a Confidential Component

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2989660)