Capacity-based random codes cannot achieve strong secrecy over symmetric wiretap channels - CentraleSupélec Access content directly
Conference Papers Year : 2011

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.
Fichier principal
Vignette du fichier
C1126.pdf (363.21 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-00648147 , version 1 (05-12-2011)

Identifiers

  • HAL Id : hal-00648147 , version 1

Cite

Laura Luzzi, Matthieu Bloch. Capacity-based random codes cannot achieve strong secrecy over symmetric wiretap channels. Securenets 2011, 2011, Cachan, France. 7 p. ⟨hal-00648147⟩
139 View
220 Download

Share

Gmail Facebook X LinkedIn More