Strong Secrecy for Interference Channels Based on Channel Resolvability
Sign Up to like & getrecommendations! Published in 2018 at "IEEE Transactions on Information Theory"
DOI: 10.1109/tit.2018.2834508
Abstract: 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… read more here.
Keywords: strong secrecy; channel resolvability; interference channels;
Cooperative Resolvability and Secrecy in the Cribbing Multiple-Access Channel
Sign Up to like & getrecommendations! Published in 2020 at "IEEE Transactions on Information Theory"
DOI: 10.1109/tit.2020.2995565
Abstract: We study channel resolvability for the discrete memoryless multiple-access channel with cribbing, i.e., the characterization of the amount of randomness required at the inputs to approximately produce a chosen i.i.d. output distribution according to Kullback-Leibler… read more here.
Keywords: multiple access; access channel; channel resolvability; resolvability ... See more keywords