Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Strong Secrecy for Interference Channels Based on Channel Resolvability
KTH, School of Electrical Engineering (EES), Communication Theory. Ericsson Res, S-16483 Stockholm, Sweden..ORCID iD: 0000-0002-6863-7695
Princeton Univ, Dept Elect Engn, Princeton, NJ 08544 USA.;Tech Univ Berlin, Informat Theory & Applicat Chair, D-10587 Berlin, Germany..
KTH, School of Electrical Engineering and Computer Science (EECS), Information Science and Engineering.ORCID iD: 0000-0002-7926-5081
KTH, School of Electrical Engineering and Computer Science (EECS), Information Science and Engineering. Royal Inst Technol, Dept Informat Sci & Engn, S-10044 Stockholm, Sweden..ORCID iD: 0000-0002-5407-0835
Show others and affiliations
2018 (English)In: IEEE Transactions on Information Theory, ISSN 0018-9448, E-ISSN 1557-9654, Vol. 64, no 7, p. 5110-5130Article in journal (Refereed) Published
Abstract [en]

Interference channels with confidential messages are studied under strong secrecy constraints, based on the framework of channel resolvability theory. It is shown that if the random binning rate for securing a confidential message is above the resolution of its corresponding wiretapped channel, strong secrecy can be guaranteed. The information-spectrum method introduced by Han and Verdu is generalized to an arbitrary interference channel to obtain a direct channel resolvability result as a first step. For stationary and memoryless channels with discrete output alphabets, the results show that the achievable rates under weak and strong secrecy constraints are the same. This result is then generalized to channels with continuous output alphabets by deriving a reverse direction of Pinsker's inequality to bound the secrecy measure from above by a function of the variational distance of relevant distributions. As an application, Gaussian interference channels are studied in which the agreement between the best known weak and strong secrecy rate regions also appear. Following the footsteps of Csiszar, Hayashi and of Bloch and Laneman, these results provide further evidence that channel resolvability is a powerful and general framework for strong secrecy analysis in multiuser networks.

Place, publisher, year, edition, pages
Institute of Electrical and Electronics Engineers (IEEE), 2018. Vol. 64, no 7, p. 5110-5130
Keywords [en]
Strong secrecy, interference channel, channel resolvability, reverse Pinsker's inequality, variational distance.
National Category
Computer Sciences
Identifiers
URN: urn:nbn:se:kth:diva-240221DOI: 10.1109/TIT.2018.2834508ISI: 000435979500023Scopus ID: 2-s2.0-85046818165OAI: oai:DiVA.org:kth-240221DiVA, id: diva2:1270841
Note

QC 20181214

Available from: 2018-12-14 Created: 2018-12-14 Last updated: 2018-12-14Bibliographically approved

Open Access in DiVA

No full text in DiVA

Other links

Publisher's full textScopus

Authority records BETA

Wang, ZhaoSkoglund, MikaelXiao, Ming

Search in DiVA

By author/editor
Wang, ZhaoSkoglund, MikaelXiao, MingPoor, H. Vincent
By organisation
Communication TheoryInformation Science and Engineering
In the same journal
IEEE Transactions on Information Theory
Computer Sciences

Search outside of DiVA

GoogleGoogle Scholar

doi
urn-nbn

Altmetric score

doi
urn-nbn
Total: 39 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf