Capacity-based random codes cannot achieve strong secrecy over symmetric wiretap channels

Abstract:

In this paper, we investigate the limitations of capacity-based random code constructions for the wiretap channel, i.e., constructions that associate to each condential message a subcode whose rate approaches the capacity of the eavesdropper's channel.

Generalizing a previous result for binary symmetric channels, we show that random capacity-based codes do not achieve the strong secrecy capacity over the symmetric discrete memoryless channels they were designed for. However, we also show that these codes can achieve strong secrecy rates provided they are used over degraded wiretap channels.

Full Text: 

C1126.pdf