SwePub
Sök i LIBRIS databas

  Extended search

id:"swepub:oai:DiVA.org:kth-191783"
 

Search: id:"swepub:oai:DiVA.org:kth-191783" > Strong Secrecy for ...

  • 1 of 1
  • Previous record
  • Next record
  •    To hitlist

Strong Secrecy for Interference Channels from Channel Resolvability

Wang, Zhao (author)
KTH,Kommunikationsteori
Schaefer, Rafael F. (author)
Skoglund, Mikael (author)
KTH,Kommunikationsteori,ACCESS Linnaeus Centre
show more...
Poor, H. Vincent (author)
Xiao, Ming (author)
KTH,Kommunikationsteori
show less...
 (creator_code:org_t)
IEEE Computer Society, 2015
2015
English.
In: 2015 49th Asilomar Conference on Signals, Systems and Computers. - : IEEE Computer Society. - 9781467385763 ; , s. 559-563
  • Conference paper (peer-reviewed)
Abstract Subject headings
Close  
  • 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.

Subject headings

TEKNIK OCH TEKNOLOGIER  -- Elektroteknik och elektronik -- Kommunikationssystem (hsv//swe)
ENGINEERING AND TECHNOLOGY  -- Electrical Engineering, Electronic Engineering, Information Engineering -- Communication Systems (hsv//eng)

Keyword

Achievable rate region
Confidential message
Direct channel
Information spectrum
Interference channels
Memoryless
Multi-user networks
Strong secrecies

Publication and Content Type

ref (subject category)
kon (subject category)

Find in a library

To the university's database

  • 1 of 1
  • Previous record
  • Next record
  •    To hitlist

Search outside SwePub

Kungliga biblioteket hanterar dina personuppgifter i enlighet med EU:s dataskyddsförordning (2018), GDPR. Läs mer om hur det funkar här.
Så här hanterar KB dina uppgifter vid användning av denna tjänst.

 
pil uppåt Close

Copy and save the link in order to return to this view