Multiple Access Wiretap Channel With Partial Rate-Limited Feedback

被引:1
|
作者
Xu, Peng [1 ,2 ]
Chen, Gaojie [3 ]
Yang, Zheng [4 ]
Li, Yong [5 ]
Tomasin, Stefano [6 ,7 ]
机构
[1] Chongqing Univ Posts & Telecommun, Sch Commun & Informat Engn, Chongqing 400065, Peoples R China
[2] Chongqing Key Lab Mobile Commun Technol, Chongqing 400065, Peoples R China
[3] Univ Surrey, Inst Commun Syst ICS, 5G & 6G Innovat Ctr 5G & 6G, Guildford GU2 7XH, Surrey, England
[4] Fujian Normal Univ, Fujian Prov Engn Technol Res Ctr Photoelect Sensi, Key Lab Optoelec tron Sci & Technol Med, Minist Educ, Fuzhou 350007, Peoples R China
[5] Chongqing Univ, Coll Comp Sci, Chongqing 400044, Peoples R China
[6] Univ Padua, Dept Informat Engn, I-35131 Padua, Italy
[7] Univ Padua, Dept Math, I-35131 Padua, Italy
基金
英国工程与自然科学研究理事会;
关键词
Multiple access channel; wiretap channel; secrecy capacity region; partial feedback; rate-limited feedback; SECURE COMMUNICATION; CAPACITY REGION; SECRECY; INFORMATION;
D O I
10.1109/TIFS.2024.3359071
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
This paper investigates the problem of secure transmission over a two-user discrete memoryless multiple-access wiretap channel with partial rate-limited feedback (MAC-WT-PLF). The receiver can causally and securely transmit feedback to one of the transmitters at a limited rate. Three achievable rate regions and one outer bound on the secrecy capacity are presented based on three proposed coding schemes and the Sato-type bounding approach. The proposed coding schemes show that the feedback can play multiple roles, i.e., encrypting part of messages, enlarging the size of the dummy message, and increasing the correlation between the channel inputs, to enhance the secrecy performance. Of particular interest is identifying the novel role of enlarging the size of the dummy message at one of the transmitters, which enables both transmitters to benefit from the feedback significantly. In addition, the proposed achievable rate regions and outer bound are computed for the Gaussian MAC-WT-PLF, and comparative numerical results are provided under different eavesdropping cases.
引用
收藏
页码:3279 / 3294
页数:16
相关论文
共 50 条
  • [1] Wiretap Channel with Rate-limited Feedback
    Ardetsanizadeh, Ehsan
    Franceschetti, Massimo
    Javidi, Tara
    Kim, Young-Han
    2008 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY PROCEEDINGS, VOLS 1-6, 2008, : 101 - 105
  • [2] Wiretap Channel With Secure Rate-Limited Feedback
    Ardestanizadeh, Ehsan
    Franceschetti, Massimo
    Javidi, Tara
    Kim, Young-Han
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2009, 55 (12) : 5353 - 5361
  • [3] On the Multiple-Access Channel With Common Rate-Limited Feedback
    Shaviv, Dor
    Steinberg, Yossef
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2013, 59 (06) : 3780 - 3795
  • [4] On the multiple-access channel with common rate-limited feedback
    Shaviv, Dor
    Steinberg, Yossef
    2008 INTERNATIONAL ZURICH SEMINAR ON COMMUNICATIONS, 2008, : 108 - 111
  • [5] Wiretap Channel With Causal State Information and Secure Rate-Limited Feedback
    Cohen, Alejandro
    Cohen, Asaf
    IEEE TRANSACTIONS ON COMMUNICATIONS, 2016, 64 (03) : 1192 - 1203
  • [6] Wiretap Channel with Action-Dependent States and Rate-Limited Feedback
    Yin, Xinxing
    Chen, Xiao
    Xue, Zhi
    MATHEMATICAL PROBLEMS IN ENGINEERING, 2013, 2013
  • [7] Wiretap Channel With Causal State Information and Secure Rate-Limited Feedback
    Cohen, Alejandro
    Cohen, Asaf
    2013 51ST ANNUAL ALLERTON CONFERENCE ON COMMUNICATION, CONTROL, AND COMPUTING (ALLERTON), 2013, : 240 - 247
  • [8] Wiretap Channel with Rate-Limited Channel State Information
    Yin, Xinxing
    Pang, Liang
    Xue, Zhi
    MATHEMATICAL PROBLEMS IN ENGINEERING, 2015, 2015
  • [9] On the multiple-access channel with rate-limited state information at the encoders
    Cemal, Y
    Steinberg, Y
    2004 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY, PROCEEDINGS, 2004, : 106 - 106
  • [10] The Gaussian Diamond-Wiretap Channel With Rate-Limited Relay Cooperation
    Lee, Si-Hyeon
    Khisti, Ashish
    IEEE COMMUNICATIONS LETTERS, 2017, 21 (02) : 338 - 341