TY - JOUR
T1 - Generalizing Multiple Access Wiretap and Wiretap II Channel Models
T2 - Achievable Rates and Cost of Strong Secrecy
AU - Nafea, Mohamed
AU - Yener, Aylin
N1 - Funding Information:
Manuscript received January 31, 2018; revised January 3, 2019; accepted March 11, 2019. Date of publication April 2, 2019; date of current version July 12, 2019. This work was supported in part by the National Science Foundation under Grant CNS 13-14719. This paper was presented in part at the 2016 IEEE International Symposium on Information Theory [1] and the 2016 IEEE Information Theory Workshop [2].
Publisher Copyright:
© 1963-2012 IEEE.
PY - 2019/8
Y1 - 2019/8
N2 - In this paper, new two-user multiple access wiretap channel models are studied. First, the multiple access wiretap channel II with a discrete memoryless main channel under different wiretapping scenarios is introduced. The wiretapper, as in the classical wiretap channel II model, chooses a fixed-size subset of the channel uses, in which it obtains noise-free observations of one of the codewords: a deterministic function, e.g., superposition, of the two codewords or each of the two codewords. A fourth wiretapping scenario is considered, in which the wiretapper, in each position it chooses, decides to observe either one of the codewords or both codewords, with an overall budget on the number of its noiselessly observed symbols. These, thus, extend the recently examined wiretap channel II with a noisy main channel to a multiple access setting with a variety of attack models for the wiretapper. Next, the proposed multiple access wiretap channel II models are further generalized to the case when the wiretapper observes the outputs of a discrete memoryless channel, instead of erasures, outside the subset of noiseless observations. Achievable strong secrecy rate regions for all the proposed models are derived. Achievability is established by solving dual multi-terminal secret key agreement problems in the source model and converting the solution to the original channel models using probability distribution approximation arguments. The derived achievable rate regions quantify the secrecy cost due to the additional capabilities of the wiretapper with respect to the previous multiple access wiretap models.
AB - In this paper, new two-user multiple access wiretap channel models are studied. First, the multiple access wiretap channel II with a discrete memoryless main channel under different wiretapping scenarios is introduced. The wiretapper, as in the classical wiretap channel II model, chooses a fixed-size subset of the channel uses, in which it obtains noise-free observations of one of the codewords: a deterministic function, e.g., superposition, of the two codewords or each of the two codewords. A fourth wiretapping scenario is considered, in which the wiretapper, in each position it chooses, decides to observe either one of the codewords or both codewords, with an overall budget on the number of its noiselessly observed symbols. These, thus, extend the recently examined wiretap channel II with a noisy main channel to a multiple access setting with a variety of attack models for the wiretapper. Next, the proposed multiple access wiretap channel II models are further generalized to the case when the wiretapper observes the outputs of a discrete memoryless channel, instead of erasures, outside the subset of noiseless observations. Achievable strong secrecy rate regions for all the proposed models are derived. Achievability is established by solving dual multi-terminal secret key agreement problems in the source model and converting the solution to the original channel models using probability distribution approximation arguments. The derived achievable rate regions quantify the secrecy cost due to the additional capabilities of the wiretapper with respect to the previous multiple access wiretap models.
UR - http://www.scopus.com/inward/record.url?scp=85069781080&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85069781080&partnerID=8YFLogxK
U2 - 10.1109/TIT.2019.2908832
DO - 10.1109/TIT.2019.2908832
M3 - Article
AN - SCOPUS:85069781080
SN - 0018-9448
VL - 65
SP - 5125
EP - 5143
JO - IEEE Transactions on Information Theory
JF - IEEE Transactions on Information Theory
IS - 8
M1 - 8680688
ER -