Strong secrecy for interference channels from channel resolvability

Zhao Wang, Rafael F. Schaefer, Mikael Skoglund, H. Vincent Poor, Ming Xiao

Publikation: Beitrag in Buch/Bericht/KonferenzbandKonferenzbeitragBegutachtung

3 Zitate (Scopus)

Abstract

The achievable rate region is studied for interference channels with confidential messages under strong secrecy constraints. The problem is investigated based on the framework of the channel resolvability theory. The information-spectrum method introduced by Han and Verdu is first generalized to an arbitrary interference channel to obtain a direct channel resolvability result. The derived resolvability results are then shown to be the achievable strong secrecy rates for the stationary and memoryless interference channel. Our results provide further evidence that channel resolvability can be a powerful and general framework for strong secrecy analysis in multiuser networks.

OriginalspracheEnglisch
TitelConference Record of the 49th Asilomar Conference on Signals, Systems and Computers, ACSSC 2015
Redakteure/-innenMichael B. Matthews
Herausgeber (Verlag)IEEE Computer Society
Seiten559-563
Seitenumfang5
ISBN (elektronisch)9781467385763
DOIs
PublikationsstatusVeröffentlicht - 26 Feb. 2016
Extern publiziertJa
Veranstaltung49th Asilomar Conference on Signals, Systems and Computers, ACSSC 2015 - Pacific Grove, USA/Vereinigte Staaten
Dauer: 8 Nov. 201511 Nov. 2015

Publikationsreihe

NameConference Record - Asilomar Conference on Signals, Systems and Computers
Band2016-February
ISSN (Print)1058-6393

Konferenz

Konferenz49th Asilomar Conference on Signals, Systems and Computers, ACSSC 2015
Land/GebietUSA/Vereinigte Staaten
OrtPacific Grove
Zeitraum8/11/1511/11/15

Fingerprint

Untersuchen Sie die Forschungsthemen von „Strong secrecy for interference channels from channel resolvability“. Zusammen bilden sie einen einzigartigen Fingerprint.

Dieses zitieren