Sökning: id:"swepub:oai:DiVA.org:kth-191783" >
Strong Secrecy for ...
Strong Secrecy for Interference Channels from Channel Resolvability
-
- Wang, Zhao (författare)
- KTH,Kommunikationsteori
-
Schaefer, Rafael F. (författare)
-
- Skoglund, Mikael (författare)
- KTH,Kommunikationsteori,ACCESS Linnaeus Centre
-
visa fler...
-
Poor, H. Vincent (författare)
-
- Xiao, Ming (författare)
- KTH,Kommunikationsteori
-
visa färre...
-
(creator_code:org_t)
- IEEE Computer Society, 2015
- 2015
- Engelska.
-
Ingår i: 2015 49th Asilomar Conference on Signals, Systems and Computers. - : IEEE Computer Society. - 9781467385763 ; , s. 559-563
- Relaterad länk:
-
https://urn.kb.se/re...
-
visa fler...
-
https://doi.org/10.1...
-
visa färre...
Abstract
Ämnesord
Stäng
- 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.
Ämnesord
- TEKNIK OCH TEKNOLOGIER -- Elektroteknik och elektronik -- Kommunikationssystem (hsv//swe)
- ENGINEERING AND TECHNOLOGY -- Electrical Engineering, Electronic Engineering, Information Engineering -- Communication Systems (hsv//eng)
Nyckelord
- Achievable rate region
- Confidential message
- Direct channel
- Information spectrum
- Interference channels
- Memoryless
- Multi-user networks
- Strong secrecies
Publikations- och innehållstyp
- ref (ämneskategori)
- kon (ämneskategori)
Hitta via bibliotek
Till lärosätets databas