Change search

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: Achievable rate region and degrees of freedom
KTH, School of Electrical Engineering (EES), Communication Theory.
KTH, School of Electrical Engineering (EES), Communication Theory.ORCID iD: 0000-0002-7926-5081
KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre. KTH, School of Electrical Engineering (EES), Communication Theory.ORCID iD: 0000-0002-5407-0835
##### Abstract [en]

The achievable rate region and degrees of freedom are studied for interference channels with confidential messages under strong secrecy constraints. The problem is studied based on the framework of Han and Verd$\acute{\textrm{u}}$'s channel resolvability theory. It is shown that if the random binning rate for securing a confidential message is slightly above the resolution of its corresponding wiretapped channel, strong secrecy can be guaranteed. At first, the information-spectrum method introduced by Han and Verd$\acute{\textrm{u}}$ is generalized to an arbitrary interference channel to obtain a direct channel resolvability result. After specifying the channel transition probability, the derived resolvability results are shown to be the achievable strong secrecy rates for the stationary and memoryless interference channel. As an application, the secure degrees of freedom (SDOF) for the $K$-user Gaussian interference channel with confidential messages are investigated under strong secrecy constraints. It is shown that the optimal SDOF of the considered network is $\frac{K-1}{2K-1}$ for each user, which equals to its counterpart with weak secrecy constraints. The optimal SDOF scheme is achieved by combining the resolvability-based secrecy coding and artificial noise alignment on the real line. A suboptimal ergodic secure alignment is also proposed for the time-varying interference channels to achieve a sum SDOF of $\frac{K-3}{2K-2}$ for each user. Following the footsteps of Hayashi and of Bloch and Laneman, our results provide further evidence that channel resolvability can be a powerful and general framework for strong secrecy analysis in multiuser networks.

##### Keywords [en]
Strong secrecy, interference channel, channel resolvability, interference alignment, secure degrees of freedom
##### National Category
Electrical Engineering, Electronic Engineering, Information Engineering
##### Research subject
Information and Communication Technology
##### Identifiers
OAI: oai:DiVA.org:kth-167250DiVA, id: diva2:813203
##### Note

Submitted to IEEE Transactions on Information Theory, May 2015.

QS 2015

Available from: 2015-05-21 Created: 2015-05-21 Last updated: 2015-11-13Bibliographically approved

#### Open Access in DiVA

##### File information
File name FULLTEXT01.pdfFile size 458 kBChecksum SHA-512
Type fulltextMimetype application/pdf

#### Search in DiVA

##### By author/editor
Wang, ZhaoSkoglund, MikaelXiao, Ming
##### By organisation
Communication TheoryACCESS Linnaeus Centre
##### On the subject
Electrical Engineering, Electronic Engineering, Information Engineering

#### Search outside of DiVA

The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available
urn-nbn

#### Altmetric score

urn-nbn
Total: 175 hits

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
v. 2.35.4
|