Strong secrecy for interference channels from channel resolvability

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

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

3 Scopus citations

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.

Original languageEnglish
Title of host publicationConference Record of the 49th Asilomar Conference on Signals, Systems and Computers, ACSSC 2015
EditorsMichael B. Matthews
PublisherIEEE Computer Society
Pages559-563
Number of pages5
ISBN (Electronic)9781467385763
DOIs
StatePublished - 26 Feb 2016
Externally publishedYes
Event49th Asilomar Conference on Signals, Systems and Computers, ACSSC 2015 - Pacific Grove, United States
Duration: 8 Nov 201511 Nov 2015

Publication series

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

Conference

Conference49th Asilomar Conference on Signals, Systems and Computers, ACSSC 2015
Country/TerritoryUnited States
CityPacific Grove
Period8/11/1511/11/15

Fingerprint

Dive into the research topics of 'Strong secrecy for interference channels from channel resolvability'. Together they form a unique fingerprint.

Cite this