Polar Coding for the Wiretap Broadcast Channel with Multiple Messages

TL;DR

This paper introduces a polar coding scheme for a wiretap broadcast channel with multiple messages, achieving stronger bounds and ensuring strong secrecy through a chaining construction and secret keys.

Contribution

It designs a polar coding scheme that achieves the stronger inner-bound for the wiretap broadcast channel with multiple messages, incorporating a novel chaining construction and secret keys.

Findings

Achieves the stronger inner-bound on the capacity region.

Ensures strong secrecy with negligible secret keys.

Uses polar-based Marton's coding with a chaining construction.

Abstract

A polar coding scheme is proposed for the Wiretap Broadcast Channel with two legitimate receivers and one eavesdropper. We consider a model in which the transmitter wishes to send different confidential (and non-confidential) information to each legitimate receiver. First, we compare two inner-bounds on the achievable region of this model from the literature, and then we design a polar coding scheme that achieves the stronger one. In the proposed scheme, the encoding uses polar-based Marton's coding, where one inner-layer must be reliably decoded by both legitimate receivers, and each receiver must decode its own corresponding outer-layer. Due to the non-degradedness condition of the broadcast channel, the encoder builds a chaining construction that induces bidirectional dependencies between adjacent blocks. Indeed, these dependencies can occur between different encoding layers of different blocks. The use of two secret-keys, whose length are negligible in terms of rate, are required to prove that the polar code satisfies the strong secrecy condition.