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

Laura Luzzi; Matthieu Bloch

1st International ICST Workshop on Secure Wireless Networks

Research Article

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

Cite: BibTeX Plain Text

@INPROCEEDINGS{10.4108/icst.valuetools.2011.245938,
    author={Laura Luzzi and Matthieu Bloch},
    title={Capacity-based random codes cannot achieve strong secrecy over symmetric wiretap channels},
    proceedings={1st International ICST Workshop on Secure Wireless Networks},
    publisher={ACM},
    proceedings_a={SECURENETS},
    year={2012},
    month={6},
    keywords={wiretap channel strong secrecy},
    doi={10.4108/icst.valuetools.2011.245938}
}

Laura Luzzi
Matthieu Bloch
Year: 2012
Capacity-based random codes cannot achieve strong secrecy over symmetric wiretap channels
SECURENETS
ICST
DOI: 10.4108/icst.valuetools.2011.245938

Laura Luzzi¹^,*, Matthieu Bloch²

1: Supélec
2: Georgia Institute of Technology

*Contact email: laura.luzzi@supelec.fr

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 confidential 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.

Keywords: wiretap channel strong secrecy

Published: 2012-06-26
Publisher: ACM

: http://dx.doi.org/10.4108/icst.valuetools.2011.245938