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.
Complete list of metadatas

Cited literature [22 references]  Display  Hide  Download

https://hal-supelec.archives-ouvertes.fr/hal-00648147
Contributor : Samir Medina Perlaza <>
Submitted on : Monday, December 5, 2011 - 11:19:00 AM
Last modification on : Wednesday, July 31, 2019 - 4:18:02 PM
Long-term archiving on : Tuesday, March 6, 2012 - 2:30:50 AM

File

C1126.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-00648147, version 1

Citation

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⟩

Share

Metrics

Record views

381

Files downloads

273